Title
Dempster–Shafer Fusion of Evidential Pairwise Markov Chains
Abstract
Hidden Markov models have been extended in many directions, leading to pairwise Markov models, triplet Markov models, or discriminative random fields, all of which have been successfully applied in many fields covering signal and image processing. The Dempster–Shafer theory of evidence has also shown its interest in a wide range of situations involving reasoning under uncertainty and/or information fusion. There are, however, only few works dealing with both of these modeling tools simultaneously. The aim of this paper, which falls under this category of works, is to propose a general evidential Markov model offering wide modeling and processing possibilities regarding information imprecision, sensor unreliability, and data fusion. The main interest of the proposed model relies in the possibility of achieving, easily, the Dempster–Shafer fusion without destroying the Markovianity.
Year
DOI
Venue
2016
10.1109/TFUZZ.2016.2543750
IEEE Transactions on Fuzzy Systems
Keywords
Field
DocType
Markov processes,Hidden Markov models,Data models,Computational modeling,Biological system modeling,Probabilistic logic,Parameter estimation
Markov process,Maximum-entropy Markov model,Markov property,Markov model,Markov chain,Artificial intelligence,Variable-order Markov model,Hidden Markov model,Dempster–Shafer theory,Machine learning,Mathematics
Journal
Volume
Issue
ISSN
24
6
1063-6706
Citations 
PageRank 
References 
1
0.35
19
Authors
2
Name
Order
Citations
PageRank
Mohamed El Yazid Boudaren1315.93
Wojciech Pieczynski2378.74