The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
A new relaxation algorithm and passive sensor data association
Abstract
The static problem of associating measurements at a given time from three angle-only sensors in the presence of clutter, missed detections, and an unknown number of targets is addressed. The measurement-target association problem is formulated as one of maximizing the joint likelihood function of the measurement partition. Mathematically, this formulation leads to a generalization of the 3-D assignment (matching) problem, which is known to be NP hard. The solution to the optimization problem developed is a Lagrangian relaxation technique that successively solves a series of generalized two-dimensional (2-D) assignment problems. The algorithm is illustrated by several application examples.>
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
(1979) · Cited by 43,841
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
Bar‐Shalom, Y. (1988) · Medical Entomology and Zoology · Cited by 3,157
Self-citation
Cited by
A generalized S-D assignment algorithm for multisensor-multitarget state estimation
Deb, S., Yeddanapudi, M., Pattipati, K., & Bar-Shalom, Y. (1997) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.575891 · Cited by 415
Self-citationOn implementing 2D rectangular assignment algorithms
Crouse, D. F. (2016) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2016.140952 · Cited by 405
Approaches to Multisensor Data Fusion in Target Tracking: A Survey
Smith, D., & Singh, S. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.183 · Cited by 379
Direct Localization for Massive MIMO
Garcia, N., Wymeersch, H., Larsson, E. G., Haimovich, A. M., & Coulon, M. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666779 · Cited by 379
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
Metadata
- Authors
- Pattipati, K. R., Deb, S., Bar-Shalom, Y., & Washburn, R. B.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1992
- Volume
- 37
- Issue
- 2
- Pages
- 198-213
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2002341681
- Cited by
- 280
- References
- 34
- FWCI
- 1.79
- 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.