Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches

Imaging spectrometers measure electromagnetic energy scattered in their instantaneous field view in hundreds or thousands of spectral channels with higher spectral resolution than multispectral cameras. Imaging spectrometers are therefore often referred to as hyperspectral cameras (HSCs). Higher spectral resolution enables material identification via spectroscopic analysis, which facilitates countless applications that require identifying materials in scenarios unsuitable for classical spectroscopic analysis. Due to low spatial resolution of HSCs, microscopic material mixing, and multiple scattering, spectra measured by HSCs are mixtures of spectra of materials in a scene. Thus, accurate estimation requires unmixing. Pixels are assumed to be mixtures of a few materials, called endmembers. Unmixing involves estimating all or some of: the number of endmembers, their spectral signatures, and their abundances at each pixel. Unmixing is a challenging, ill-posed inverse problem because of model inaccuracies, observation noise, environmental conditions, endmember variability, and data set size. Researchers have devised and investigated many models searching for robust, stable, tractable, and accurate unmixing algorithms. This paper presents an overview of unmixing methods from the time of Keshava and Mustard's unmixing tutorial [1] to the present. Mixing models are first discussed. Signal-subspace, geometrical, statistical, sparsity-based, and spatial-contextual unmixing algorithms are described. Mathematical problems and potential solutions are described. Algorithm characteristics are illustrated experimentally.Comment: This work has been accepted for publication in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensin

Bayesian Nonparametric Unmixing of Hyperspectral Images

Hyperspectral imaging is an important tool in remote sensing, allowing for accurate analysis of vast areas. Due to a low spatial resolution, a pixel of a hyperspectral image rarely represents a single material, but rather a mixture of different spectra. HSU aims at estimating the pure spectra present in the scene of interest, referred to as endmembers, and their fractions in each pixel, referred to as abundances. Today, many HSU algorithms have been proposed, based either on a geometrical or statistical model. While most methods assume that the number of endmembers present in the scene is known, there is only little work about estimating this number from the observed data. In this work, we propose a Bayesian nonparametric framework that jointly estimates the number of endmembers, the endmembers itself, and their abundances, by making use of the Indian Buffet Process as a prior for the endmembers. Simulation results and experiments on real data demonstrate the effectiveness of the proposed algorithm, yielding results comparable with state-of-the-art methods while being able to reliably infer the number of endmembers. In scenarios with strong noise, where other algorithms provide only poor results, the proposed approach tends to overestimate the number of endmembers slightly. The additional endmembers, however, often simply represent noisy replicas of present endmembers and could easily be merged in a post-processing step

Unsupervised clustering of hyperspectral images of brain tissues by hierarchical non-negative matrix factorization

International audienceHyperspectral images of high spatial and spectral resolutions are employed to perform the challenging task of brain tissue characterization and subsequent segmentation for visualization of in-vivo images. Each pixel is a high-dimensional spectrum. Working on the hypothesis of pure-pixels on account of high spectral resolution, we perform unsupervised clustering by hierarchical non-negative matrix factorization to identify the pure-pixel spectral signatures of blood, brain tissues, tumor and other materials. This subspace clustering was further used to train a random forest for subsequent classification of test set images constituent of in-vivo and ex-vivo images. Unsupervised hierarchical clustering helps visualize tissue structure in in-vivo test images and provides a inter-operative tool for surgeons. Furthermore the study also provides a preliminary study of the classification and sources of errors in the classification process

Adaptive Compressive Sampling for Mid-infrared Spectroscopic Imaging

Fourier transform infrared (FTIR) spectroscopy enables label-free molecular identification and quantification of biological specimens. The resolution of diffraction limited FTIR imaging is poor due to the long optical wavelengths (2.5{\mu}m to 12.5{\mu}m)used and this is particularly limiting in biomedical imaging. Photothermal imaging overcomes this diffraction limit by using a multimodal pump/probe approach. However, these measurements require approximately 1 s per spectrum, making them impractical for large samples. This paper introduces an adaptive compressive sampling technique to dramatically reduce hyperspectral data acquisition time by utilizing both spectral and spatial sparsity. This method identifies the most informative spatial and spectral features and integrates a fast tensor completion algorithm to reconstruct megapixel-scale images and demonstrates speed advantages over FTIR imagin

