Multi - scale Target Tracking Algorithm with Kalman Filter in Compression Sensing

Publications

Share / Export Citation / Email / Print / Text size:

International Journal of Advanced Network, Monitoring and Controls

Xi'an Technological University

Subject: Computer Science, Software Engineering

GET ALERTS

eISSN: 2470-8038

DESCRIPTION

4
Reader(s)
4
Visit(s)
0
Comment(s)
0
Share(s)

SEARCH WITHIN CONTENT

FIND ARTICLE

Volume / Issue / page

Related articles

VOLUME 2 , ISSUE 3 (September 2017) > List of articles

Multi - scale Target Tracking Algorithm with Kalman Filter in Compression Sensing

Yichen Duan / Xue Li / Peng Wang / Dan Xu

Keywords : compression sensing, CT, multi-scale, Kalman filter

Citation Information : International Journal of Advanced Network, Monitoring and Controls. Volume 2, Issue 3, Pages 10-14, DOI: https://doi.org/10.1109/iccnea.2017.30

License : (CC BY-NC-ND 4.0)

Published Online: 09-April-2018

ARTICLE

ABSTRACT

Real-time Compressive Tracking (CT) uses the compression sensing theory to provide a new research direction for the target tracking field. The algorithm is simple, efficient and real-time. But there are still shortcomings: tracking results prone to drift phenomenon, cannot adapt to tracking the target scale changes. In order to solve these problems, this paper proposes to use the Kalman filter to generate the distance weights, and then use the weighted Bayesian classifier to correct the tracking position, and perform multi-scale template acquisition in the determined position to adapt to the changes of the target scale. Finally, introducing the adaptive learning rate while updating to improve the tracking effect.. Experiments show that the improved algorithm has better robustness than the original algorithm on the basis of maintaining the original algorithm real-time.

Content not available PDF Share

FIGURES & TABLES

REFERENCES

Donoho D. Compressed sensing [J]. IEEE Transactions on Infor-mation Theory200652(4): 1289-1306.

 

Candes ETao T. Near optimal signal recovery from random projections and universal encoding strategies [J]. IEEE Transactions on Information Theory(S0018-9448)200652(4)5406-5425.

 

Achlioptas D. Database-friendly random projections Johnson-Lindenstrauss with binary coins [J]. Journal of Computer and System Sciences(S0022-0000)200366671–687.

 

Baraniuk RDavenport MDe Vore Ret al. Wakin M. A simple proof of the restricted isometry property for random matrices [J]. Constructive Approximation(S0176-4276)200828253–263.

 

Diaconis P Freedman D. Asymptotics of graphical projection pursuit [J]. The Annals of Statistics(S0090-5364)198412(3)228–235.

 

Jain A Nandakumar K ROSS A. Score normalization in multimo-dal biometric systems[J]. Pattern Recognition200538 (12 ):2270-2285.

 

MAZINAN A HAMIRLATIFI A. Applying mean shiftmo-tion information and Kalman filtering approaches to object tracking [J]. ISA transactions201251(3)485497.

 

ZHANG Kaihua ZHANG Lei YANG Ming-Hsuan. Real-Time Compressive Tracking [C]. Proceedings of the 12th European conference on Computer VisionFlorenceItalyOct 8-1120123866–879.

 

EXTRA FILES

COMMENTS