Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2499788.2499825acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicimcsConference Proceedingsconference-collections
research-article

Using appearance re-matching to improve real-time compressive tracking

Published: 17 August 2013 Publication History

Abstract

A small number of randomly generated linear measurements can preserve most of the salient information of one compressible image according to compress sensing theory. Using these measurements as features can greatly improve the speed of detection based tracking methods, and deal with the problems caused by occlusion, illumination change, pose variation and motion blur to some extent. This paper addressed to improve the state-of-the-art real-time compressive object tracking algorithm, which extracted low-dimensional multistate features of object and background, then used naïve Bayesian classifier combined with online updating mechanism to track object in real-time under the compressed domain. On the basis of its tracking results, we rematch the first 30 candidate targets with online appearance model to search for the optimum tracking position. The experimental results in lot of challenging test sequences show that the proposed algorithm has promising potential.

References

[1]
Yilmaz, A., Javed, O., Shah, M. 2006. Object tracking: a survey, ACM Computing Surveys, 38(4), 1--45.
[2]
Black, M., Jepson, A. 1998. Eigentracking: Robust matching and tracking of articulated objects using a view-based representation. IJCV 38, 63--84.
[3]
Ross, D., Lim, J., Lin, R., Yang. M.-H. 2008. Incremental learning for robust visual tracking. IJCV 77, 125--141.
[4]
Mei, X., Ling, H. 2011. Robust visual tracking and vehicle classification via sparse representation. PAMI 33, 2259--2272.
[5]
Grabner, H., Grabner, M., Bischof, H. 2006. Real-time tracking via online boosting. In: BMVC, 47--56.
[6]
Grabner, H., Leistner, C., Bischof, H. 2008. Semi-supervised On-Line Boosting for Robust Tracking. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV, Part I.LNCS, vol. 5302, 234--247.
[7]
Q. Wang, F. Chen, W. Xu, M. Yang. 2011. An experimental comparison of online object tracking algorithms, in: Proceedings of SPIE: Image and Signal Processing Track.
[8]
Babenko, B., Yang, M.-H., Belongie, S. 2011. Robust object tracking with online multiple instance learning. PAMI 33, 1619--1632.
[9]
Avidan, S. 2007. Ensemble tracking, IEEE Transactions on Pattern Analysis and Machine Intelligence, 261--271.
[10]
Comaniciu, D, Ramesh, V, Meer, P. 2003. Kernel-based object tracking, IEEE Transactions on Pattern Analysis and Machine Intelligence, 564--575.
[11]
Collins, R., Liu, Y., Leordeanu, M. 2005. Online selection of discriminative tracking features. PAMI 27, 1631--1643.
[12]
Kaihua Zhang, Lei Zhang, Ming-Hsuan Yang. 2012. Real-Time Compressive Tracking. ECCV Part III, LNCS 7574, 866--879.
[13]
Donoho, D. 2006. Compressed sensing. IEEE Trans. Inform. Theory 52, 1289--1306.
[14]
Candes, E., Tao, T. 2006: Near optimal signal recovery from random projections and universal encoding strategies. IEEE Trans. Inform. Theory 52, 5406--5425.
[15]
Candes, E., Tao, T. 2005. Decoding by linear programing. IEEE Trans. Inform. Theory51, 4203--4215.

Index Terms

  1. Using appearance re-matching to improve real-time compressive tracking

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      ICIMCS '13: Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
      August 2013
      419 pages
      ISBN:9781450322522
      DOI:10.1145/2499788
      • Conference Chair:
      • Tat-Seng Chua,
      • General Chairs:
      • Ke Lu,
      • Tao Mei,
      • Xindong Wu
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Sponsors

      • NSF of China: National Natural Science Foundation of China
      • University of Sciences & Technology, Hefei: University of Sciences & Technology, Hefei
      • Beijing ACM SIGMM Chapter

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 August 2013

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. appearance re-matching
      2. compressed domain
      3. real-time tracking

      Qualifiers

      • Research-article

      Conference

      ICIMCS '13
      Sponsor:
      • NSF of China
      • University of Sciences & Technology, Hefei

      Acceptance Rates

      ICIMCS '13 Paper Acceptance Rate 20 of 94 submissions, 21%;
      Overall Acceptance Rate 163 of 456 submissions, 36%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 111
        Total Downloads
      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 18 Nov 2024

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media