Covariance intersection

Last updated

Covariance intersection (CI) is an algorithm for combining two or more estimates of state variables in a Kalman filter when the correlation between them is unknown. [1] [2] [3] [4]

Contents

Formulation

Items of information a and b are known and are to be fused into information item c. We know a and b have mean/covariance , and , , but the cross correlation is not known. The covariance intersection update gives mean and covariance for c as

where ω is computed to minimize a selected norm, e.g., the trace, or the logarithm of the determinant. While it is necessary to solve an optimization problem for higher dimensions, closed-form solutions exist for lower dimensions. [5]

Application

CI can be used in place of the conventional Kalman update equations to ensure that the resulting estimate is conservative, regardless of the correlation between the two estimates, with covariance strictly non-increasing according to the chosen measure. The use of a fixed measure is necessary for rigor to ensure that a sequence of updates does not cause the filtered covariance to increase. [1] [6]

Advantages

According to a recent survey paper [7] and, [8] the covariance intersection has the following advantages:

  1. The identification and computation of the cross covariances are completely avoided.
  2. It yields a consistent fused estimate, and thus a non-divergent filter is obtained.
  3. The accuracy of the fused estimate outperforms each local one.
  4. It gives a common upper bound of actual estimation error variances, which has robustness with respect to unknown correlations.

These advantages have been demonstrated in the case of simultaneous localization and mapping (SLAM) involving over a million map features/beacons. [9]

Motivation

It is widely believed that unknown correlations exist in a diverse range of multi-sensor fusion problems. Neglecting the effects of unknown correlations can result in severe performance degradation, and even divergence. As such, it has attracted and sustained the attention of researchers for decades. However, owing to its intricate, unknown nature, it is not easy to come up with a satisfying scheme to address fusion problems with unknown correlations. If we ignore the correlations, which is the so-called "naive fusion", [10] it may lead to filter divergence. To compensate this kind of divergence, a common sub-optimal approach is to artificially increase the system noise. However, this heuristic requires considerable expertise and compromises the integrity of the Kalman filter framework. [11]

Related Research Articles

<span class="mw-page-title-main">Kalman filter</span> Algorithm that estimates unknowns from a series of measurements over time

For statistics and control theory, Kalman filtering, also known as linear quadratic estimation (LQE), is an algorithm that uses a series of measurements observed over time, including statistical noise and other inaccuracies, and produces estimates of unknown variables that tend to be more accurate than those based on a single measurement alone, by estimating a joint probability distribution over the variables for each timeframe. The filter is named after Rudolf E. Kálmán, who was one of the primary developers of its theory.

<span class="mw-page-title-main">Synthetic-aperture radar</span> Form of radar used to create images of landscapes

Synthetic-aperture radar (SAR) is a form of radar that is used to create two-dimensional images or three-dimensional reconstructions of objects, such as landscapes. SAR uses the motion of the radar antenna over a target region to provide finer spatial resolution than conventional stationary beam-scanning radars. SAR is typically mounted on a moving platform, such as an aircraft or spacecraft, and has its origins in an advanced form of side looking airborne radar (SLAR). The distance the SAR device travels over a target during the period when the target scene is illuminated creates the large synthetic antenna aperture. Typically, the larger the aperture, the higher the image resolution will be, regardless of whether the aperture is physical or synthetic – this allows SAR to create high-resolution images with comparatively small physical antennas. For a fixed antenna size and orientation, objects which are further away remain illuminated longer - therefore SAR has the property of creating larger synthetic apertures for more distant objects, which results in a consistent spatial resolution over a range of viewing distances.

<span class="mw-page-title-main">Simultaneous localization and mapping</span> Computational navigational technique used by robots and autonomous vehicles

Simultaneous localization and mapping (SLAM) is the computational problem of constructing or updating a map of an unknown environment while simultaneously keeping track of an agent's location within it. While this initially appears to be a chicken or the egg problem, there are several algorithms known to solve it in, at least approximately, tractable time for certain environments. Popular approximate solution methods include the particle filter, extended Kalman filter, covariance intersection, and GraphSLAM. SLAM algorithms are based on concepts in computational geometry and computer vision, and are used in robot navigation, robotic mapping and odometry for virtual reality or augmented reality.

<span class="mw-page-title-main">Sensor array</span> Group of sensors used to increase gain or dimensionality over a single sensor

