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 $\ell _{2,0}$ norm-based algorithms. The $\ell _{2,0}$ norm, however, is sensitive to noise in some cases. Therefore, we propose an unmixing model, which contains a total variation (TV) regularization and the $\ell _{2,0}$ norm, to address the drawback of the $\ell _{2,0}$ 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.