Refinement of Hottopixx Method for Nonnegative Matrix Factorization Under Noisy Separability
Not on the map. Why?
Abstract (arXiv)
Hottopixx, proposed by Bittorf et al. at NIPS 2012, is an algorithm for solving nonnegative matrix factorization (NMF) problems under the separability assumption. Separable NMFs have important applications, such as topic extraction from documents and unmixing of hyperspectral images. In such applications, the robustness of the algorithm to noise is the key to the success. Hottopixx has been shown to be robust to noise, and its robustness can be further enhanced through postprocessing. However, there is a drawback. Hottopixx and its postprocessing require us to estimate the noise level involved in the matrix we want to factorize before running, since they use it as part of the input data. The noise-level estimation is not an easy task. In this paper, we overcome this drawback. We present a refinement of Hottopixx and its postprocessing that runs without prior knowledge of the noise level. We show that the refinement has almost the same robustness to noise as the original algorithm.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 7 Sep 2021.
Builds on
5 of 18 references.
References · 5
- 2018Nonnegative Matrix Factorization for Signal and Data Analytics: Identifiability, Algorithms, and Applicationscited by 55
- 2013Successive Nonnegative Projection Algorithm for Robust Nonnegative Blind Source Separationcited by 18
- 2013Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimizationcited by 12
- 2016A Fast Gradient Method for Nonnegative Sparse Regression with Self Dictionarycited by 8
- 2013Ellipsoidal Rounding for Nonnegative Matrix Factorization Under Noisy Separabilitycited by 7
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.