Covariance Intersection for Partially Correlated Random Vectors

Citations Over TimeTop 10% of 2017 papers

Abstract

This paper generalizes the well-known covariance intersection algorithm for distributed estimation and information fusion of random vectors. Our focus will be on partially correlated random vectors. This is motivated by the restriction of the standard covariance intersection algorithm, which treats all random vectors with arbitrary cross correlations and the restriction of the classical Kalman filter, which requires complete knowledge of the cross correlations. We first give a result to characterize the conservatism of the standard covariance intersection algorithm. We then generalize the covariance intersection algorithm to two random vectors with a given correlation coefficient bound and show in what sense the resulting covariance bound is tight. Finally, we generalize the notion of correlation coefficient bound to multiple random vectors and provide a covariance intersection algorithm for this general case. Our results will make the already popular covariance intersection more applicable and more accurate for distributed estimation and information fusion problems.

Related Papers

• → Finite covariance functions(1987)39 cited
• Separate-Group Covariance Estimation With Insufficient Data for Object Recognition(2002)
• → On the second-order statistics of the sample covariance(2004)
• Rank Covariance Matrix for a Partially Known Covariance Matrix(2006)
• → Consistent estimate of a residuals covariance for the estimation of noise covariance(2023)