About: Covariance intersection is a research topic. Over the lifetime, 2625 publications have been published within this topic receiving 80060 citations.
TL;DR: In this article, a new sequential data assimilation method is proposed based on Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter.
Abstract: A new sequential data assimilation method is discussed. It is based on forecasting the error statistics using Monte Carlo methods, a better alternative than solving the traditional and computationally extremely demanding approximate error covariance equation used in the extended Kalman filter. The unbounded error growth found in the extended Kalman filter, which is caused by an overly simplified closure in the error covariance equation, is completely eliminated. Open boundaries can be handled as long as the ocean model is well posed. Well-known numerical instabilities associated with the error covariance equation are avoided because storage and evolution of the error covariance matrix itself are not needed. The results are also better than what is provided by the extended Kalman filter since there is no closure problem and the quality of the forecast error statistics therefore improves. The method should be feasible also for more sophisticated primitive equation models. The computational load for reasonable accuracy is only a fraction of what is required for the extended Kalman filter and is given by the storage of, say, 100 model states for an ensemble size of 100 and thus CPU requirements of the order of the cost of 100 model integrations. The proposed method can therefore be used with realistic nonlinear ocean models on large domains on existing computers, and it is also well suited for parallel computers and clusters of workstations where each processor integrates a few members of the ensemble.
TL;DR: This work addresses the problem of performing Kalman filtering with intermittent observations by showing the existence of a critical value for the arrival rate of the observations, beyond which a transition to an unbounded state error covariance occurs.
Abstract: Motivated by navigation and tracking applications within sensor networks, we consider the problem of performing Kalman filtering with intermittent observations. When data travel along unreliable communication channels in a large, wireless, multihop sensor network, the effect of communication delays and loss of information in the control loop cannot be neglected. We address this problem starting from the discrete Kalman filtering formulation, and modeling the arrival of the observation as a random process. We study the statistical convergence properties of the estimation error covariance, showing the existence of a critical value for the arrival rate of the observations, beyond which a transition to an unbounded state error covariance occurs. We also give upper and lower bounds on this expected state error covariance.
TL;DR: A new recursive linear estimator for filtering systems with nonlinear process and observation models which can be transformed directly by the system equations to give predictions of the transformed mean and covariance is described.
Abstract: In this paper we describe a new recursive linear estimator for filtering systems with nonlinear process and observation models. This method uses a new parameterisation of the mean and covariance which can be transformed directly by the system equations to give predictions of the transformed mean and covariance. We show that this technique is more accurate and far easier to implement than an extended Kalman filter. Specifically, we present empirical results for the application of the new filter to the highly nonlinear kinematics of maneuvering vehicles.
TL;DR: In this paper, the covariance matrix of stock returns is estimated by an optimally weighted average of two existing estimators: the sample covariance and single-index covariance matrices.
TL;DR: This work proposes a novel shrinkage covariance estimator that exploits the Ledoit-Wolf (2003) lemma for analytic calculation of the optimal shrinkage intensity and applies it to the problem of inferring large-scale gene association networks.
Abstract: Inferring large-scale covariance matrices from sparse genomic data is an ubiquitous problem in bioinformatics. Clearly, the widely used standard covariance and correlation estimators are ill-suited for this purpose. As statistically efficient and computationally fast alternative we propose a novel shrinkage covariance estimator that exploits the Ledoit-Wolf (2003) lemma for analytic calculation of the optimal shrinkage intensity. Subsequently, we apply this improved covariance estimator (which has guaranteed minimum mean squared error, is well-conditioned, and is always positive definite even for small sample sizes) to the problem of inferring large-scale gene association networks. We show that it performs very favorably compared to competing approaches both in simulations as well as in application to real expression data.