DocumentCode :
1186263
Title :
Effective tracking through tree-search
Author :
Freedman, Daniel
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Volume :
25
Issue :
5
fYear :
2003
fDate :
5/1/2003 12:00:00 AM
Firstpage :
604
Lastpage :
615
Abstract :
A new contour tracking algorithm is presented. Tracking is posed as a matching problem between curves constructed out of edges in the image, and some shape space describing the class of objects of interest. The main contributions of the paper are to present an algorithm which solves this problem accurately and efficiently, in a provable manner. In particular, the algorithm´s efficiency derives from a novel tree-search algorithm through the shape space, which allows for much of the shape space to be explored with very little effort. This latter property makes the algorithm effective in highly cluttered scenes, as is demonstrated in an experimental comparison with a condensation tracker.
Keywords :
computer vision; image matching; tracking; tree searching; approximation algorithm; compact manifold; condensation tracker; contour tracking algorithm; curves; experiment; highly cluttered scenes; hybrid optimization; shape space; tree-search; Approximation algorithms; Heuristic algorithms; Layout; Minimization methods; Shape; Space exploration; Stochastic processes; Upper bound;
fLanguage :
English
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher :
ieee
ISSN :
0162-8828
Type :
jour
DOI :
10.1109/TPAMI.2003.1195994
Filename :
1195994
Link To Document :
بازگشت