Approximate Sparse Regularized Hyperspectral Unmixing

الملخص EN

Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel.

In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU), is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery.

And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem.

In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer.

Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer.

Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.