Multisensor triplet Markov chains and theory of evidence

DOI10.1016/j.ijar.2006.05.001zbMath1128.68101OpenAlexW2116742812WikidataQ56115037 ScholiaQ56115037MaRDI QIDQ997027

Wojciech Pieczynski

Publication date: 19 July 2007

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2006.05.001

zbMATH Keywords

Bayesian classificationDempster-Shafer fusionhidden Markov chainspairwise Markov chainsmultisensor data classification

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Filtering in stochastic control theory (93E11) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

Dempster-Shafer fusion of evidential pairwise Markov fields ⋮ Fast algorithm based on triplet Markov fields for unsupervised multi-class segmentation of SAR images ⋮ Hidden Markov and semi-Markov models when and why are these models useful for classifying states in time series data? ⋮ Unsupervised segmentation of randomly switching data hidden with non-Gaussian correlated noise ⋮ Keypoint descriptor fusion with Dempster-Shafer theory ⋮ Efficient Bayesian estimation of the multivariate double chain Markov model ⋮ Non-stationary data segmentation with hidden evidential semi-Markov chains ⋮ Deep parameterizations of pairwise and triplet Markov models for unsupervised classification of sequential data ⋮ A Solution for the Learning Problem in Evidential (Partially) Hidden Markov Models Based on Conditional Belief Functions and EM ⋮ Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions ⋮ Unsupervised segmentation of hidden Markov fields corrupted by correlated non-Gaussian noise ⋮ Evidential Markov Decision Processes ⋮ Shape from silhouette using Dempster-Shafer theory ⋮ Dempster-Shafer fusion in triplet partially Markov chains. ⋮ Hidden semi-Markov models ⋮ Exact filtering in conditionally Markov switching hidden linear models ⋮ Defining belief functions using mathematical morphology - application to image fusion under imprecision ⋮ Unsupervised segmentation of new semi-Markov chains hidden with long dependence noise

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unsupervised signal restoration using hidden Markov chains with copulas
• Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
• The transferable belief model
• Modèles de Markov triplet et filtrage de Kalman (Triplet Markov models and Kalman filtering)
• Theory of evidence and non-exhaustive frames of discernment: Plausibilities correction methods
• Reasoning with imprecise belief structures
• Inference in hidden Markov models.
• Signal and Image Segmentation Using Pairwise Markov Chains
• Unsupervised restoration of hidden nonstationary Markov chains using evidential priors
• A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
• Hidden Markov models for bioinformatics