Distributed fusion algorithm based on maximum internal ellipsoid mechanism
by Jinliang Cong; Benlian Xu; Mingli Lu; Jian Shi; Chi Fang; Qian Yu; Andong Sheng
International Journal of Computer Applications in Technology (IJCAT), Vol. 67, No. 2/3, 2021

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.

Online publication date: Thu, 17-Mar-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com