28 research outputs found
Bayesian estimation of linear mixtures using the normal compositional model. Application to hyperspectral imagery
This paper studies a new Bayesian unmixing algorithm for hyperspectral images. Each pixel of the image is modeled as a linear combination of so-called endmembers. These endmembers are supposed to be random in order to model uncertainties regarding their knowledge. More precisely, we model endmembers as Gaussian vectors whose means have been determined using an endmember extraction algorithm such as the famous N-finder (N-FINDR) or Vertex Component Analysis (VCA) algorithms. This paper proposes to estimate the mixture coefficients (referred to as abundances) using a Bayesian algorithm. Suitable priors are assigned to the abundances in order to satisfy positivity and additivity constraints whereas conjugate priors are chosen for the remaining parameters. A hybrid Gibbs sampler is then constructed to generate abundance and variance samples distributed according to the joint posterior of the abundances and noise variances. The performance of the proposed methodology is evaluated by comparison with other unmixing algorithms on synthetic and real images
Estimating the number of endmembers in hyperspectral images using the normal compositional model and a hierarchical Bayesian algorithm.
This paper studies a semi-supervised Bayesian unmixing algorithm for hyperspectral images. This algorithm is based on the normal compositional model recently introduced by Eismann and Stein. The normal compositional model assumes that each pixel of the image is modeled as a linear combination of an unknown number of pure materials, called endmembers. However, contrary to the classical linear mixing model, these endmembers are supposed to be random in order to model uncertainties regarding their knowledge. This paper proposes to estimate the mixture coefficients of the Normal Compositional Model (referred to as abundances) as well as their number using a reversible jump Bayesian algorithm. The performance of the proposed methodology is evaluated thanks to simulations conducted on synthetic and real AVIRIS images
Hyperspectral Unmixing with Endmember Variability using Partial Membership Latent Dirichlet Allocation
The application of Partial Membership Latent Dirichlet Allocation(PM-LDA) for
hyperspectral endmember estimation and spectral unmixing is presented. PM-LDA
provides a model for a hyperspectral image analysis that accounts for spectral
variability and incorporates spatial information through the use of
superpixel-based 'documents.' In our application of PM-LDA, we employ the
Normal Compositional Model in which endmembers are represented as Normal
distributions to account for spectral variability and proportion vectors are
modeled as random variables governed by a Dirichlet distribution. The use of
the Dirichlet distribution enforces positivity and sum-to-one constraints on
the proportion values. Algorithm results on real hyperspectral data indicate
that PM-LDA produces endmember distributions that represent the ground truth
classes and their associated variability
Hyperspectral unmixing accounting for spatial correlations and endmember variability
International audienceThis paper presents an unsupervised Bayesian algorithm for hyperspectral image unmixing accounting for endmember variability. This variability is obtained by assuming that each pixel is a linear combination of random endmembers weighted by their corresponding abundances. An additive noise is also considered in the proposed model generalizing the normal compositional model. The proposed model is unsupervised since it estimates the abundances and both the mean and the covariance matrix of each endmember. A classification map indicating the class of each pixel is also obtained based on the estimated abundances. Simulations conducted on a real dataset show the potential of the proposed model in terms of unmixing performance for the analysis of hyperspectral images
Improvements to algorithms for hyperspectral linear unmixing based on statistical model
Spectral mixing is one of the main problems that arise when characterizing the spectral constituents residing at a sub-pixel level in a hyperspectral scene. In this work we propose a improvement of the algorithms based on statistical model, i.e. NCM, with a novel sampling approach inspired by Genetic Algorithms. Furthermore, linearization is introduced to reduce computational complexity