Nonlinear Decentralized Data Fusion with Generalized Inverse Covariance Intersection

Date

2019-01-01

Author

Noack, Benjamin
Orguner, Umut
Hanebeck, Uwe D.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

24
views

0
downloads

Decentralized data fusion is a challenging task even for linear estimation problems. Nonlinear estimation renders data fusion even more difficult as dependencies among the nonlinear estimates require complicated parameterizations. It is nearly impossible to reconstruct or keep track of dependencies. Therefore, conservative approaches have become a popular solution to nonlinear data fusion. As a generalization of Covariance Intersection, exponential mixture densities have been widely applied for nonlinear fusion. However, this approach inherits the conservativeness of Covariance Intersection. For this reason, the less conservative fusion rule Inverse Covariance Intersection is studied in this paper and also generalized to nonlinear data fusion. This generalization employs a conservative approximation of the common information shared by the estimates to be fused. This bound of the common information is subtracted from the fusion result. In doing so, less conservative fusion results can be attained as an empirical analysis demonstrates.

Subject Keywords

Inverse covariance intersection, Nonlinear estimation, Decentralized data fusion

URI

https://hdl.handle.net/11511/52723

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Approximate Analytical Solutions for the Weight Optimization Problems of CI and ICI Orguner, Umut (2017-10-12) Approximate analytical formulae are proposed for the solutions of the weight optimization problems involved in Covariance Intersection (CI) and Inverse Covariance Intersection (ICI). The methodology used for obtaining the analytic approximations boils down to using just two Newton iterations with the initial weight value 1/2. The simulation results show that quite acceptable root-mean-square (RMS) error levels are achievable with the proposed approximate analytical weights with less computations compared to...
Application of nonlinear unit root tests and threshold autoregressive models Uysal, Ela; Yıldırım Kasap, Dilem; Department of Economics (2012) Popularity of nonlinear threshold models and unit root tests has increased after the recent empirical studies concerning the effects of business cycles on macroeconomic data. These studies have shown that an economic variable may react differently in response to downturns and recoveries in a business cycle. Inspiring from empirical results, this thesis investigates dynamics of Turkish key macroeconomic data, namely capacity utilization rate, growth of import and export volume indices, growth of gross domest...
Basis reduction and the complexity of branch-and-bound Pataki, Gábor; Tural, Mustafa Kemal; Wong, Erick B. (2010-05-06) The classical branch-and-bound algorithm for the integer feasibility problem [GRAPHICS] has exponential worst case complexity. We prove that, it. is surprisingly efficient on reformulations of (01), in which the columns of the constraint, matrix are short and near orthogonal, i e, a reduced basis of the generated lattice. when the entries of A ale from {1, ,M} for a large enough M, branch-and-bound solves almost all reformulated instances at the root. node For all A matrices we prove an upper bound on th...
Consensus clustering of time series data Yetere Kurşun, Ayça; Batmaz, İnci; İyigün, Cem; Department of Scientific Computing (2014) In this study, we aim to develop a methodology that merges Dynamic Time Warping (DTW) and consensus clustering in a single algorithm. Mostly used time series distance measures require data to be of the same length and measure the distance between time series data mostly depends on the similarity of each coinciding data pair in time. DTW is a relatively new measure used to compare two time dependent sequences which may be out of phase or may not have the same lengths or frequencies. DTW aligns two time serie...
Residual based Adaptive Unscented Kalman filter for satellite attitude estimation Söken, Halil Ersin (2012-12-01) Determining the process noise covariance matrix in Kalman filtering applications is a difficult task especially for estimation problems of the high-dimensional states where states like biases or system parameters are included. This study introduces a simplistic residual based adaptation method for the Unscented Kalman Filter (UKF), which is used for small satellite attitude estimation. For a satellite with gyros and magnetometers onboard, the proposed adaptive UKF algorithm estimates the attitude as well as...

Citation Formats

B. Noack, U. Orguner, and U. D. Hanebeck, “Nonlinear Decentralized Data Fusion with Generalized Inverse Covariance Intersection,” 2019, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/52723.