1. What are the contributions in "Multitarget tracking using the joint multitarget probability density" ?
The problem of tracking a single maneuvering target in a cluttered environment is a very well-studied area [ 4 ].. To address this deficiency, others have studied grid-based approaches [ 35, 37 ], which utilize a discrete representation of the entire single target density.. Recently, the interest of the tracking community has turned to the set of Monte Carlo techniques known as particle filtering [ 19, 59 ].. Particle filtering techniques have the advantage that they provide computational tractability [ 51 ], have provable convergence properties [ 12 ], and are applicable under the most general of circumstances, as there is no assumption made on the form of the density [ 15 ].
read more
2. How can The authoruse partition sorting to propose?
The partition sorting allows for the morecomputationally efficient IP method to be used for proposal by reordering the particles appropriately.
read more
3. What is the drawback of the CP method?
The CP method proposes particles in a permutation invariant manner, however it has the drawback of being computationally demanding.
read more
4. How do the authors cluster the partitions of each particle?
The authors use the K-means [21] algorithm to cluster the partitions of each particle, where the optimization is done across permutations of the particles.
read more





