Pairwise Markov model applied to unsupervised image separation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The paper deals with blind separation and recovery of a noisy mixture of two binary signals on two sensors. Such a model can be applied in the context of recovery of scanned documents subject to show-through and bleed-through effects. The problem can be considered as a blind source separation one. Due to a complex noise and data structure, it is tackled from the more general approach of Bayesian restoration. The data is assumed to follow a Pairwise Markov Chain model: it generalizes Hidden Markov Chain models but it still allows one to calculate the a posteriori distributions of the data. The Expectation- Maximization (EM) and Iterative Conditional Estimation (ICE) methods are considered for parameter estimation, yielding an unsupervised processing. Finally, simulations show the interest of our approach on simulated and real data.

Original languageEnglish
Title of host publicationProceedings of the 8th IASTED International Conference on Signal Processing, Pattern Recognition, and Applications, SPPRA 2011
PublisherActa Press
Pages134-140
Number of pages7
ISBN (Print)9780889868656
DOIs
Publication statusPublished - 1 Jan 2011

Publication series

NameProceedings of the 8th IASTED International Conference on Signal Processing, Pattern Recognition, and Applications, SPPRA 2011

Keywords

  • Blind source separation
  • Image separation
  • Pairwise Markov Chain
  • Show-through removal

Fingerprint

Dive into the research topics of 'Pairwise Markov model applied to unsupervised image separation'. Together they form a unique fingerprint.

Cite this