2015
DOI: 10.1109/lsp.2015.2390417
|View full text |Cite
|
Sign up to set email alerts
|

Minimum Covariance Bounds for the Fusion under Unknown Correlations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
42
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 97 publications
(48 citation statements)
references
References 20 publications
0
42
0
Order By: Relevance
“…Hence, the optimal distributed fusion with nonlinear model becomes one of the most important direction of signal processing. To our best knowledge, the most effective algorithms for fusion are based on covariance intersection (CI) [10,11]. These CI-based algorithms can be easily combined with nonlinear filers to form the state-of-the-art solutions to nonlinear problems, such as UKF-SCI [12] and DPF-ICI [13].…”
Section: Introductionmentioning
confidence: 99%
“…Hence, the optimal distributed fusion with nonlinear model becomes one of the most important direction of signal processing. To our best knowledge, the most effective algorithms for fusion are based on covariance intersection (CI) [10,11]. These CI-based algorithms can be easily combined with nonlinear filers to form the state-of-the-art solutions to nonlinear problems, such as UKF-SCI [12] and DPF-ICI [13].…”
Section: Introductionmentioning
confidence: 99%
“…It has been shown that, without any assumptions about the correlations, CI provides the optimal fused estimate that guarantees that P f is consistent [15].…”
Section: Track-to-track Fusionmentioning
confidence: 99%
“…The Covariance Intersection (CI) algorithm is the most popular method in this first group of algorithms [36]. It is proven to deliver consistent estimates, but involves an optimization step that might be computationally demanding and leads to conservative fused estimates [38]. Among the faster, but for some situations, worse performing, alternatives are, e.g., the fast CI algorithm [39] and the improved fast CI [40] algorithm.…”
Section: Related Workmentioning
confidence: 99%