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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Lazy Random Walks for Superpixel Segmentation
Alleviating Textual Reliance in Medical Language-guided Segmentation via Prototype-driven Semantic Approximation
A New Dataset and Performance Benchmark for Real-time Spacecraft Segmentation in Onboard Flight Computers
Seg-Wild: Interactive Segmentation based on 3D Gaussian Splatting for Unconstrained Image Collections
RSRefSeg 2: Decoupling Referring Remote Sensing Image Segmentation with Foundation Models
에이전틱 신경망 구조 탐색
Agentic Neural Architecture Search
토론
이 논문과 연결된 포럼 글이 아직 없습니다.