A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing
From MaRDI portal
Publication:2028037
Abstract: Since sparse unmixing has emerged as a promising approach to hyperspectral unmixing, some spatial-contextual information in the hyperspectral images has been exploited to improve the performance of the unmixing recently. The total variation (TV) has been widely used to promote the spatial homogeneity as well as the smoothness between adjacent pixels. However, the computation task for hyperspectral sparse unmixing with a TV regularization term is heavy. Besides, the convergence of the primal alternating direction method of multipliers (ADMM) for the hyperspectral sparse unmixing with a TV regularization term has not been explained in details. In this paper, we design an efficient and convergent dual symmetric Gauss-Seidel ADMM (sGS-ADMM) for hyperspectral sparse unmixing with a TV regularization term. We also present the global convergence and local linear convergence rate analysis for this algorithm. As demonstrated in numerical experiments, our algorithm can obviously improve the efficiency of the unmixing compared with the state-of-the-art algorithm. More importantly, we can obtain images with higher quality.
Recommendations
- A two-step iterative algorithm for sparse hyperspectral unmixing via total variation
- Alternating direction method of multipliers for linear hyperspectral unmixing
- Bilateral filter based total variation regularization for sparse hyperspectral image unmixing
- Hyperspectral unmixing by the alternating direction method of multipliers
- Reweighted sparse unmixing for hyperspectral images with noise level estimation
Cites work
- A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
- A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Generalized Accelerated Proximal Gradient Approach for Total-Variation-Based Image Restoration
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- A unified algorithmic framework of symmetric Gauss-Seidel decomposition based proximal ADMMs for convex composite programming
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Convex Analysis
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Hankel matrix rank minimization with applications to system identification and realization
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Joint Bayesian Endmember Extraction and Linear Unmixing for Hyperspectral Imagery
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Matrix Analysis
- Nonlinear total variation based noise removal algorithms
- On alternating direction methods of multipliers: a historical perspective
- Some continuity properties of polyhedral multifunctions
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Total variation reconstruction from quadratic measurements
- Total variation structured total least squares method for image restoration
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
- Variational Analysis
Cited in
(8)- Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data
- Bilateral filter based total variation regularization for sparse hyperspectral image unmixing
- A two-step iterative algorithm for sparse hyperspectral unmixing via total variation
- Hyperspectral unmixing by the alternating direction method of multipliers
- A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
- SISAL revisited
- Alternating direction method of multipliers for linear hyperspectral unmixing
- A dual symmetric Gauss-Seidel technique-based proximal ADMM for robust fused Lasso estimation
This page was built for publication: A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028037)
