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 homogeneous region, we use a superpixel segmentation algorithm to extract the homogeneous regions by considering the image boundaries. We first extract the homogeneous regions, which are called superpixels, then a weighted graph in each superpixel is constructed by selecting $K$-nearest pixels in each superpixel. Each node in the graph represents the spectrum of a pixel and edges connect the similar pixels inside the superpixel. The spatial similarity is investigated using graph Laplacian regularization. Sparsity regularization for abundance matrix is provided using a weighted sparsity promoting norm. Experimental results on simulated and real data sets show the superiority of the proposed algorithm over the well-known algorithms in the literature.
Code (0)
등록된 구현이 없습니다.
Tasks
Hyperspectral UnmixingSegmentationSuperpixelsSimilar Papers 제목 키워드 기반
Local Low-Rank Approximation With Superpixel-Guided Locality Preserving Graph for Hyperspectral Image Classification
Given the detrimental effect of spectral variations in a hyperspectral image (HSI), this article investigates to recover its discriminative representation to improve the classification performance. We propose a new metho…
Hyperspectral Image Classificationimage-classificationImage ClassificationSuperpixelsA 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 i…
Hyperspectral UnmixingHierarchical Homogeneity-Based Superpixel Segmentation: Application to Hyperspectral Image Analysis
Hyperspectral image (HI) analysis approaches have recently become increasingly complex and sophisticated. Recently, the combination of spectral-spatial information and superpixel techniques have addressed some hyperspect…
Hyperspectral image analysisSuperpixelsTech Report: A Fast Multiscale Spatial Regularization for Sparse Hyperspectral Unmixing
Sparse hyperspectral unmixing from large spectral libraries has been considered to circumvent limitations of endmember extraction algorithms in many applications. This strategy often leads to ill-posed inverse problems, …
Hyperspectral UnmixingSuperpixelsGraph-Weighted Contrastive Learning for Semi-Supervised Hyperspectral Image Classification
Most existing graph-based semi-supervised hyperspectral image classification methods rely on superpixel partitioning techniques. However, they suffer from misclassification of certain pixels due to inaccuracies in superp…
Contrastive LearningHyperspectral Image Classificationimage-classificationImage Classification