Row-Sparsity Spectral Unmixing via Total Variation
Lists
Only you see this
Abstract
Row sparsity of hyperspectral unmixing has attracted considerable attention in recent years. It exploits the fact that a hyperspectral image contains only a few number of endmembers. This property has been well investigated by the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,0</sub> norm-based algorithms. The ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,0</sub> norm, however, is sensitive to noise in some cases. Therefore, we propose an unmixing model, which contains a total variation (TV) regularization and the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,0</sub> norm, to address the drawback of the ℓ <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,0</sub> norm in the noise scenario, and promote piecewise smoothness in abundance maps. To solve the proposed model, we design an algorithm, termed as row-sparsity spectral unmixing via total variation (RSSUn-TV), under the nonconvex alternating direction method of multipliers (ADMM) framework. Particularly, we establish the convergence analysis of the RSSUn-TV algorithm. Experimental results on both synthetic and real hyperspectral data demonstrate that our proposed algorithm is effective for hyperspectral unmixing.
BibTeX
@article{wang2019row,
author = {Jin-Ju Wang and Ting-Zhu Huang and Jie Huang and Hong-Xia Dou and Liang-Jian Deng and Xi-Le Zhao},
title = {{Row-Sparsity Spectral Unmixing via Total Variation}},
journal = {IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens.},
year = {2019},
doi = {10.1109/jstars.2019.2950700},
}Loading related content...