Smoothed separable nonnegative matrix factorization

DOI10.1016/j.laa.2023.07.013arXiv2110.05528OpenAlexW3206550165MaRDI QIDQ6178776

Nicolas Gillis, Nicolas Nadisic, Christophe Kervazo

Publication date: 5 September 2023

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

separabilitynonnegative matrix factorizationsimplex-structured matrix factorizationblind hyperspectral unmixinglatent simplexpure-pixel search algorithms

Mathematics Subject Classification ID

Factorization of matrices (15A23) Computing methodologies for image processing (68U10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis
• Principal component analysis.
• Column subset selection is NP-complete
• Nonnegative matrix factorization for spectral data analysis
• Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices
• Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separation
• Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization
• Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
• A Fast Hyperplane-Based Minimum-Volume Enclosing Simplex Algorithm for Blind Hyperspectral Unmixing
• Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
• Simplex-Structured Matrix Factorization: Sparsity-Based Identifiability and Provably Correct Algorithms
• Finding a latent k–simplex in O* (k · nnz(data)) time via Subset Smoothing
• Learning the parts of objects by non-negative matrix factorization
• Computing a nonnegative matrix factorization -- provably

This page was built for publication: Smoothed separable nonnegative matrix factorization