A Probability-Based Object Tracking Method

Here we take advantage of the signal recovery power of Compressive Sensing (CS) to significantly reduce the computational complexity brought by the high-dimension image data, then an effective and efficient low-dimensional subspace representation of the object is computing by applying Principal Component Analysis (PCA) to a collection of object observations which are low-dimensional vectors derived from CS. An incremental PCA algorithm is used to update this subspace model for characterizing the object appearance changes. Meanwhile, two distances derived from Probabilistic Principal Component Analysis (PPCA): distance from feature space (DFFS) and distance in feature space (DIFS), are used to describe visual similarity between the learned subspace representation model and candidate targets. Comparing with the traditional used reconstruction error, the sum of two distances: DFFS + DIFS, is more accurate and more robust to noises and partial occlusions. Numerous experiment demonstrate that subspace representation model can handle the situation that target objects experience pose changes, scale changes, significant illumination variation, partial occlusions and so on.

[1]  Ming-Hsuan Yang,et al.  Incremental Learning for Robust Visual Tracking , 2008, International Journal of Computer Vision.

[2]  Lei Zhang,et al.  Real-Time Compressive Tracking , 2012, ECCV.

[3]  Ehud Rivlin,et al.  Robust Fragments-based Tracking using the Integral Histogram , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[4]  Michael E. Tipping,et al.  Probabilistic Principal Component Analysis , 1999 .

[5]  Haibin Ling,et al.  Robust visual tracking using ℓ1 minimization , 2009, 2009 IEEE 12th International Conference on Computer Vision.

[6]  Alex Pentland,et al.  Probabilistic Visual Learning for Object Representation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  Dimitris Achlioptas,et al.  Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..

[8]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[9]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[10]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[11]  Matthieu Guillaumin,et al.  Segmentation Propagation in ImageNet , 2012, ECCV.