Online simplex-structured matrix factorization
Authors:
- Hugues KouakouHKHugues Kouakou
- José Henrique de Morais GoulartJGJosé Henrique de Morais Goulart
- Raffaele VitaleRVRaffaele Vitale
- Thomas OberlinTOThomas Oberlin
- David RousseauDavid Rousseau
- Cyril RuckebuschCRCyril Ruckebusch
- Nicolas DobigeonNDNicolas Dobigeon
Preprint
Abstract
Simplex-structured matrix factorization (SSMF) is a common task encountered in signal processing and machine learning. Minimum-volume constrained unmixing (MVCU) algorithms are among the most widely used methods to perform this task. While MVCU algorithms generally perform well in an offline setting, their direct application to online scenarios suffers from scalability limitations due to memory and computational demands. To overcome these limitations, this paper proposes an approach which can build upon any off-the-shelf MVCU algorithm to operate sequentially, i.e., to handle one observation at a time. The key idea of the proposed method consists in updating the solution of MVCU only when necessary, guided by an online check of the corresponding optimization problem constraints. It only stores and processes observations identified as informative with respect to the geometrical constraints underlying SSMF. We demonstrate the effectiveness of the approach when analyzing synthetic and real datasets, showing that it achieves estimation accuracy comparable to the offline MVCU method upon which it relies, while significantly reducing the computational cost.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Simplex-structured matrix factorisation: application of soft clustering to metabolomic dataScientific Reports, 2025
- On-the-fly spectral unmixing based on Kalman filteringChemometrics and Intelligent Laboratory Systems, 2024
- Current Applications of Multivariate Curve Resolution-Alternating Least Squares (MCR-ALS) in Pharmaceutical Analysis: ReviewJournal of Pharmaceutical Sciences, 2023
- Assessment of Essential Information in the Fourier Domain to Accelerate Raman Hyperspectral MicroimagingAnalytical Chemistry, 2023
- Topic modeling algorithms and applications: A surveyInformation Systems, 2022
- Multivariate Curve Resolution: 50 years addressing the mixture analysis problem – A reviewAnalytica Chimica Acta, 2021
- An ADMM-based algorithm with minimum dispersion regularization for on-line blind unmixing of hyperspectral imagesChemometrics and Intelligent Laboratory Systems, 2020
- Essential Spectral Pixels for Multivariate Curve Resolution of Chemical ImagesAnalytical Chemistry, 2019
- An Adaptive Sparse Sampling Scheme for Scanning Electron Microscopy using Delauney TriangulationMicroscopy and Microanalysis, 2019
- Unmixing of Hyperspectral Images using Bayesian Non-negative Matrix Factorization with Volume PriorJournal of Signal Processing Systems, 2010