Enhancing pure-pixel identification performance via preconditioning
From MaRDI portal
Abstract: In this paper, we analyze different preconditionings designed to enhance robustness of pure-pixel search algorithms, which are used for blind hyperspectral unmixing and which are equivalent to near-separable nonnegative matrix factorization algorithms. Our analysis focuses on the successive projection algorithm (SPA), a simple, efficient and provably robust algorithm in the pure-pixel algorithm class. Recently, a provably robust preconditioning was proposed by Gillis and Vavasis (arXiv:1310.2273) which requires the resolution of a semidefinite program (SDP) to find a data points-enclosing minimum volume ellipsoid. Since solving the SDP in high precisions can be time consuming, we generalize the robustness analysis to approximate solutions of the SDP, that is, solutions whose objective function values are some multiplicative factors away from the optimal value. It is shown that a high accuracy solution is not crucial for robustness, which paves the way for faster preconditionings (e.g., based on first-order optimization methods). This first contribution also allows us to provide a robustness analysis for two other preconditionings. The first one is pre-whitening, which can be interpreted as an optimal solution of the same SDP with additional constraints. We analyze robustness of pre-whitening which allows us to characterize situations in which it performs competitively with the SDP-based preconditioning. The second one is based on SPA itself and can be interpreted as an optimal solution of a relaxation of the SDP. It is extremely fast while competing with the SDP-based preconditioning on several synthetic data sets.
Recommendations
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- Hyperspectral unmixing by the alternating direction method of multipliers
- Hyperspectral demixing: sparse recovery of highly correlated endmembers
Cites work
- A Convex Analysis Framework for Blind Separation of Non-Negative Sources
- A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
- A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
- A proximal point algorithm for log-determinant optimization with group Lasso regularization
- Archetypal Analysis
- Computation of Minimum-Volume Covering Ellipsoids
- Computing a nonnegative matrix factorization -- provably
- Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
- Enhancing pure-pixel identification performance via preconditioning
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Nonnegative matrix factorization for spectral data analysis
- Robust near-separable nonnegative matrix factorization using linear optimization
- Rounding of Polytopes in the Real Number Model of Computation
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Sparse quadratic forms and their geometric applications [following Batson, Spielman, and Srivastava].
- Successive nonnegative projection algorithm for robust nonnegative blind source separation
- Twice-Ramanujan sparsifiers
Cited in
(6)- Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- Enhancing pure-pixel identification performance via preconditioning
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- On the robustness of the successive projection algorithm
- Rethinking coupled tensor analysis for hyperspectral superresolution: recoverable modeling under endmember variability
This page was built for publication: Enhancing pure-pixel identification performance via preconditioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192648)
