5 January 2004 Group assignment problem
Author Affiliations +
Abstract
Multiple frame data association, whether it is based on multiple hypothesis tracking or multi-dimensional assignment problems, has established itself as the method of choice for difficult tracking problems, principally due to the ability to hold difficult data association decisions in abeyance until additional information is available. Over the last twenty years, these methods have focused on one-to-one assignments, many-to-one, and many-to-many assignments. Group tracking, on the other hand, introduces new complexity into the association process, especially if some soft decision making capability is desired. Thus, the goal of this work is to combine multiple grouping hypotheses for each frame of data (tracks or measurements) with matching these hypotheses across multiple frames of data using one-to-one, many-to-one, or many-to-many assignments to determine the correct hypothesis on each frame of data and connectivity across the frames. The resulting formulation is sufficiently general to cover four broad classes of problems in multiple target tracking, namely (a) group cluster tracking, (b) pixel (clump) IR cluster tracking, (c) the merged measurement problem, and (d) MHT for track-to-track fusion. What is more, the cluster assignment problem for either two or multiple dimensions represents a generalized data association problem in the sense that it reduces to the classical assignment problems when there are no overlapping groups or clusters. The formulation of the assignment problem for resolved object tracking and candidate group methods for use in multiple frame group tracking are briefly reviewed. Then, three different formulations of the group assignment problem are developed.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Aubrey B. Poore, Aubrey B. Poore, Sabino Gadaleta, Sabino Gadaleta, } "Group assignment problem", Proc. SPIE 5204, Signal and Data Processing of Small Targets 2003, (5 January 2004); doi: 10.1117/12.502721; https://doi.org/10.1117/12.502721
PROCEEDINGS
13 PAGES


SHARE
RELATED CONTENT

Advancement of an algorithm
Proceedings of SPIE (June 12 2014)
Optimization of IRST algorithms
Proceedings of SPIE (August 12 1997)
A Technique For Infrared Background Suppression
Proceedings of SPIE (November 08 1977)
Multiple frame cluster tracking
Proceedings of SPIE (August 06 2002)
Statistics of hyperspectral imaging data
Proceedings of SPIE (August 19 2001)

Back to Top