Variable Scale Compressive Tracking Based on Structural Constraint Sample

Abstract:

A variable scale compressive tracking algorithm based on structural constraint sample is presented to solve the variable scale problem in this paper. A number of scanning windows with different scales and positions are obtained by structural constraint sampling.Some sparse random sensing matrices with different scales that can be computed offline easily are adopted to extract the features of different foreground target and background sample image patches with relevant scales online, the sample patch having a maximal score is regarded as the new tracking result by classifying the compressive features via a naive bayesian classifier,meanwhile,to update the location and scale. Experimental results show the proposed algorithm performs favorably against state-of-the-art algorithms on challenging sequences in terms of the basic attitude and scale change, which is robust and does not depend on the scale selection of the initial tracking area.

• Periodical: Applied Mechanics and Materials (Volumes 488-489)
• Pages: 1074-1078
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.488-489.1074
• Online since: January 2014
• Authors: Lu Ping Zhang*, Meng Cai, Biao Li, Lu Ping Wang
• Keywords: Compressive Tracking, Sparse Sensing Matrix, Structural Constraint Sampling

References

[1] Mei X, Ling H. Robust visual tracking and vehicle classification via sparse representation[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011, 33(4): 1619-1632.

DOI: 10.1109/tpami.2011.66

[2] Grabner H, Grabner M, Bischof. Real-time tracking via online boosting[C]/ Proceedings of British Machine Vision Conference, 2006: 47-56.

DOI: 10.5244/c.20.6

[3] Kalal Z, Matas J, Mikolajczyk K. P-N learning: boostrapping binary classifier by structural constranits[C]/ Proceedings of International Conference on Computer Vision and Pattern Recognition, 2010: 49-56.

DOI: 10.1109/cvpr.2010.5540231

[4] Zhang Kai-hua, Zhang Lei, Ming-Hsuan Y. Real Time compressive tracking[C]/ Proceedings of European Conference on Computer Vision, PartIII, 2012: 866-879.

[5] Candes E, Tao T. Decoding by linear programing[J]. IEEE Trans. Inform. Theory, 2005, 51(3): 4203-4215.

DOI: 10.1109/tit.2005.858979

[6] Achlioptas D. Database-friendly random projections: Johnson-Lindenstrauss with binary coins[J]. Comput. Syst. Sci, 2003, 66(6): 671-687.

DOI: 10.1016/s0022-0000(03)00025-4

[7] Baraniuk R, Davenport M, Devore R. A simple proof of the restricted isometry property for random matrices[J]. Constructive Approximation, 2008, 28(7): 253-263.

DOI: 10.1007/s00365-007-9003-x

[8] Diaconis P, Freedman D. Asymptotics of graphical projection pursuit[J]. Annals of Applied Statistics, 1984, 12(8): 228-235.

DOI: 10.1214/aos/1176346703

[9] Adam A, Rivlin E. Robust fragments-based tracking using the integral histogram [C]/ Proceedings of International Conference on Computer Vision and Pattern Recognition, 2006: 798-805.

DOI: 10.1109/cvpr.2006.256

[10] Babenko B, Yang M H. Robust object tracking with online multiple instrance learning[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011, 33(2): 1619-1632.

DOI: 10.1109/tpami.2010.226