Skip to main content
Log in

Sequential binary code selection for robust object tracking

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

The appearance model, which is required to be adaptive to the non-stationary environment, is the essential step in object tracking but normally suffers from imbalance between effectiveness and efficiency. In this paper, a novel method named as sequential binary code selection (SBC) is proposed to learn a set of compact binary codes for image patch representation. Using the sparse projections, the high dimensional feature can be speedily embedded into the compact binary codes with preserving both the label information and geometrical distance. By the sequential learning, the latter learned binary code which corrects the errors made by the previous codes is more discriminative to the present environment. Furthermore, though binary code selection, the most compact and least redundant hash codes from the candidate pool will be selected and kept. Experimental results illustrate the effectiveness of the SBC, as well as the state-of-the-art tracking performance of the proposed approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. It is worth to point out that the index |Φt− 1| is less than the index t − 1 because the most discriminative binary codes are selected and kept by a step which is introduced in Section 3.2.

References

  1. Achlioptas D (2003) Database-friendly random projections: Johnson-lindenstrauss with binary coins. Journal of Computer and System Sciences (66):671–687

  2. Avidan S (2007) Ensemble tracking. IEEE Trans PAMI 29(2):261–271

    Article  Google Scholar 

  3. Babenko B, Yang MH, Belongie S (2011) Robust object tracking with online multiple instance learning. IEEE Trans PAMI 33(8):1619–1632

    Article  Google Scholar 

  4. Belkin M, Niyogi P (2003) Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput 15:1373–1396

    Article  Google Scholar 

  5. Chen K, Tao W, Han S (2017) Visual object tracking via enhanced structural correlation filter. Inf Sci 394:232–245

    Article  Google Scholar 

  6. Collins RT, Liu Y, Leordeanu M (2005) Online selection of discriminative tracking features. IEEE Trans PAMI 27(10):1631–1643

    Article  Google Scholar 

  7. Gao J, Xing J, Hu W, Maybank S (2013) Discriminant tracking using tensor representation with semi-supervised improvement. In: Proceedings of the ICCV

  8. Gionis A, Indyky P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of the International Conference on Very Large Datadases

  9. Grabner H, Bischof H (2006) On-line boosting and vision. In: Proceedings of the CVPR

  10. He J, Radhakrishnan R, Chang SF, Bauer C (2011) Compact hashing with joint optimization of search accuracy and time. In: Proceedings of the CVPR

  11. Henriques JF, Caseiro R, Martins P, Batista J (2012) Exploiting the circulant structure of tracking-by-detection with kernels. In: Proceedings of the ECCV

  12. Heo J P, Lee Y, He J, Chang S F, Yoon SE (2012) Spherical hashing. In: Proceedings of the CVPR

  13. Jin Z, Hu Y, Lin Y, Zhang D, Lin S, Cai D, Xuelong (2013) Complementary projection hashing. In: Proceedings of the ICCV

  14. Johnson WB, Lindenstrauss J (1982) Extensions of lipschitz mappings into a hilbert space. In: Conference in modern analysis and probability

  15. Kulis B, Jain P, Grauman K (2009) Fast similarity search for learned metrics. IEEE Tansactions on TPAMI

  16. Kwon J, Lee KM (2010) Visual tracking decomposition. In: Proceedings of the CVPR

  17. Kwon J, Lee KM (2011) Tracking by sampling trackers. In: Proceedings of the ICCV

  18. Li H, Li Y, Porikli F (2016) Deeptrack: learning discriminative feature representations online for robust visual tracking. IEEE Trans Image Process 25 (4):1834–1848

    Article  MathSciNet  Google Scholar 

  19. Li P, Hastie TJ, Church KW (2006) Very sparse random projections. In: Proceedings of the KDD, pp 287–296

  20. Li X, Shen C, Dick A, Van den Hengel A (2013) Learning compact binary codes for visual tracking. In: Proceedings of the CVPR

  21. Lin G, Shen C, Suter D, Van den Hengel A (2013) A general two-step approach to learning-based hashing. In: Proceedings of the ICCV

  22. Liu H, Yan S (2010) Robust graph mode seeking by graph shift. In: Proceedings of the ICML

  23. Luenberger DG, Ye Y (2008) Linear and nonlinear programming, international series in operations research & management science, vol 116. Springer, Berlin. ISBN 978-0-387-74503-9

    Google Scholar 

  24. Mei X, Ling H (2009) Robust visual tracking using l1 minimization. In: Proceedings of the ICCV

  25. Mu Y, Chen X, Liu X, Chua TS, Yan S (2012) Multimedia semantics-aware query-adaptive hashing with bits reconfigurability. Int J Multimed Info Retr 1:59–70

    Article  Google Scholar 

  26. Oron S, Bar-Hillel A, Levi D, Avidan S (2012) Locally orderless tracking. In: Proceedings of the CVPR

  27. Pavan M, Pelillo M (2007) Dominant sets and pairwise clustering. IEEE Trans TPAMI 29(1)

  28. Ross DA, Lim J, Lin RS, Yang MH (2008) Incremental learning for robust visual tracking. IJCV 77(3):125–141

    Article  Google Scholar 

  29. Wang J, Kumar S, Chang SF (2010) Sequential projection learning for hashing with compact codes. In: Proceedings of the ICML

  30. Wang J, Kumar S, Chang SF (2012) Semi-supervised hashing for large scale search. IEEE Tansactions on TPAMI

  31. Weibull JW (1997) Evolutionary game theory. MIT Press, Cambridge

    MATH  Google Scholar 

  32. Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: Proceedings of the NIPS

  33. Wu Y, Lim J, Yang MH (2013) Online object tracking: a benchmark. In: Proceedings of the CVPR

  34. Yi S, Jiang N, Feng B, Wang X, Liu W (2016) Online similarity learning for visual tracking. Inf Sci 364–365:33–50

    Article  Google Scholar 

  35. Zhang K, Zhang L, Yang MH (2012) Real-time compressive tracking. In: Proceedings of the ECCV

  36. Zhang T, Ghanem B, Liu S, Ahuja N (2012) Robust visual tracking via multi-task sparse learning. In: Proceedings of the CVPR

  37. Zhang T, Ghanem B, Liu S, Xu C, Ahuja N (2016) Robust visual tracking via exclusive context modeling. IEEE Trans Cybernetics 46(1):51–63

    Article  Google Scholar 

  38. Zhong W, Lu H, Yang MH (2012) Robust object tracking via sparsity-based collaborative model. In: Proceedings of the CVPR

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Guo.

Ethics declarations

Conflict of interests

We, the authors of “Sequential Binary Code Selection for Robust Object Tracking”, have no conflict of interest to declare.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Guo, X., Xiao, N. & Zhang, L. Sequential binary code selection for robust object tracking. Multimed Tools Appl 79, 6951–6963 (2020). https://doi.org/10.1007/s11042-019-08258-w

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-019-08258-w

Keywords

Navigation