Online spatio-temporal structural context learning for visual tracking
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part IV
Local appearance based robust tracking via sparse representation
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Robust Visual Tracking via Structured Multi-Task Sparse Learning
International Journal of Computer Vision
Target Tracking Using Multiple Patches and Weighted Vector Median Filters
Journal of Mathematical Imaging and Vision
Sparse coding based visual tracking: Review and experimental comparison
Pattern Recognition
Multi-part sparse representation in random crowded scenes tracking
Pattern Recognition Letters
Robust visual tracking using dynamic classifier selection with sparse representation of label noise
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part III
Structured visual tracking with dynamic graph
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part III
A novel particle filter with implicit dynamic model for irregular motion tracking
Machine Vision and Applications
Collaborative object tracking model with local sparse representation
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
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.