Nonnegative matrix factorization using nonnegative polynomial approximations

Otto Debals, Marc Van Barel, Lieven De Lathauwer


Nonnegative matrix factorization is a key tool in many data analysis applications such as feature extraction, compression, and noise filtering. Many existing algorithms impose additional constraints to take into account prior knowledge and to improve the physical interpretation. This letter proposes a novel algorithm for nonnegative matrix factorization, in which the factors are modeled by nonnegative polynomials. Using a parametric representation of finite-interval nonnegative polynomials, we obtain an optimization problem without external nonnegativity constraints, which can be solved using conventional quasi-Newton or nonlinear least-squares methods. The polynomial model guarantees smooth solutions and may realize a noise reduction. A dedicated orthogonal compression enables a significant reduction of the matrix dimensions, without sacrificing accuracy. The overall approach scales well to large matrices. The approach is illustrated with applications in hyperspectral imaging and chemical shift brain imaging.

Code description

This package provides the algorithms, experiment files and tutorial files for the paper on nonnegative matrix factorization using nonnegative polynomials.


O. Debals, M. Van Barel and L. De Lathauwer, "Nonnegative matrix factorization using nonnegative polynomial approximations," IEEE Signal Processing Letters, vol. 24, no. 7, pp. 948-952, July 2017.

Download code

This repository can be cited as:
S. Hendrikx, M. Boussé, N. Vervliet, M. Vandecappelle, R. Kenis, and L. De Lathauwer, Tensorlab⁺, Available online, Version of Dec 2022 downloaded from