Blind Hyperspectral Unmixing Based on Graph Total Variation Regularization

doi:10.1109/TGRS.2020.3020810

Blind Hyperspectral Unmixing Based on Graph Total Variation Regularization

2021-04-01

30

OA

AI

DOI：10.1109/TGRS.2020.3020810

Original

Save

View PDF

Abstract

En 中文

Remote sensing data from hyperspectral cameras suffer from limited spatial resolution, in which a single pixel of a hyperspectral image may contain information from several materials in the field of view. Blind hyperspectral image unmixing is the process of identifying the pure spectra of individual materials (i.e., endmembers) and their proportions (i.e., abundances) at each pixel. In this article, we propose a novel blind hyperspectral unmixing model based on the graph total variation (gTV) regularization, which can be solved efficiently by the alternating direction method of multipliers (ADMM). To further alleviate the computational cost, we apply the Nystrom method to approximate a fully connected graph by a small subset of sampled points. Furthermore, we adopt the Merriman-Bence-Osher (MBO) scheme to solve the gTV-involved subproblem in ADMM by decomposing a gray-scale image into a bitwise form. A variety of numerical experiments on synthetic and real hyperspectral images are conducted, showcasing the potential of the proposed method in terms of identification accuracy and computational efficiency.

Keywords:

Alternating direction method of multipliers (ADMM)

blind hyperspectral unmixing

graph Laplacian

graph total variation (gTV)

Nystrom method

Blind Hyperspectral Unmixing Based on Graph Total Variation Regularization

Abstract

AI Summary

Journal

Organization