Title :
Computational complexity analysis for multiple hypothesis tracking
Author :
Cong, Shan ; Hong, Lang
Author_Institution :
Dept. of Electr. Eng., Wright State Univ., Dayton, OH, USA
Abstract :
This paper presents a detailed analysis of the computational complexity of multiple hypothesis tracking (MHT). The result shows that the computational complexity of MHT is dominated by the number of hypotheses. Track merging and pruning are also analyzed. The results of this paper provide a new efficient tool for selecting parameters for an MHT tracker and predicting its complexity
Keywords :
computational complexity; signal processing; target tracking; computational complexity; multiple hypothesis tracking; signal processing; target tracking; Computational complexity; Data processing; Logic; Merging; Neural networks; Personal digital assistants; Signal processing algorithms; Surveillance; Target tracking; Trajectory;
Conference_Titel :
Decision and Control, 1997., Proceedings of the 36th IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7803-4187-2
DOI :
10.1109/CDC.1997.649843
