Priors in sparse recursive decompositions of hyperspectral images
Lists
Only you see this
Abstract
Nonnegative matrix factorization and its variants are powerful techniques for the analysis of hyperspectral images (HSI). Nonnegative matrix underapproximation (NMU) is a recent closely related model that uses additional underapproximation constraints enabling the extraction of features (e.g., abundance maps in HSI) in a recursive way while preserving nonnegativity. We propose to further improve NMU by using the spatial information: we incorporate into the model the fact that neighboring pixels are likely to contain the same materials. This approach thus incorporates structural and textural information from neighboring pixels. We use an ℓ<sub>1</sub>-norm penalty term more suitable to preserving sharp changes, and solve the corresponding optimization problem using iteratively reweighted least squares. The effectiveness of the approach is illustrated with analysis of the real-world cuprite dataset.
BibTeX
@inproceedings{gillis2012priors,
author = {Nicolas Gillis and Robert J. Plemmons and Qiang Zhang},
title = {{Priors in sparse recursive decompositions of hyperspectral images}},
booktitle = {Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE},
year = {2012},
doi = {10.1117/12.918333},
}