Title:
Dynamic level sets for visual tracking
Dynamic level sets for visual tracking
| dc.contributor.author | Niethammer, Marc | |
| dc.contributor.author | Tannenbaum, Allen R. | |
| dc.contributor.corporatename | Georgia Institute of Technology. School of Electrical and Computer Engineering | |
| dc.date.accessioned | 2009-11-30T21:01:34Z | |
| dc.date.available | 2009-11-30T21:01:34Z | |
| dc.date.issued | 2003-12 | |
| dc.description | ©2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. | en |
| dc.description | Presented at the 42nd IEEE Conference on Decision and Control, December 9-12, 2003, Maui, Hawaii, USA. | |
| dc.description | DOI: 10.1109/CDC.2003.1272383 | |
| dc.description.abstract | In this paper we describe two methods for tracking planar curves which are allowed to change topology. In contrast to previous approaches a level set formulation is used that allows for the propagation of state information (here a velocity vector) with every point on a curve. The curve dynamics are derived by minimizing an action integral (based on Hamilton's principle). Incorporating velocity information for every point on a curve lifts the originally two dimensional problem to four dimensions, and thus to a codimension three problem. Since basic level set approaches implicitly describe codimension one hypersurfaces, we introduce two methods suitable for codimension three problems within a level set framework. The partial level set approach, which propagates velocity information along with the curve by solving two additional transport equations, and the full level set approach, which is formulated by means of a vector distance function evolution equation. The full level set approach allows for complete topological flexibility (including intersecting curves in the image plane). However, it is computationally expensive. The partial level set approach compromises the topological flexibility for computational efficiency. In particular, the full level set approach has the potential for tracking objects throughout occlusions, when combined with a suitable collision detection algorithm. | en |
| dc.identifier.citation | Marc Niethammer and Allen Tannenbaum, “Dynamic level sets for visual tracking,” 42nd IEEE Conference on Decision and Control, 2003, Vol. 5, 4883-4888. | en |
| dc.identifier.isbn | 0-7803-7924-1 | |
| dc.identifier.issn | 0191-2216 | |
| dc.identifier.uri | http://hdl.handle.net/1853/31239 | |
| dc.language.iso | en_US | en |
| dc.publisher | Georgia Institute of Technology | en |
| dc.publisher.original | Institute of Electrical and Electronics Engineers | |
| dc.subject | Object detection | en |
| dc.subject | Topology | en |
| dc.subject | Tracking | en |
| dc.title | Dynamic level sets for visual tracking | en |
| dc.type | Text | |
| dc.type.genre | Proceedings | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | Wallace H. Coulter Department of Biomedical Engineering | |
| relation.isOrgUnitOfPublication | da59be3c-3d0a-41da-91b9-ebe2ecc83b66 |