Spectral-Spatial Method for Hyperspectral Image classification in Noisy Environment

International audienc

Intersecting Faces: Non-negative Matrix Factorization With New Guarantees

Non-negative matrix factorization (NMF) is a natural model of admixture and is widely used in science and engineering. A plethora of algorithms have been developed to tackle NMF, but due to the non-convex nature of the problem, there is little guarantee on how well these methods work. Recently a surge of research have focused on a very restricted class of NMFs, called separable NMF, where provably correct algorithms have been developed. In this paper, we propose the notion of subset-separable NMF, which substantially generalizes the property of separability. We show that subset-separability is a natural necessary condition for the factorization to be unique or to have minimum volume. We developed the Face-Intersect algorithm which provably and efficiently solves subset-separable NMF under natural conditions, and we prove that our algorithm is robust to small noise. We explored the performance of Face-Intersect on simulations and discuss settings where it empirically outperformed the state-of-art methods. Our work is a step towards finding provably correct algorithms that solve large classes of NMF problems

Spectral unmixing approach in hyperspectral remote sensing: a tool for oil palm mapping

Las plantaciones de palma de aceite típicamente abarcan grandes áreas, por esto, la teledetección remota se ha convertido en una herramienta útil para el monitoreo avanzado de este cultivo. Este trabajo revisa y evalúa dos enfoques para analizar las plantaciones de palma de aceite a partir de datos de teledetección remota hiperespectral: desmezclado espectral lineal y variabilidad espectral. Además, se propone un marco computacional basado en el desmezclado espectral para la estimación de las fracciones de abundancias de cultivos de palma de aceite. Este enfoque también considera la variabilidad espectral de las firmas en las imágenes hiperespectrales. El marco computacional propuesto modifica el modelo de mezcla lineal mediante la introducción de un vector de pesos, de manera que se puedan identificar las bandas espectrales que menos contribuyen a la estimación de fracciones de abundancias erróneas. Este enfoque aprovecha la detección de los árboles de palma de aceite, ya que permite diferenciarlos de otros materiales en términos de fracciones de abundancia. Los resultados experimentales obtenidos a partir de datos de teledetección remota hiperespectral en el rango de 410-990 nm, muestran mejoras de un 8.18 % en la métrica de Precisión del Usuario (Uacc) en la identificación de palmas de aceite por el marco propuesto con respecto a los métodos tradicionales de desmezclado espectral; el método propuesto logró un 95 % de Uacc. Esto confirma las capacidades del marco computacional formulado y facilita la gestión y el monitoreo de grandes áreas de plantaciones de palma de aceite.Oil palm plantations typically span large areas; therefore, remote sensing has become a useful tool for advanced oil palm monitoring. This work reviews and evaluates two approaches to analyze oil palm plantations based on hyperspectral remote sensing data: linear spectral unmixing and spectral variability. Moreover, a computational framework based on spectral unmixing for the estimation of fractional abundances of oil palm plantations is proposed in this study. Such approach also considers the spectral variability of hyperspectral image signatures. More specifically, the proposed computational framework modifies the linear mixing model by introducing a weighting vector, so that the spectral bands that contribute the least to the estimation of erroneous fractional abundances can be identified. This approach improves palm detection as it allows to differentiate them from other materials in terms of fractional abundances. Experimental results obtained from hyperspectral remote sensing data in the range 410-990 nm show improvements of 8.18 % in User Accuracy (Uacc) in the identification of oil palms by the proposed framework with respect to traditional unmixing methods. Thus, the proposed method achieved a 95% Uacc. This confirms the capabilities of the proposed computational framework and facilitates the management and monitoring of large areas of oil palm plantations