Analyzing approximation algorithms in the theory of evidence

Anne-Laure Jousselme; Dominic Grenier; Eloi Bosse

doi:10.1117/12.458371

6 March 2002 Analyzing approximation algorithms in the theory of evidence

Anne-Laure Jousselme, Dominic Grenier, Eloi Bosse

Proceedings Volume 4731, Sensor Fusion: Architectures, Algorithms, and Applications VI; (2002) https://doi.org/10.1117/12.458371
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

The major drawback of the Dempster-Shafer's theory of evidence is its computational burden. Indeed, the Dempster's rule of combination involves an exponential number of focal elements, that can be unmanageable in many applications. To avoid this problem, some approximation rules or algorithms have been explored for both reducing the number of focal elements and keeping a maximum of information in the next belief function to be combined. Some studies have yet to be done which compare approximation algorithms. The criteria used always involve pignistic transformations, and by that a loss of information in both the original belief function and the approximated one. In this paper, we propose to analyze some approximation methods by computing the distance between the original belief function and the approximated one. This real distance allows then to quantify the quality of the approximation. We also compare this criterion to other error criteria, often based on pignistic transformations. We show results of Monte-Carlo simulations, and also of an application of target identification.

Citation Download Citation

Anne-Laure Jousselme, Dominic Grenier, and Eloi Bosse "Analyzing approximation algorithms in the theory of evidence", Proc. SPIE 4731, Sensor Fusion: Architectures, Algorithms, and Applications VI, (6 March 2002); https://doi.org/10.1117/12.458371

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