Authors:
Mohamed El Yazid Boudaren
1
;
Emmanuel Monfrini
2
;
Kadda Beghdad Bey
1
;
Ahmed Habbouchi
1
and
Wojciech Pieczynski
2
Affiliations:
1
Ecole Militaire Polytechnique, Algeria
;
2
SAMOVAR, Télécom SudParis, CNRS and Université Paris-Saclay, France
Keyword(s):
Data Segmentation, Hidden Markov Chains, Nonstationary Data, Signal Processing, Triplet Markov Chains.
Related
Ontology
Subjects/Areas/Topics:
Advanced Applications of Fuzzy Logic
;
Agents
;
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Bioinformatics
;
Biomedical Engineering
;
Data Mining
;
Databases and Information Systems Integration
;
Enterprise Information Systems
;
Information Systems Analysis and Specification
;
Methodologies and Technologies
;
Operational Research
;
Sensor Networks
;
Signal Processing
;
Simulation
;
Soft Computing
Abstract:
An important issue in statistical image and signal segmentation consists in estimating the hidden variables of interest. For this purpose, various Bayesian estimation algorithms have been developed, particularly in the framework of hidden Markov chains, thanks to their efficient theory that allows one to recover the hidden variables from the observed ones even for large data. However, such models fail to handle nonstationary data in the unsupervised context. In this paper, we show how the recent triplet Markov chains, which are strictly more general models with comparable computational complexity, can be used to overcome this limit through two different ways: (i) in a Bayesian context by considering the switches of the hidden variables regime depending on an additional Markov process; and, (ii) by introducing Dempster-Shafer theory to model the lack of precision of the hidden process prior distributions, which is the origin of data nonstationarity. Furthermore, this study analyzes bo
th approaches in order to determine which one is better-suited for nonstationary data. Experimental results are shown for sampled data and noised images.
(More)