Fast Spectral Unmixing based on Dykstra's Alternating Projection

05/07/2015
by   Qi Wei, et al.
0

This paper presents a fast spectral unmixing algorithm based on Dykstra's alternating projection. The proposed algorithm formulates the fully constrained least squares optimization problem associated with the spectral unmixing task as an unconstrained regression problem followed by a projection onto the intersection of several closed convex sets. This projection is achieved by iteratively projecting onto each of the convex sets individually, following Dyktra's scheme. The sequence thus obtained is guaranteed to converge to the sought projection. Thanks to the preliminary matrix decomposition and variable substitution, the projection is implemented intrinsically in a subspace, whose dimension is very often much lower than the number of bands. A benefit of this strategy is that the order of the computational complexity for each projection is decreased from quadratic to linear time. Numerical experiments considering diverse spectral unmixing scenarios provide evidence that the proposed algorithm competes with the state-of-the-art, namely when the number of endmembers is relatively small, a circumstance often observed in real hyperspectral applications.

READ FULL TEXT

page 8

page 9

research
06/12/2022

A Fast Alternating Minimization Algorithm for Coded Aperture Snapshot Spectral Imaging Based on Sparsity and Deep Image Priors

Coded aperture snapshot spectral imaging (CASSI) is a technique used to ...
research
09/17/2023

Reduced projection method for quasiperiodic Schrödinger eigenvalue problems

This paper presents a reduced algorithm to the classical projection meth...
research
11/14/2022

Alternating Implicit Projected SGD and Its Efficient Variants for Equality-constrained Bilevel Optimization

Stochastic bilevel optimization, which captures the inherent nested stru...
research
11/08/2017

Clustering with feature selection using alternating minimization, Application to computational biology

This paper deals with unsupervised clustering with feature selection. Th...
research
11/07/2019

Optimal Projections in the Distance-Based Statistical Methods

This paper introduces a new way to calculate distance-based statistics, ...
research
02/05/2020

Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval

We present the convergence analysis of convex combination of the alterna...
research
09/18/2017

A Fast Algorithm Based on a Sylvester-like Equation for LS Regression with GMRF Prior

This paper presents a fast approach for penalized least squares (LS) reg...

Please sign up or login with your details

Forgot password? Click here to reset