Large-Scale Hyperspectral Image Restoration via a Superpixel Distributed Algorithm Based on Graph Signal Processing

Hyperspectral image (HSI) is often disturbed by various kinds of noise, which brings great challenges to subsequent applications. Many of the existing restoration algorithms do not scale well for HSI with large size. This article proposes a novel mixed-noise removal method for HSI with large size, b...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on geoscience and remote sensing Vol. 61; pp. 1 - 17
Main Authors: Cai, Wanyuan, Jiang, Junzheng, Qian, Jiang
Format: Journal Article
Language:English
Published: New York IEEE 2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Computer applications
Distributed algorithm
Distributed algorithms
graph Laplacian regularization (GLR)
graph signal processing (GSP)
Graph theory
Graphs
Hyperspectral imaging
Image restoration
Image segmentation
Laplace equations
large-scale hyperspectral image (HSI) denoising
Matrix decomposition
Nodes
Noise reduction
Optimization
Regularization
Restoration
Signal processing
superpixel segmentation
ISSN:0196-2892, 1558-0644
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Hyperspectral image (HSI) is often disturbed by various kinds of noise, which brings great challenges to subsequent applications. Many of the existing restoration algorithms do not scale well for HSI with large size. This article proposes a novel mixed-noise removal method for HSI with large size, by leveraging the superpixel segmentation-based technology and distributed algorithm based on graph signal processing (GSP). First, the underlying structure of the HSI is modeled by a two-layer architecture graph. The upper layer, called skeleton graph, is a rough graph constructed using the modified <inline-formula> <tex-math notation="LaTeX">k </tex-math></inline-formula>-nearest-neighborhood algorithm and its nodes correspond to a series of superpixels formed by HSI segmentation. The skeleton graph can efficiently characterize the intercorrelations between superpixels, while preserving the boundary information and reducing the computational complexity. The lower layer, called detailed graph consisting of a series of local graphs which are constructed to model the similarities between pixels. Second, based on the two-layer graph architecture, the HSI restoration problem is formulated as a series of optimization problems each of which resides on a subgraph. In each optimization problem, a graph Laplacian regularization (GLR) is defined and incorporated into a low-rank (LR)-based model. Third, a novel distributed algorithm is tailored for the restoration problem, using the information interaction between the nodes of skeleton graph and subgraphs. Numerical experiments conducted on both synthetic and real-world datasets demonstrate the effectiveness of the proposed restoration algorithm compared with existing methods.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0196-2892
1558-0644
DOI:10.1109/TGRS.2023.3242728