Name
Abstract | ||
|---|---|---|
In this paper, we address robust visual tracking as an incremental low-rank features learning problem in a particle filter framework. Our new algorithm first learns the observation model by extracting low-rank features and the corresponding subspace basis of the object from the initial several frames. Then the low-rank features and sparse errors can be incrementally updated using an @?"1 norm minimization model. We show that the proposed strategy is actually an online extension of Robust PCA (RPCA). Thus compared with previous methods, which directly learn subspace from corrupted observations, our model can incrementally pursuit the low-rank features for the target and detect the occlusions by the sparse errors. Furthermore, the proposed reformulation of RPCA can also be considered as an illumination study on extending batch-mode low-rank techniques for more general online time series analysis tasks. Experimental results on various challenging videos validate the superiority over other state-of-the-art methods. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.neucom.2013.10.020 | Neurocomputing |
Keywords | Field | DocType |
robust visual tracking,incremental low-rank,observation model,batch-mode low-rank technique,general online time series,low-rank feature,norm minimization model,sparse error,proposed reformulation,corresponding subspace basis,online extension,visual tracking | Time series,Computer vision,Occlusion detection,Subspace topology,Pattern recognition,Computer science,Particle filter,Eye tracking,Minification,Artificial intelligence,Machine learning | Journal |
Volume | ISSN | Citations |
131, | 0925-2312 | 15 |
PageRank | References | Authors |
0.55 | 23 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Changcheng Zhang | 1 | 26 | 2.08 |
| Risheng Liu | 2 | 833 | 59.64 |
| Tianshuang Qiu | 3 | 313 | 43.84 |
| Zhixun Su | 4 | 639 | 32.10 |