A sensor array is a group of sensors, usually deployed in a certain geometry pattern, used for collecting and processing electromagnetic or acoustic signals. The advantage of using a sensor array over using a single sensor lies in the fact that an array adds new dimensions to the observation, helping to estimate more parameters and improve the estimation performance. For example an array of radio antenna elements used for beamforming can increase antenna gain in the direction of the signal while decreasing the gain in other directions, i.e., increasing signal-to-noise ratio (SNR) by amplifying the signal coherently. Another example of sensor array application is to estimate the direction of arrival of impinging electromagnetic waves. The related processing method is called array signal processing. A third examples includes chemical sensor arrays, which utilize multiple chemical sensors for fingerprint detection in complex mixtures or sensing environments. Application examples of array signal processing include radar/sonar, wireless communications, seismology, machine condition monitoring, astronomical observations fault diagnosis, etc.

<span class="mw-page-title-main">Sensor fusion</span> Combining of sensor data from disparate sources

Sensor fusion is the process of combining sensor data or data derived from disparate sources such that the resulting information has less uncertainty than would be possible when these sources were used individually. For instance, one could potentially obtain a more accurate location estimate of an indoor object by combining multiple data sources such as video cameras and WiFi localization signals. The term uncertainty reduction in this case can mean more accurate, more complete, or more dependable, or refer to the result of an emerging view, such as stereoscopic vision.

The fast Kalman filter (FKF), devised by Antti Lange (born 1941), is an extension of the Helmert–Wolf blocking (HWB) method from geodesy to safety-critical real-time applications of Kalman filtering (KF) such as GNSS navigation up to the centimeter-level of accuracy and satellite imaging of the Earth including atmospheric tomography.

Recursive least squares (RLS) is an adaptive filter algorithm that recursively finds the coefficients that minimize a weighted linear least squares cost function relating to the input signals. This approach is in contrast to other algorithms such as the least mean squares (LMS) that aim to reduce the mean square error. In the derivation of the RLS, the input signals are considered deterministic, while for the LMS and similar algorithms they are considered stochastic. Compared to most of its competitors, the RLS exhibits extremely fast convergence. However, this benefit comes at the cost of high computational complexity.

In statistics, generalized least squares (GLS) is a method used to estimate the unknown parameters in a linear regression model when there is a certain degree of correlation between the residuals in the regression model. Least squares and weighted least squares may need to be more statistically efficient and prevent misleading inferences. GLS was first described by Alexander Aitken in 1935.

A radar tracker is a component of a radar system, or an associated command and control (C2) system, that associates consecutive radar observations of the same target into tracks. It is particularly useful when the radar system is reporting data from several different targets or when it is necessary to combine the data from several different radars or other sensors.

<span class="mw-page-title-main">MUSIC (algorithm)</span> Algorithm used for frequency estimation and radio direction finding

MUSIC is an algorithm used for frequency estimation and radio direction finding.

The image fusion process is defined as gathering all the important information from multiple images, and their inclusion into fewer images, usually a single one. This single image is more informative and accurate than any single source image, and it consists of all the necessary information. The purpose of image fusion is not only to reduce the amount of data but also to construct images that are more appropriate and understandable for the human and machine perception. In computer vision, multisensor image fusion is the process of combining relevant information from two or more images into a single image. The resulting image will be more informative than any of the input images.

In statistics, confirmatory factor analysis (CFA) is a special form of factor analysis, most commonly used in social science research. It is used to test whether measures of a construct are consistent with a researcher's understanding of the nature of that construct. As such, the objective of confirmatory factor analysis is to test whether the data fit a hypothesized measurement model. This hypothesized model is based on theory and/or previous analytic research. CFA was first developed by Jöreskog (1969) and has built upon and replaced older methods of analyzing construct validity such as the MTMM Matrix as described in Campbell & Fiske (1959).

GPS/INS is the use of GPS satellite signals to correct or calibrate a solution from an inertial navigation system (INS). The method is applicable for any GNSS/INS system.

An alpha beta filter is a simplified form of observer for estimation, data smoothing and control applications. It is closely related to Kalman filters and to linear state observers used in control theory. Its principal advantage is that it does not require a detailed system model.

In estimation theory, the extended Kalman filter (EKF) is the nonlinear version of the Kalman filter which linearizes about an estimate of the current mean and covariance. In the case of well defined transition models, the EKF has been considered the de facto standard in the theory of nonlinear state estimation, navigation systems and GPS.

The unscented transform (UT) is a mathematical function used to estimate the result of applying a given nonlinear transformation to a probability distribution that is characterized only in terms of a finite set of statistics. The most common use of the unscented transform is in the nonlinear projection of mean and covariance estimates in the context of nonlinear extensions of the Kalman filter. Its creator Jeffrey Uhlmann explained that "unscented" was an arbitrary name that he adopted to avoid it being referred to as the “Uhlmann filter” though others have indicated that "unscented" is a contrast to "scented" intended as a euphemism for "stinky"

Jeffrey K. Uhlmann is an American research scientist who is probably best known for his mathematical generalizations of the Kalman filter. Most of his publications and patents have been in the field of data fusion. He is also known for being a cult filmmaker and former recording artist.

