A graph Laplacian regularization for hyperspectral data unmixing
This paper introduces a graph Laplacian regularization in the hyperspectral unmixing formulation. The proposed regularization relies upon the construction of a graph representation of the hyperspectral image. Each node in the graph represents a pixel's spectrum, and edges connect spectrally and spatially similar pixels. The proposed graph framework promotes smoothness in the estimated abundance maps and collaborative estimation between homogeneous areas of the image. The resulting convex optimization problem is solved using the Alternating Direction Method of Multipliers (ADMM). A special attention is given to the computational complexity of the algorithm, and Graph-cut methods are proposed in order to reduce the computational burden. Finally, simulations conducted on synthetic data illustrate the effectiveness of the graph Laplacian regularization with respect to other classical regularizations for hyperspectral unmixing.
Code (0)
등록된 구현이 없습니다.
Tasks
Hyperspectral UnmixingSimilar Papers 제목 키워드 기반
Superpixel Based Graph Laplacian Regularization for Sparse Hyperspectral Unmixing
An efficient spatial regularization method using superpixel segmentation and graph Laplacian regularization is proposed for sparse hyperspectral unmixing method. Since it is likely to find spectrally similar pixels in a …
Hyperspectral UnmixingSegmentationSuperpixelsA Dual Symmetric Gauss-Seidel Alternating Direction Method of Multipliers for Hyperspectral Sparse Unmixing
Since sparse unmixing has emerged as a promising approach to hyperspectral unmixing, some spatial-contextual information in the hyperspectral images has been exploited to improve the performance of the unmixing recently.…
Hyperspectral UnmixingSemi-NMF Regularization-Based Autoencoder Training for Hyperspectral Unmixing
Hyperspectral Unmixing (HSU) refers to the procedure of decomposing measured pixel spectra into a set of constituent spectral signatures known as endmembers and a corresponding set of fractional mixing ratios. In this wo…
Hyperspectral UnmixingStructured Sparse Method for Hyperspectral Unmixing
Hyperspectral Unmixing (HU) has received increasing attention in the past decades due to its ability of unveiling information latent in hyperspectral data. Unfortunately, most existing methods fail to take advantage of t…
Hyperspectral UnmixingA Low-rank Tensor Regularization Strategy for Hyperspectral Unmixing
Tensor-based methods have recently emerged as a more natural and effective formulation to address many problems in hyperspectral imaging. In hyperspectral unmixing (HU), low-rank constraints on the abundance maps have be…
Hyperspectral Unmixing