Abstract
Dictionary-aided unmixing has been introduced as a semi-supervised unmixing method, under the assumption that the observed mixed pixel of a hyperspectral image can be expressed in the form of different linear combinations of a few spectral signatures from an available spectral library. Sparse-regression-based unmixing methods have been recently proposed to solve this problem. Mostly, lp-norm minimization is a closer surrogate to the l0-norm minimization and can be solved more efficiently than l1-norm minimization. In this paper, we model the hyperspectral unmixing as a constrained l2,q–l2,p optimization problem. To effectively solve the induced optimization problems for any q (1≤q≤2) and p (0<p≤1), an iteratively reweighted least squares algorithm is developed and the convergence of the proposed method is also demonstrated. Experimental evaluation carried out on synthetic and real hyperspectral data shows that the proposed method yields better spectral unmixing accuracy in both quantitative and qualitative evaluations than state-of-the-art unmixing algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.