Generalized filtering is a generic Bayesian filtering scheme for nonlinear state-space models. It is based on a variational principle of least action, formulated in generalized coordinates of motion. Note that "generalized coordinates of motion" are related to—but distinct from—generalized coordinates as used in (multibody) dynamical systems analysis. Generalized filtering furnishes posterior densities over hidden states generating observed data using a generalized gradient descent on variational free energy, under the Laplace assumption. Unlike classical filtering, generalized filtering eschews Markovian assumptions about random fluctuations. Furthermore, it operates online, assimilating data to approximate the posterior density over unknown quantities, without the need for a backward pass. Special cases include variational filtering, dynamic expectation maximization and generalized predictive coding.

In image Noise reduction, local pixel grouping is the algorithm to remove noise from images using principal component analysis (PCA).

The multi-fractional order estimator (MFOE) is a straightforward, practical, and flexible alternative to the Kalman filter (KF) for tracking targets. The MFOE is focused strictly on simple and pragmatic fundamentals along with the integrity of mathematical modeling. Like the KF, the MFOE is based on the least squares method (LSM) invented by Gauss and the orthogonality principle at the center of Kalman's derivation. Optimized, the MFOE yields better accuracy than the KF and subsequent algorithms such as the extended KF and the interacting multiple model (IMM). The MFOE is an expanded form of the LSM, which effectively includes the KF and ordinary least squares (OLS) as subsets. OLS is revolutionized in for application in econometrics. The MFOE also intersects with signal processing, estimation theory, economics, finance, statistics, and the method of moments. The MFOE offers two major advances: (1) minimizing the mean squared error (MSE) with fractions of estimated coefficients and (2) describing the effect of deterministic OLS processing of statistical inputs

References

  1. 1 2 Uhlmann, Jeffrey (1995). Dynamic Map Building and Localization: New Theoretical Foundations (Ph.D. thesis). University of Oxford. S2CID   47808603.
  2. ↑ Marques, Sonia (12 November 2007). Covariance intersection algorithm for formation flying spacecraft navigation from RF measurements (PDF). 4 ISLAB workshop.
  3. ↑ Julier, Simon J.; Uhlmann, Jeffrey K. (2007). "Using covariance intersection for SLAM". Robotics and Autonomous Systems. 55 (7): 3–20. CiteSeerX   10.1.1.106.8515 . doi:10.1016/j.robot.2006.06.011.
  4. ↑ Chen, Lingji; Arambel, Pablo O.; Mehra, Raman K. (2002). Fusion under unknown correlation - Covariance intersection as a special case (PDF). International Conference on Information Fusion 2002.
  5. ↑ Reinhardt, Marc; Noack, Benjamin; Hanebeck, Uwe D. (2012). Closed-form Optimization of Covariance Intersection for Low-dimensional Matrices (PDF). International Conference on Information Fusion 2012.
  6. ↑ Uhlmann, Jeffrey (2003). "Covariance Consistency Methods for Fault-Tolerant Distributed Data Fusion" (PDF). 4. Elsevier: 201–215.{{cite journal}}: Cite journal requires |journal= (help)
  7. ↑ Wangyan Li, Zidong Wang, Guoliang Wei, Lifeng Ma, Jun Hu, and Derui Ding. "A Survey on Multi-Sensor Fusion and Consensus Filtering for Sensor Networks." Discrete Dynamics in Nature and Society, vol. 2015, Article ID 683701, 12 pages, 2015.
  8. ↑ Deng, Zili; Zhang, Peng; Qi, Wenjuan; Liu, Jinfang; Gao, Yuan (2012-04-15). "Sequential covariance intersection fusion Kalman filter". Information Sciences. 189: 293–309. doi:10.1016/j.ins.2011.11.038.
  9. ↑ Julier, S.; Uhlmann, J. (2001). Building a Million-Beacon Map. Proceedings of ISAM Conference on Intelligent Systems for Manufacturing. doi:10.1117/12.444158.
  10. ↑ Chang, K.C.; Chong, Chee-Yee; Mori, S. (2010-10-01). "Analytical and Computational Evaluation of Scalable Distributed Fusion Algorithms". IEEE Transactions on Aerospace and Electronic Systems. 46 (4): 2022–2034. Bibcode:2010ITAES..46.2022C. doi:10.1109/TAES.2010.5595611. ISSN   0018-9251. S2CID   46201683.
  11. ↑ Niehsen, W. (2002-07-01). "Information fusion based on fast covariance intersection filtering". Proceedings of the Fifth International Conference on Information Fusion. FUSION 2002. (IEEE Cat.No.02EX5997). Vol. 2. pp. 901–904 vol.2. doi:10.1109/ICIF.2002.1020907. ISBN   978-0-9721844-1-0. S2CID   122743543.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.