Answers are grounded in this paper and cite their sources.
Spatial context has been demonstrated to be effective to constrain sparse unmixing (SU) of hyperspectral images. However, the existing algorithms employed simple spatial information without keeping spectral fidelity. By considering the fact that adjacent pixels own not only the endmembers with same variations but also approximated fractional abundances, in this paper, local spectral similarity preserving (LSSP) constraint is proposed to preserve spectral similarity in a local area during robust sparse unmixing (RSU). Specially, four LSSP constraints are constructed using different-norm-constrained pixel-level difference over abundance-level difference in a local area. Moreover, a convex optimization algorithm is proposed to solve the proposed LSSP-constrained RSU (LSSP-RSU). Experimental results on both synthetic and real hyperspectral data demonstrate that the developed algorithms yield better values of the signal-toreconstruction error (SRE). Especially, when using l 2 norm of pixel-level difference to weight the l 1 norm of abundance-level difference, the proposed LSSP-RSU algorithm can achieve superior unmixing performance.
No takes yet. Share an insight, caveat, or question.
Li et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: