Title :
Linear-complexity CPHD filters
Author_Institution :
Unified Data Fusion Sci., Inc., Eagan, MN, USA
Abstract :
The probability hypothesis density (PHD) filter and cardinalized probability hypothesis density (CPHD) filter are principled approximations of the general multitarget Bayes recursive filter. If n is the current number of tracks and m the current number of measurements, then the former has computational complexity O(mn) and the latter O(m3 n). Although the CPHD filter has better target detection and tracking performance than the PHD filter, its cubic complexity in m will limit its practicality in many applications. The primary purpose of this paper is to derive a CPHD filter that, because of a simplified clutter model, has computational complexity O(mn). I also show how to extend this new CPHD filter to the multisensor case.
Keywords :
Bayes methods; computational complexity; recursive filters; target tracking; cardinalized probability hypothesis density filter; computational complexity; linear-complexity CPHD filters; multitarget Bayes recursive filter; Clutter; Computational complexity; Equations; Generators; Markov processes; Niobium; Target tracking; CPHD filter; PHD filter; multisource integration; multitarget filtering; multitarget tracking; random sets;
Conference_Titel :
Information Fusion (FUSION), 2010 13th Conference on
Conference_Location :
Edinburgh
Print_ISBN :
978-0-9824438-1-1
DOI :
10.1109/ICIF.2010.5711919