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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
MultiHU-TD: Multifeature Hyperspectral Unmixing Based on Tensor Decomposition
UnMix-NeRF: Spectral Unmixing Meets Neural Radiance Fields
Dual Simplex Volume Maximization for Simplex-Structured Matrix Factorization
Learning Interpretable Deep Disentangled Neural Networks for Hyperspectral Unmixing
Image Processing and Machine Learning for Hyperspectral Unmixing: An Overview and the HySUPP Python Package
Dynamical Hyperspectral Unmixing with Variational Recurrent Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.