Skip to Main content Skip to Navigation
Journal articles

Unsupervised segmentation of random discrete data hidden with switching noise distributions

Abstract : Hidden Markov models are very robust and have been widely used in a wide range of application fields; however, they can prove some limitations for data restoration under some complex situations. These latter include cases when the data to be recovered are nonstationary. The recent triplet Markov models have overcome such difficulty thanks to their rich formalism, that allows considering more complex data structures while keeping the computational complexity of the different algorithms linear to the data size. In this letter, we propose a new triplet Markov chain that allows the unsupervised restoration of random discrete data hidden with switching noise distributions. We also provide genuine parameters estimation and MPM restoration algorithms. The new model is validated through experiments conducted on synthetic data and on real images, whose results show its interest with respect to the standard hidden Markov chain.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00738142
Contributor : Médiathèque Télécom Sudparis & Institut Mines-Télécom Business School <>
Submitted on : Wednesday, October 3, 2012 - 3:14:59 PM
Last modification on : Friday, September 25, 2020 - 11:30:44 AM

Links full text

Identifiers

Citation

Mohamed El Yazid Boudaren, Emmanuel Monfrini, Wojciech Pieczynski. Unsupervised segmentation of random discrete data hidden with switching noise distributions. IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2012, 19 (10), pp.619-622. ⟨10.1109/LSP.2012.2209639⟩. ⟨hal-00738142⟩

Share

Metrics

Record views

123