Efficient gating in data association with multivariate Gaussian distributed states
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
An efficient algorithm for evaluating the (weighted bipartite graph of) associations between two sets of data with Gaussian error, e.g., between a set of measured state vectors and a set of estimated state vectors, is described. A general method is developed for determining, from the covariance matrix, minimal d-dimensional error ellipsoids for the state vectors which always overlap when a gating criterion is satisfied. Circumscribing boxes, or d-ranges, for the data ellipsoids are then found and whenever they overlap the association probability is computed. For efficiently determining the intersections of the d-ranges, a multidimensional search tree method is used to reduce the overall scaling of the evaluation of associations. Very few associations that lie outside the predetermined error threshold or gate are evaluated. The search method developed is a fixed Mahalanobis distance search. Empirical tests for variously distributed data in both three and eight dimensions indicate that the scaling is significantly reduced. Computational loads for many large-scale data association tasks can therefore be significantly reduced by this or related methods.>
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
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Cited by
Analytic Implementations of the Cardinalized Probability Hypothesis Density Filter
Vo, B.-T., Vo, B.-N., & Cantoni, A. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894241 · Cited by 824
Data association in stochastic mapping using the joint compatibility test
Neira, J., & Tardos, J. D. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976019 · Cited by 772
Cox, I. J., & Hingorani, S. L. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.481539 · Cited by 665
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
Markov Chain Monte Carlo Data Association for Multi-Target Tracking
Oh, S., Russell, S., & Sastry, S. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2012975 · Cited by 336
Metadata
- Authors
- Collins, J. B., & Uhlmann, J. K.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 1992-07
- Volume
- 28
- Issue
- 3
- Pages
- 909-916
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2066705949
- Cited by
- 109
- References
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient gating in data association with multivariate Gaussian distributed states. https://app.cochat.ai/papers/10.1109/7.256316
- The paper
- Collins, J. B., & Uhlmann, J. K. (1992). Efficient gating in data association with multivariate Gaussian distributed states. IEEE Transactions on Aerospace and Electronic Systems. https://doi.org/10.1109/7.256316
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.