Inverse covariance intersection: New insights and properties

Abstract

Decentralized data fusion is a challenging task. Either it is too difficult to maintain and track the information required to perform fusion optimally, or too much information is discarded to obtain informative fusion results. A well-known solution is Covariance Intersection, which may provide too conservative fusion results. A less conservative alternative is discussed in this paper, and generalizations are proposed in order to apply it to a wide class of fusion problems. The Inverse Covariance Intersection algorithm is about finding the maximum possible common information shared by the estimates to be fused. A bound on the possibly shared common information is derived and removed from the fusion result in order to guarantee consistency. It is shown that the conditions required for consistency can be significantly relaxed, and also other causes of correlations, such as common process noise, can be treated.