Application of 0-1 integer programming to multitarget tracking problems
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
This paper presents a new approach to the solution of multi-target tracking problems. 0-1 integer programming methods are used to alleviate the combinatorial computing difficulties that accompany any but the smallest of such problems. Multitarget tracking is approached as an unsupervised pattern recognition problem. A multiple-hypothesis test is performed to determine which particular combination of the many feasible tracks is most likely to represent actual targets. This multiple hypothesis test is shown to have the computational structure of the set packing and set partitioning problems of 0-1 integer programming. Multitarget tracking problems that are translated into this form can be rapidly solved, using well-known discrete optimization techniques such as implicit enumeration.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Pattern Classification and Scene Analysis
Thompson, M., Duda, R. O., & Hart, P. E. (1974) · Leonardo · doi:10.2307/1573081 · Cited by 4,495
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,365
A gaussian sum approach to the multi-target identification-tracking problem
Alspach, D. L. (1975) · Automatica · doi:10.1016/0005-1098(75)90044-8 · Cited by 296
Derivation and evaluation of improved tracking filter for use in dense multitarget environments
Singer, R., Sea, R., & Housewright, K. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055256 · Cited by 252
An Optimal Data Association Problem in Surveillance Theory
Sittler, R. W. (1964) · IEEE Transactions on Military Electronics · doi:10.1109/tme.1964.4323129 · Cited by 208
Stochastic optimal linear estimation and control
Керимов, М. К. (1972) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(72)90097-3 · Cited by 194
A branching algorithm for discriminating and tracking multiple objects
Smith, P., & Buechler, G. (1975) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1975.1100851 · Cited by 106
An Algorithm for Large Set Partitioning Problems
Marsten, R. E. (1974) · Management Science · doi:10.1287/mnsc.20.5.774 · Cited by 92
A Survey of Integer Programming Emphasizing Computation and Relations among Models
Garfinkel, R., & Nemhauser, G. L. (1973) · Elsevier eBooks · doi:10.1016/b978-0-12-358350-5.50007-5 · Cited by 23
Cited by
An algorithm for tracking multiple targets
Reid, D. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1102177 · Cited by 3,059
Sonar tracking of multiple targets using joint probabilistic data association
Fortmann, T., Bar-Shalom, Y., & Scheffe, M. (1983) · IEEE Journal of Oceanic Engineering · doi:10.1109/joe.1983.1145560 · Cited by 1,460
A Review of Data Fusion Techniques
Castanedo, F. (2013) · The Scientific World Journal · doi:10.1155/2013/704504 · Cited by 1,027
Message Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
A review of statistical data association techniques for motion correspondence
Cox, I. J. (1993) · International Journal of Computer Vision · doi:10.1007/bf01440847 · Cited by 346
Metadata
- Authors
- Morefield, C.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1977-06
- Volume
- 22
- Issue
- 3
- Pages
- 302-312
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2014898029
- Cited by
- 281
- References
- 10
- FWCI
- 4.35
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.