Sciweavers

19 search results - page 2 / 4
» Sparse Non-Negative Matrix Factorization for Mesh Segmentati...
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 5 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer
ICIP
2009
IEEE
14 years 6 months ago
Facial Expression Recognition Based On Graph-preserving Sparse Non-negative Matrix Factorization
In this paper, we present a novel algorithm for representing facial expressions. The algorithm is based on the non-negative matrix factorization (NMF) algorithm, which decomposes ...
CORR
2002
Springer
180views Education» more  CORR 2002»
13 years 5 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer
JMLR
2010
195views more  JMLR 2010»
13 years 4 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
ECCV
2006
Springer
14 years 7 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr