|
|
|
| Performance Analysis and Comparison of Two Classic Algorithms in Multi-target Tracking |
| Wang Zhi; Xu Xiao-bin; Liu Wei-feng; Wen Cheng-lin |
| Institute of Information and Control, Hangzhou Dianzi University, Hangzhou 310018, China |
|
|
|
|
Abstract There are two primary ways to process multi-target tracking problem. One is data association method, whose deputies are PDA and JPDA. The other is direct method without the data association, whose deputies are random sets theory and GM-PHD. Two representational algorithms are chosen from aforementioned two kinds of methods respectively, that is, JPDA and GM-PHD. Firstly, general analytical forms to evaluate calculation complexity of each algorithm are formulated by analyzing and totaling their major operation steps. Secondly, the calculation complexity of two algorithms is compared through three cases respectively, which are divided on the basis of associated complexity between states and the measurements. Finally, one example, including tracking effect and the running time, is utilized to illustrate the analytical forms of evaluating calculation complexity proposed in this paper.
|
|
Received: 23 June 2009
|
|
|
|
Corresponding Authors:
Wen Cheng-lin
|
|
|
|
|
|
|
2010, Vol. 32 
