This paper presents two new promising combination rules for the fusion of uncertain and potentially highly conflicting sources of evidences in the theory of belief functions established first in Dempster-Shafer Theory (DST) and then recently extended in Dezert-Smarandache Theory (DSmT). Our work is to provide here new issues to palliate the well-known limitations of Dempster's rule and to work beyond its limits of applicability. Since the famous Zadeh's criticism of Dempster's rule in 1979, many researchers have proposed new interesting alternative rules of combination to palliate the weakness of Dempster's rule in order to provide acceptable results specially in highly conflicting situations. In this work, we present two new combination rules: the class of Adaptive Combination Rules (ACR) and a new efficient Proportional Conflict Redistribution (PCR) rule. Both rules allow to deal with highly conflicting sources for static and dynamic fusion applications. We present some interesting properties for ACR and PCR rules and discuss some simulation results obtained with both rules for Zadeh's problem and for a target identification problem.
Comments: 8 pages
[v1] 6 Mar 2010
Unique-IP document downloads: 23 times
Add your own feedback and questions here:
If you wish to point out that something is wrong in the paper you must be polite and mention at least one specific error, otherwise your comment will be deleted as unhelpful.