EigenTracking: Robust Matching and Tracking of Articulated Objects Using a View-Based Representation
International Journal of Computer Vision
CONDENSATION—Conditional Density Propagation forVisual Tracking
International Journal of Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Fast Multiple Object Tracking via a Hierarchical Particle Filter
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
Robust Fragments-based Tracking using the Integral Histogram
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
ACM Computing Surveys (CSUR)
Incremental Learning for Robust Visual Tracking
International Journal of Computer Vision
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust and fast collaborative tracking with two stage sparse optimization
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
On-line multi-view forests for tracking
Proceedings of the 32nd DAGM conference on Pattern recognition
Robust Visual Tracking and Vehicle Classification via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Robust visual tracking via multi-task sparse learning
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Robust Visual Tracking via Structured Multi-Task Sparse Learning
International Journal of Computer Vision
Visual tracking with representative templates based on low-rank matrix
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.00 |
In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm capitalizes on the inherent low-rank structure of particle representations that are learned jointly. As such, it casts the tracking problem as a low-rank matrix learning problem. This low-rank sparse tracker (LRST) has a number of attractive properties. (1) Since LRST adaptively updates dictionary templates, it can handle significant changes in appearance due to variations in illumination, pose, scale, etc. (2) The linear representation in LRST explicitly incorporates background templates in the dictionary and a sparse error term, which enables LRST to address the tracking drift problem and to be robust against occlusion respectively. (3) LRST is computationally attractive, since the low-rank learning problem can be efficiently solved as a sequence of closed form update operations, which yield a time complexity that is linear in the number of particles and the template size. We evaluate the performance of LRST by applying it to a set of challenging video sequences and comparing it to 6 popular tracking methods. Our experiments show that by representing particles jointly, LRST not only outperforms the state-of-the-art in tracking accuracy but also significantly improves the time complexity of methods that use a similar sparse linear representation model for particles [1].