mlsanityData to 7 Oct 2026

Robust Collaborative Nonnegative Matrix Factorization For Hyperspectral Unmixing (R-CoNMF)

arXiv 1506.04870 ↗First posted 16 Jun 2015math.OCcited by 11

Not on the map. Why?

Abstract (arXiv)

The recently introduced collaborative nonnegative matrix factorization (CoNMF) algorithm was conceived to simultaneously estimate the number of endmembers, the mixing matrix, and the fractional abundances from hyperspectral linear mixtures. This paper introduces R-CoNMF, which is a robust version of CoNMF. The robustness has been added by a) including a volume regularizer which penalizes the distance to a mixing matrix inferred by a pure pixel algorithm; and by b) introducing a new proximal alternating optimization (PAO) algorithm for which convergence to a critical point is guaranteed. Our experimental results indicate that R-CoNMF provides effective estimates both when the number of endmembers are unknown and when they are known.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Jun 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 4; 2023: 2; 2024: 2; 2025: 1; 2026: 1.

11 papers.