Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization

zbMath1319.90044arXiv1302.4385MaRDI QIDQ2934034

Robert Luce, Nicolas Gillis

Publication date: 8 December 2014

Full work available at URL: https://arxiv.org/abs/1302.4385

zbMATH Keywords

linear programmingconvex optimizationseparabilitymatrix factorizationrobustness to noisehyperspectral unmixingpure-pixel assumption

Mathematics Subject Classification ID

Multivariate analysis (62H99) Factorization of matrices (15A23) Linear programming (90C05)

Related Items (10)

Enhancing Pure-Pixel Identification Performance via Preconditioning ⋮ Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability ⋮ Convex nonnegative matrix factorization with manifold regularization ⋮ Coseparable Nonnegative Matrix Factorization ⋮ An alternating direction and projection algorithm for structure-enforced matrix factorization ⋮ Smoothed separable nonnegative matrix factorization ⋮ Analyzing Raman spectral data without separabiliy assumption ⋮ Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms ⋮ Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization ⋮ Provably Robust Blind Source Separation of Linear-Quadratic Near-Separable Mixtures

This page was built for publication: Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization