Performance analysis of structured pedigree distributed fusion systems

Pablo O. Arambel

doi:10.1117/12.818254

11 May 2009 Performance analysis of structured pedigree distributed fusion systems

Pablo O. Arambel

Proceedings Volume 7336, Signal Processing, Sensor Fusion, and Target Recognition XVIII; 73360O (2009) https://doi.org/10.1117/12.818254
Event: SPIE Defense, Security, and Sensing, 2009, Orlando, Florida, United States

Abstract

Structured pedigree is a way to compress pedigree information. When applied to distributed fusion systems, the approach avoids the well known problem of information double counting resulting from ignoring the cross-correlation among fused estimates. Other schemes that attempt to compute optimal fused estimates require the transmission of full pedigree information or raw data. This usually can not be implemented in practical systems because of the enormous requirements in communications bandwidth. The Structured Pedigree approach achieves data compression by maintaining multiple covariance matrices, one for each uncorrelated source in the network. These covariance matrices are transmitted by each node along with the state estimate. This represents a significant compression when compared to full pedigree schemes. The transmission of these covariance matrices (or a subset of these covariance matrices) allows for an efficient fusion of the estimates, while avoiding information double counting and guaranteeing consistency on the estimates. This is achieved by exploiting the additional partial knowledge on the correlation of the estimates. The approach uses a generalized version of the Split Covariance Intersection algorithm that applies to multiple estimates and multiple uncorrelated sources. In this paper we study the performance of the proposed distributed fusion system by analyzing a simple but instructive example.

Citation Download Citation

Pablo O. Arambel "Performance analysis of structured pedigree distributed fusion systems", Proc. SPIE 7336, Signal Processing, Sensor Fusion, and Target Recognition XVIII, 73360O (11 May 2009); https://doi.org/10.1117/12.818254

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Sensors

Matrices

Error analysis

Distributed computing

Telecommunications

Data compression

Data fusion

Show All Keywords

Keywords/Phrases

Search In:

Publication Years