A Variable Splitting Augmented Lagrangian Approach to Linear Spectral Unmixing

Abstract

This paper presents a new linear hyperspectral unmixing method of the minimum volume class, termed \emph{simplex identification via split augmented Lagrangian} (SISAL). Following Craig's seminal ideas, hyperspectral linear unmixing amounts to finding the minimum volume simplex containing the hyperspectral vectors. This is a nonconvex optimization problem with convex constraints. In the proposed approach, the positivity constraints, forcing the spectral vectors to belong to the convex hull of the endmember signatures, are replaced by soft constraints. The obtained problem is solved by a sequence of augmented Lagrangian optimizations. The resulting algorithm is very fast and able so solve problems far beyond the reach of the current state-of-the art algorithms. The effectiveness of SISAL is illustrated with simulated data.

4 pages, 2 figures. Submitted to "First IEEE GRSS Workshop on Hyperspectral Image and Signal Processing, 2009"

Cited by in corpus (33)

• Spectral Unmixing via Data-guided Sparsity
• Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applications
• Hyperspectral unmixing with spectral variability using a perturbed linear mixing model
• Robust Collaborative Nonnegative Matrix Factorization For Hyperspectral Unmixing (R-CoNMF)
• Deep Hyperspectral Unmixing using Transformer Network
• Identifiability of the Simplex Volume Minimization Criterion for Blind Hyperspectral Unmixing: The No Pure-Pixel Case
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• On Identifiability of Nonnegative Matrix Factorization
• Hyperspectral Unmixing: Ground Truth Labeling, Datasets, Benchmark Performances and Survey
• A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
• Unsupervised Nonlinear Spectral Unmixing based on a Multilinear Mixing Model
• Learning From Hidden Traits: Joint Factor Analysis and Latent Clustering
• Effective Spectral Unmixing via Robust Representation and Learning-based Sparsity
• Image Processing and Machine Learning for Hyperspectral Unmixing: An Overview and the HySUPP Python Package
• Alternating Direction Algorithms for Constrained Sparse Regression: Application to Hyperspectral Unmixing
• Hyperspectral image unmixing with LiDAR data-aided spatial regularization
• Online Unmixing of Multitemporal Hyperspectral Images accounting for Spectral Variability
• Penalty Dual Decomposition Method For Nonsmooth Nonconvex Optimization
• Mixed Membership Estimation for Social Networks
• Collaborative sparse regression using spatially correlated supports - Application to hyperspectral unmixing
• A Flexible Optimization Framework for Regularized Matrix-Tensor Factorizations with Linear Couplings
• Multi-Resolution Beta-Divergence NMF for Blind Spectral Unmixing
• Probabilistic Simplex Component Analysis
• Learning Nonlinear Mixtures: Identifiability and Algorithm
• Matrix cofactorization for joint spatial-spectral unmixing of hyperspectral images
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• Recent Advances and New Guidelines on Hyperspectral and Multispectral Image Fusion
• Fast Semisupervised Unmixing Using Nonconvex Optimization
• Extracting Optimal Solution Manifolds using Constrained Neural Optimization
• On Hyperspectral Unmixing
• Structured Sparse Method for Hyperspectral Unmixing
• Minimum Volume Topic Modeling
• Detecting Breast Cancer using a Compressive Sensing Unmixing Algorithm