Picture for Raimon Fabregat

Raimon Fabregat

Solving NMF with smoothness and sparsity constraints using PALM

Add code
Oct 31, 2019
Raimon Fabregat, Nelly Pustelnik, Paulo Gonçalves, Pierre Borgnat

Figure 1 for Solving NMF with smoothness and sparsity constraints using PALM
Figure 2 for Solving NMF with smoothness and sparsity constraints using PALM
Figure 3 for Solving NMF with smoothness and sparsity constraints using PALM

Non-negative matrix factorization is a problem of dimensionality reduction and source separation of data that has been widely used in many fields since it was studied in depth in 1999 by Lee and Seung, including in compression of data, document clustering, processing of audio spectrograms and astronomy. In this work we have adapted a minimization scheme for convex functions with non-differentiable constraints called PALM to solve the NMF problem with solutions that can be smooth and/or sparse, two properties frequently desired.

Viaarxiv icon
Github IconAccess Paper or Ask Questions
Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon