Hyperspectral Image Unmixing With Endmember Bundles and Group Sparsity Inducing Mixed Norms

Hyperspectral images provide much more information than conventional imaging techniques, allowing a precise identification of the materials in the observed scene, but because of the limited spatial resolution, the observations are usually mixtures of the contributions of several materials. The spect...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on image processing 2019-07, Vol.28 (7), p.3435-3450
Main Authors: Drumetz, Lucas, Meyer, Travis R., Chanussot, Jocelyn, Bertozzi, Andrea L., Jutten, Christian
Format: Article
Language:English
Subjects:
Bundles
Bundling
Computational modeling
convex optimization
Data mining
Dictionaries
endmember variability
Engineering Sciences
Estimation
Fines & penalties
group sparsity
Hyperspectral imaging
Imaging
Imaging techniques
Norms
Optimization
remote sensing
Signal and Image processing
Sparsity
Spatial resolution
Spectra
spectral unmixing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hyperspectral images provide much more information than conventional imaging techniques, allowing a precise identification of the materials in the observed scene, but because of the limited spatial resolution, the observations are usually mixtures of the contributions of several materials. The spectral unmixing problem aims at recovering the spectra of the pure materials of the scene (endmembers), along with their proportions (abundances) in each pixel. In order to deal with the intra-class variability of the materials and the induced spectral variability of the endmembers, several spectra per material, constituting endmember bundles, can be considered. However, the usual abundance estimation techniques do not take advantage of the particular structure of these bundles, organized into groups of spectra. In this paper, we propose to use group sparsity by introducing mixed norms in the abundance estimation optimization problem. In particular, we propose a new penalty, which simultaneously enforces group and within-group sparsity, to the cost of being nonconvex. All the proposed penalties are compatible with the abundance sum-to-one constraint, which is not the case with traditional sparse regression. We show on simulated and real datasets that well-chosen penalties can significantly improve the unmixing performance compared to classical sparse regression techniques or to the naive bundle approach.
ISSN:1057-7149
1941-0042
DOI:10.1109/TIP.2019.2897254