Robust tracking using local sparse appearance model and K-selection

Online learned tracking is widely used for it's adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of errors during the self-updating, especially for occluded scenarios. The recent literature demonstrates that appropriate co...

Full description

Saved in:
Bibliographic Details
Published inCVPR 2011 pp. 1313 - 1320
Main Authors Baiyang Liu, Junzhou Huang, Lin Yang, Kulikowsk, C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2011
Subjects
Dictionaries
Encoding
Heuristic algorithms
Histograms
Image reconstruction
Libraries
Target tracking
Online AccessGet full text

Cover

More Information
Summary:Online learned tracking is widely used for it's adaptive ability to handle appearance changes. However, it introduces potential drifting problems due to the accumulation of errors during the self-updating, especially for occluded scenarios. The recent literature demonstrates that appropriate combinations of trackers can help balance stability and flexibility requirements. We have developed a robust tracking algorithm using a local sparse appearance model (SPT). A static sparse dictionary and a dynamically online updated basis distribution model the target appearance. A novel sparse representation-based voting map and sparse constraint regularized mean-shift support the robust object tracking. Besides these contributions, we also introduce a new dictionary learning algorithm with a locally constrained sparse representation, called K-Selection. Based on a set of comprehensive experiments, our algorithm has demonstrated better performance than alternatives reported in the recent literature.
ISBN:1457703947
9781457703942
ISSN:1063-6919
DOI:10.1109/CVPR.2011.5995730