Sciweavers

25 search results - page 3 / 5
» Convex and Semi-Nonnegative Matrix Factorizations
Sort
View
ICASSP
2009
IEEE
13 years 9 months ago
A tempering approach for Itakura-Saito non-negative matrix factorization. With application to music transcription
In this paper we are interested in non-negative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. Previous work has demonstrated the relevance of this cost functi...
Nancy Bertin, Cédric Févotte, Roland...
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
14 years 6 days ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
TIT
2010
130views Education» more  TIT 2010»
13 years 11 days ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
14 years 2 days ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
ICCV
2005
IEEE
14 years 7 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler