543 research outputs found
Nonlinear unmixing of hyperspectral images: Models and algorithms
When considering the problem of unmixing hyperspectral images, most of the literature in the geoscience and image processing areas relies on the widely used linear mixing model (LMM). However, the LMM may be not valid, and other nonlinear models need to be considered, for instance, when there are multiscattering effects or intimate interactions. Consequently, over the last few years, several significant contributions have been proposed to overcome the limitations inherent in the LMM. In this article, we present an overview of recent advances in nonlinear unmixing modeling
Adaptive Markov random fields for joint unmixing and segmentation of hyperspectral image
Linear spectral unmixing is a challenging problem in hyperspectral imaging that consists of decomposing an observed pixel into a linear combination of pure spectra (or endmembers) with their corresponding proportions (or abundances). Endmember extraction algorithms can be employed for recovering the spectral signatures while abundances are estimated using an inversion step. Recent works have shown that exploiting spatial dependencies between image pixels can improve spectral unmixing. Markov random fields (MRF) are classically used to model these spatial correlations and partition the image into multiple classes with homogeneous abundances. This paper proposes to define the MRF sites using similarity regions. These regions are built using a self-complementary area filter that stems from the morphological theory. This kind of filter divides the original image into flat zones where the underlying pixels have the same spectral values. Once the MRF has been clearly established, a hierarchical Bayesian algorithm is proposed to estimate the abundances, the class labels, the noise variance, and the corresponding hyperparameters. A hybrid Gibbs sampler is constructed to generate samples according to the corresponding posterior distribution of the unknown parameters and hyperparameters. Simulations conducted on synthetic and real AVIRIS data demonstrate the good performance of the algorithm
Distributed Unmixing of Hyperspectral Data With Sparsity Constraint
Spectral unmixing (SU) is a data processing problem in hyperspectral remote
sensing. The significant challenge in the SU problem is how to identify
endmembers and their weights, accurately. For estimation of signature and
fractional abundance matrices in a blind problem, nonnegative matrix
factorization (NMF) and its developments are used widely in the SU problem. One
of the constraints which was added to NMF is sparsity constraint that was
regularized by L 1/2 norm. In this paper, a new algorithm based on distributed
optimization has been used for spectral unmixing. In the proposed algorithm, a
network including single-node clusters has been employed. Each pixel in
hyperspectral images considered as a node in this network. The distributed
unmixing with sparsity constraint has been optimized with diffusion LMS
strategy, and then the update equations for fractional abundance and signature
matrices are obtained. Simulation results based on defined performance metrics,
illustrate advantage of the proposed algorithm in spectral unmixing of
hyperspectral data compared with other methods. The results show that the AAD
and SAD of the proposed approach are improved respectively about 6 and 27
percent toward distributed unmixing in SNR=25dB.Comment: 6 pages, conference pape
Enhancing hyperspectral image unmixing with spatial correlations
This paper describes a new algorithm for hyperspectral image unmixing. Most
of the unmixing algorithms proposed in the literature do not take into account
the possible spatial correlations between the pixels. In this work, a Bayesian
model is introduced to exploit these correlations. The image to be unmixed is
assumed to be partitioned into regions (or classes) where the statistical
properties of the abundance coefficients are homogeneous. A Markov random field
is then proposed to model the spatial dependency of the pixels within any
class. Conditionally upon a given class, each pixel is modeled by using the
classical linear mixing model with additive white Gaussian noise. This strategy
is investigated the well known linear mixing model. For this model, the
posterior distributions of the unknown parameters and hyperparameters allow
ones to infer the parameters of interest. These parameters include the
abundances for each pixel, the means and variances of the abundances for each
class, as well as a classification map indicating the classes of all pixels in
the image. To overcome the complexity of the posterior distribution of
interest, we consider Markov chain Monte Carlo methods that generate samples
distributed according to the posterior of interest. The generated samples are
then used for parameter and hyperparameter estimation. The accuracy of the
proposed algorithms is illustrated on synthetic and real data.Comment: Manuscript accepted for publication in IEEE Trans. Geoscience and
Remote Sensin
Nonlinear spectral unmixing of hyperspectral images using Gaussian processes
This paper presents an unsupervised algorithm for nonlinear unmixing of
hyperspectral images. The proposed model assumes that the pixel reflectances
result from a nonlinear function of the abundance vectors associated with the
pure spectral components. We assume that the spectral signatures of the pure
components and the nonlinear function are unknown. The first step of the
proposed method consists of the Bayesian estimation of the abundance vectors
for all the image pixels and the nonlinear function relating the abundance
vectors to the observations. The endmembers are subsequently estimated using
Gaussian process regression. The performance of the unmixing strategy is
evaluated with simulations conducted on synthetic and real data
Object identification and characterization with hyperspectral imagery to identify structure and function of Natura 2000 habitats
Habitat monitoring of designated areas under the EU Habitats Directive requires every 6 years information on area, range, structure and function for the protected (Annex I) habitat types. First results from studies on heathland areas in Belgium and the Netherlands show that hyperspectral imagery can be an important source of information to assist the evaluation of the habitat conservation status. Hyperspectral imagery can provide continuous maps of habitat quality indicators (e.g., life forms or structure types, management activities, grass, shrub and tree encroachment) at the pixel level. At the same time, terrain managers, nature conservation agencies and national authorities responsible for the reporting to the EU are not directly interested in pixels, but rather in information at the level of vegetation patches, groups of patches or the protected site as a whole. Such local level information is needed for management purposes, e.g., exact location of patches of habitat types and the sizes and quality of these patches within a protected site. Site complexity determines not only the classification success of remote sensing imagery, but influences also the results of aggregation of information from the pixel to the site level. For all these reasons, it is important to identify and characterize the vegetation patches. This paper focuses on the use of segmentation techniques to identify relevant vegetation patches in combination with spectral mixture analysis of hyperspectral imagery from the Airborne Hyperspectral Scanner (AHS). Comparison with traditional vegetation maps shows that the habitat or vegetation patches can be identified by segmentation of hyperspectral imagery. This paper shows that spectral mixture analysis in combination with segmentation techniques on hyperspectral imagery can provide useful information on processes such as grass encroachment that determine the conservation status of Natura 2000 heathland areas to a large extent. A limitation is that both advanced remote sensing approaches and traditional field based vegetation surveys seem to cause over and underestimations of grass encroachment for specific categories, but the first provides a better basis for monitoring if specific species are not directly considered
Contributions to the analysis and segmentation of remote sensing hyperspectral images
142 p.This PhD Thesis deals with the segmentation of hyperspectral images from the point of view of Lattice Computing. We have introduced the application of Associative Morphological Memories as a tool to detect strong lattice independence, which has been proven equivalent to affine independence. Therefore, sets of strong lattice independent vectors found using our algorithms correspond to the vertices of convex sets that cover most of the data. Unmixing the data relative to these endmembers provides a collection of abundance images which can be assumed either as unsupervised segmentations of the images or as features extracted from the hyperspectral image pixels. Besides, we have applied this feature extraction to propose a content based image retrieval approach based on the image spectral characterization provided by the endmembers. Finally, we extended our ideas to the proposal of Morphological Cellular Automata whose dynamics are guided by the morphological/lattice independence properties of the image pixels. Our works have also explored the applicability of Evolution Strategies to the endmember induction from the hyperspectral image data
- …