Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Pitfalls for recursive iteration in set based fusion

Powell, G., Roberts, Matthew S. and Marshall, Andrew David ORCID: 2010. Pitfalls for recursive iteration in set based fusion. Presented at: Workshop on the Theory of Belief Functions, Brest, France, 1-2 April 2010.

Full text not available from this repository.


Set based methods, such as Dempster Shafer Theory and the Transferable Belief model, are widely used in fusion applications. Many fusion applications are of an iterative or recursive nature, often fusing data with respect to an event over time. This iterative or recursive approach does not translate well into the traditional set based fusion methods as the system can converge and become unresponsive. Documentation, analysis nor acknowledgement of these issues is readily available. In this paper, we highlight the problems that can occur, discussing the reasons for these problems and look at a previously suggested solution. We use some suitable simple examples to aid in the description.

Item Type: Conference or Workshop Item (Paper)
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords: DST (Dempster Shafer Theory), TBM (Transferable Belief Model), DSmT (Dezert-Smarandache Theory), conflict, temporal, iterative, recursive
Last Modified: 19 Oct 2022 09:51

Citation Data

Actions (repository staff only)

Edit Item Edit Item