MCMC algorithms for supervised and unsupervised linear unmixing of hyperspectral images - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2013

MCMC algorithms for supervised and unsupervised linear unmixing of hyperspectral images

Résumé

In this paper, we describe two fully Bayesian algorithms that have been previously proposed to unmix hyperspectral images. These algorithms relies on the widely admitted linear mixing model, i.e. each pixel of the hyperspectral image is decomposed as a linear combination of pure endmember spectra. First, the unmixing problem is addressed in a supervised framework, i.e., when the endmembers are perfectly known, or previously identified by an endmember extraction algorithm. In such scenario, the unmixing problem consists of estimating the mixing coefficients under positivity and additivity constraints. Then the previous algorithm is extended to handle the unsupervised unmixing problem, i.e., to estimate the endmembers and the mixing coefficients jointly. This blind source separation problem is solved in a lower-dimensional space, which effectively reduces the number of degrees of freedom of the unknown parameters. For both scenarios, appropriate distributions are assigned to the unknown parameters, that are estimated from their posterior distribution. Markov chain Monte Carlo (MCMC) algorithms are then developed to approximate the Bayesian estimators.

Dates et versions

hal-03609211 , version 1 (15-03-2022)

Identifiants

Citer

Nicolas Dobigeon, Saïd Moussaoui, Martial Coulon, Jean-Yves Tourneret, Alfred O. Hero. MCMC algorithms for supervised and unsupervised linear unmixing of hyperspectral images. Mary, David; Theys, Céline; Aime, Claude. New Concepts in Imaging: Optical and Statistical Models, 59, EDP Sciences, pp.381-401, 2013, EAS Publications Series, 978-2-7598-0958-5. ⟨10.1051/eas/1359017⟩. ⟨hal-03609211⟩
22 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More