Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization
Fast and Robust Recursive Algorithmsfor Separable Nonnegative Matrix Factorization
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns), which is equivalent to the hyperspectral unmixing problem under the linear mixing model …