Abstract
The ever-increasing demand in surveillance is to produce highly accurate target and track identification and estimation in real-time, even for dense target scenarios and in regions of high track contention. The use of multiple sensors, through more varied information, has the potential to greatly enhance target identification and state estimation. For multitarget tracking, the processing of multiple scans all at once yields high track identification. However, to achieve this accurate state estimation and track identification, one must solve an NP-hard data association problem of partitioning observations into tracks and false alarms in real-time. The primary objective in this work is to formulate a general class of these data association problems as multidimensional assignment problems to which new, fast, near-optimal, Lagrangian relaxation based algorithms are applicable. The dimension of the formulated assignment problem corresponds to the number of data sets being partitioned with the constraints defining such a partition. The linear objective function is developed from Bayesian estimation and is the negative log posterior or likelihood function, so that the optimal solution yields the maximum a posteriori estimate. After formulating this general class of problems, the equivalence between solving data association problems by these multidimensional assignment problems and by the currently most popular method of multiple hypothesis tracking is established. Track initiation and track maintenance using anN-scan sliding window are then used as illustrations. Since multiple hypothesis tracking also permeates multisensor data fusion, two example classes of problems are formulated as multidimensional assignment problems.
Similar content being viewed by others
References
B. D. O. Anderson and J. B. Moore,Optimal Filtering, Prentice-Hall, Englewood Cliffs, New Jersey, 1979.
Y. Bar-Shalom, ed.,Multitarget-Multisensor Tracking: Advanced Applications, Artech House, Dedham, MA., 1990.
Y. Bar-Shalom, ed.,Multitarget-Multisensor Tracking: Applications and Advances, Artech House, Dedham, MA., 1992.
Y. Bar-Shalom and T. E. Fortmann,Tracking and Data Association, Academic Press, Boston, 1988.
D. P. Bertsekas,Linear Network Optimization:Algorithms and Codes, The MIT Press, Cambridge, Mass., 1991.
D. P. Bertsekas and D. A. Castañon, “A Forward/Reverse Auction Algorithm for Asymmetric Assignment Problems,”Computational Optimization and Applications, Vol. 1, No. 3, pp. 277–298, 1992.
S. S. Blackman,Multiple TargetTracking with Radar Applications, Artech House, Dedham, MA., 1986.
S. S. Blackman, “Association and fusion of multiple sensor data,” in [2]—.
C.-Y. Chong, S. Mori, and K.-C. Chang, “Distributed multitarget multisensor tracking,” in [2] —.
I. J. Cox, J. M. Rehg, and S. Hingorani, “A Bayesian Multiple Hypothesis Approach to Contour Grouping and Segmentation,”Int. J. of Computer Vision, vol. 11, No. 1, pp. 55–24, 1993.
S. Deb, K. R. Pattipati, and Y. Bar-Shalom, “A multisensor-multitarget data association algorithm for heterogeneous systems,”IEEE Transactions on Aerospace and Electronic Systems, Vol. 29, No. 2, pp, 560–568, 1993.
S. Deb, K. R. Pattipati, Y. Bar-Shalom, and H. Tsaknakis, “A new algorithm for the generalized multidimensional assignment problem,” to appear inProc. IEEE International Conference on Systems, Man, and Cybernetics.
M. R. Garvey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., CA, 1979.
A. M. Geoffrion, “Lagrangean relaxation for integer programming,” in M. L. Balinski, ed.,Mathematical Programming Study 2: Approaches to Integer Programming, North Holland Publishing Company, Amsterdam, 1974.
R. Jonker and T. Volgenant, “A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems,”Computing 38, pp. 325–340, 1987.
T. Kurien, “Issues in the designing of practical multitarget tracking algorithms,” in [2]—.
C. L. Morefield, “Application of 0–1 integer programming to multitarget tracking problems,”IEEE Transactions on Automatic Control, Vol. AC-22, No. 3, pp. 302–312, June, 1977.
G. L. Nemhauser and L. A. Wolsey,Integer and Combinatorial Optimization, Wiley-Interscience, New York, 1988.
A. Papoulis,Probability, Random Variables, and Stochastic Processes, Second Edition, McGraw-Hill Book Company, New York, 1984.
A. B. Poore and N. Rijavec, “A Lagrangian Relaxation Algorithm for Multi-dimensional Assignment Problems Arising from Multi-target Tracking,”SIAM Journal on Optimization, Vol. 3, No. 3, pp. 545–563, 1993.
A. B. Poore and N. Rijavec, “Multitarget Tracking and Multidimensional Assignment Problems,” in Oliver E. Drummond, Editor,Proceedings of the 1991 SPIE Conference on Signal and Data Processing of Small Targets, Vol. 1481, pp. 345–356, 1991.
A. B. Poore, N. Rijavec, and T. Barker, “Data association for track initiation and extension using multiscan windows,” in Oliver E. Drummond, Editor,Signal and Data Processing of Small Targets 1992, Proc. SPIE, Vol. 1698, pp. 432–441, 1992.
A. B. Poore and N. Rijavec, “A Numerical Study of Some Data Association Problems Arising in Multitarget Tracking,” in W. W. Hager, D. W. Hearn and P. M. Pardalos, editors,Large Scale Optimization: State of the Art, Kluwer Academic Publishers, Boston, pp. 347–370, 1994.
A. B. Poore and N. Rijavec, “Partitioning multiple data sets: multidimensional assignments and Lagrangian relaxation,” to appear in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1994.
D. B. Reid, “An algorithm for tracking multiple targets,” IEEE Transactions on Automatic Control, Vol. AC-24, No. 6, pp. 843–854, December, 1979.
R. W. Sittler, “An Optimal Data Association Problem in Surveillance Theory,”IEEE Transactions on Military Electronics, Vol. MIL-8, pp. 125–139, April, 1964.
E. Waltz and J. Llinas,Multisensor Data Fusion, Artech House, Boston, 1990.
Author information
Authors and Affiliations
Additional information
This work was partially supported by the Air Force Office of Scientific Research through AFOSR Grant Numbers AFOSR-91-0138 and F49620-93-1-0133 and by the Federal Systems Company of the IBM Corporation in Boulder, CO and Owego, NY.
Rights and permissions
About this article
Cite this article
Poore, A.B. Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking. Comput Optim Applic 3, 27–57 (1994). https://doi.org/10.1007/BF01299390
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01299390