Hyperspectral Unmixing in the Presence of Mixed Noise Using Joint-Sparsity and Total Variation

Hyperspectral unmixing is the process of estimating constituent endmembers and their fractional abundances present at each pixel in a hyperspectral image. A hyperspectral image is often corrupted by several kinds of noise. This work addresses the hyperspectral unmixing problem in a general scenario that considers the presence of mixed noise. The unmixing model explicitly takes into account both Gaussian noise and sparse noise. The unmixing problem has been formulated to exploit joint-sparsity of abundance maps. A total-variation-based regularization has also been utilized for modeling smoothness of abundance maps. The split-Bregman technique has been utilized to derive an algorithm for solving resulting optimization problem. Detailed experimental results on both synthetic and real hyperspectral images demonstrate the advantages of proposed technique.