A Robust Algorithm for Multiple Moving Targets Tracking

Article Preview

Abstract:

An algorithm for multiple moving targets tracking in computer vision is put forward in this paper. The association between the tracking chains and new targets detected is mainly discussed. There are four situations. Among them, the most complicated is that several tracking chains exist and several new targets are detected. The distance between new targets and old targets is used to determine whether they are the same targets. When the tracking chain is found broken, it is seen that the target has passed the monitoring area, and begins to count. In the paper, the program code is shown, too. In the end of the paper, real images on the spot are used to test the algorithm. Its good effect can be proved from practical spot.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2638-2641

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Enwei Zhang, Feng Chen. A Fast and Robust People Counting Method in Video Surveillance. 2007 International Conference on Computational Intelligence and Security, 2007: 339-343.

DOI: 10.1109/cis.2007.85

Google Scholar

[2] N. Krahnst, Over M. Yeasin, Towards a Unified Framework for Tracking and Analysis of Human Motion, Workshop on Detection and Recognition of Events in Video, 2001: l-8.

DOI: 10.1109/event.2001.938865

Google Scholar

[3] Roya Rad, Mansour Jamzad. Real-time Classification and Tracking of Multiple Vehicles in Highways. Pattern Recognition Letters, 2005, 26(10): 1598-1606.

DOI: 10.1016/j.patrec.2005.01.010

Google Scholar

[4] KaraulovaI, Hall P and Marshall A. A hierarchical model of dynamic for tracking people with a single video camera. British Machine Vision Conference, Bristol, UK, 2000: 352-361.

DOI: 10.5244/c.14.36

Google Scholar

[5] Jang D-Sand Choi H-I. Active Models for Tracking Moving Objects. Pattern Recognition, 2000, 33(7): 1135-1138.

DOI: 10.1016/s0031-3203(99)00100-4

Google Scholar