463 research outputs found
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
Hyperspectral Image Segmentation Using a New Spectral Unmixing-Based Binary Partition Tree Representation
International audienceThe Binary Partition Tree (BPT) is a hierarchical region-based representation of an image in a tree structure. BPT allows users to explore the image at different segmentation scales. Often, the tree is pruned to get a more compact representation and so the remaining nodes conform an optimal partition for some given task. Here, we propose a novel BPT construction approach and pruning strategy for hyperspectral images based on spectral unmixing concepts. Linear Spectral Unmixing (LSU) consists of finding the spectral signatures of the materials present in the image (endmembers) and their fractional abundances within each pixel. The proposed methodology exploits the local unmixing of the regions to find the partition achieving a global minimum reconstruction error. Results are presented on real hyperspectral data sets with different contexts and resolutions
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
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
Hyperspectral image unmixing using a multiresolution sticky HDP
This paper is concerned with joint Bayesian endmember extraction and linear unmixing of hyperspectral images using a spatial prior on the abundance vectors.We propose a generative model for hyperspectral images in which the abundances are sampled from a Dirichlet distribution (DD) mixture model, whose parameters depend on a latent label process. The label process is then used to enforces a spatial prior which encourages adjacent pixels to have the same label. A Gibbs sampling framework is used to generate samples from the posterior distributions of the abundances and the parameters of the DD mixture model. The spatial prior that is used is a tree-structured sticky hierarchical Dirichlet process (SHDP) and, when used to determine the posterior endmember and abundance distributions, results in a new unmixing algorithm called spatially constrained unmixing (SCU). The directed Markov model facilitates the use of scale-recursive estimation algorithms, and is therefore more computationally efficient as compared to standard Markov random field (MRF) models. Furthermore, the proposed SCU algorithm estimates the number of regions in the image in an unsupervised fashion. The effectiveness of the proposed SCU algorithm is illustrated using synthetic and real data
Unsupervised classification of remote sensing images combining Self Organizing Maps and segmentation techniques
Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.This study aimed a procedure of unsupervised classification for remote sensing images based on a combination of Self-Organizing maps (SOM) and segmentation. The integration is conceived first obtaining clusters of the spectral behavior of the satellite
image using Self-Organizing Maps. As visualization technique for the SOM is used the
U-matrix. Subsequently is used seeded region growing segmentation technique to obtain
a delimitation of the clusters in the data. Finally, from the regions of neurons in the
U-matrix are deduced the clusters in the original pixels of the image.
To evaluate the proposed methodology it was considered a subset of a satellite image as
use case. The results were measured through accuracy assessment of the case and comparing definition of the obtained clusters against each technique separately. Cramers'V was used to evaluate the association between clustering obtained each method separately and reference data for the specific use case
Novel pattern recognition methods for classification and detection in remote sensing and power generation applications
Novel pattern recognition methods for classification and detection in remote sensing and power generation application
- …