DocumentCode
1957949
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
Volume
5
fYear
1997
fDate
10-12 Dec 1997
Firstpage
4991
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1997., Proceedings of the 36th IEEE Conference on
Conference_Location
San Diego, CA
ISSN
0191-2216
Print_ISBN
0-7803-4187-2
Type
conf
DOI
10.1109/CDC.1997.649843
Filename
649843
Link To Document