Article: Distributed fusion algorithm based on maximum internal ellipsoid mechanism Journal: International Journal of Computer Applications in Technology (IJCAT) 2021 Vol.67 No.2/3 pp.141 - 148 Abstract: In this paper, a Bar-Shalom Campo-based algorithm is presented to solve the approximate maximum ellipsoid in the cross region of covariance ellipsoid. An objective function that can be solved by linear matrix inequality is designed based on the rotation transformation of matrix. Compared with the classical covariance intersection fusion algorithm, it is less conservative. Moreover, the unknown cross-covariance is approximated as a linear matrix inequality constraint with Pearson correlation coefficient which is bounded. With the inequality constraint, the accuracy of fusion results can be improved. Finally, two simulation examples are given to verify the effectiveness of the proposed algorithm. Inderscience Publishers - linking academia, business and industry through research

Title: Distributed fusion algorithm based on maximum internal ellipsoid mechanism

Authors: Jinliang Cong; Benlian Xu; Mingli Lu; Jian Shi; Chi Fang; Qian Yu; Andong Sheng

Addresses: School of Electrical Engineering and Automation, Changshu Institute of Technology, Changshu, Jiangsu, China ' School of Electrical Engineering and Automation, Changshu Institute of Technology, Changshu, Jiangsu, China ' School of Electrical Engineering and Automation, Changshu Institute of Technology, Changshu, Jiangsu, China ' School of Electrical Engineering and Automation, Changshu Institute of Technology, Changshu, Jiangsu, China ' School of Electrical Engineering and Automation, Changshu Institute of Technology, Changshu, Jiangsu, China ' School of Automation, Nanjing University of Science and Technology, Nanjing, Xuanwu, China ' School of Automation, Nanjing University of Science and Technology, Nanjing, Xuanwu, China

Abstract: In this paper, a Bar-Shalom Campo-based algorithm is presented to solve the approximate maximum ellipsoid in the cross region of covariance ellipsoid. An objective function that can be solved by linear matrix inequality is designed based on the rotation transformation of matrix. Compared with the classical covariance intersection fusion algorithm, it is less conservative. Moreover, the unknown cross-covariance is approximated as a linear matrix inequality constraint with Pearson correlation coefficient which is bounded. With the inequality constraint, the accuracy of fusion results can be improved. Finally, two simulation examples are given to verify the effectiveness of the proposed algorithm.

Keywords: distributed sensor network; information fusion; maximum ellipsoid; cross-covariance constraint.

DOI: 10.1504/IJCAT.2021.121529

International Journal of Computer Applications in Technology, 2021 Vol.67 No.2/3, pp.141 - 148

Received: 25 Sep 2020
Accepted: 14 Jan 2021
Published online: 17 Mar 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article

Title: Distributed fusion algorithm based on maximum internal ellipsoid mechanism

Keep up-to-date