1 April 2004 Fast joint separation and segmentation of mixed images
Author Affiliations +
Abstract
We consider the problem of the blind separation of noisy instantaneously mixed images. The images are modeled by hidden Markov fields with unknown parameters. Given the observed images, we give a Bayesian formulation and we propose a fast version of the MCMC (Monte Carlo Markov Chain) algorithm based on the Bartlett decomposition for the resulting data augmentation problem. We separate the unknown variables into two categories: 1. The parameters of interest which are the mixing matrix, the noise covariance and the parameters of the sources distributions. 2. The hidden variables which are the unobserved sources and the unobserved pixel segmentation labels. The proposed algorithm provides, in the stationary regime, samples drawn from the posterior distributions of all the variables involved in the problem leading to great flexibility in the cost function choice. Finally, we show the results for both synthetic and real data to illustrate the feasibility of the proposed solution.
©(2004) Society of Photo-Optical Instrumentation Engineers (SPIE)
Hichem Snoussi and Ali Mohammad-Djafari "Fast joint separation and segmentation of mixed images," Journal of Electronic Imaging 13(2), (1 April 2004). https://doi.org/10.1117/1.1666873
Published: 1 April 2004
Lens.org Logo
CITATIONS
Cited by 51 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Signal to noise ratio

Matrices

Monte Carlo methods

Computer simulations

Sensors

Data modeling

Back to Top