Sciweavers

107 search results - page 16 / 22
» Descent methods for Nonnegative Matrix Factorization
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Illuminant dependence of PCA, NMF and NTF in spectral color imaging
In this study Principal Component Analysis (PCA), Non-negative Matrix Factorization (NMF) and Nonnegative Tensor Factorization (NTF) are applied as dimension reduction methods in ...
Alexey Andriyashin, Jussi Parkkinen, Timo Jaaskela...
ICIP
2008
IEEE
14 years 9 months ago
Face hallucination VIA sparse coding
In this paper, we address the problem of hallucinating a high resolution face given a low resolution input face. The problem is approached through sparse coding. To exploit the fa...
Jianchao Yang, Hao Tang, Yi Ma, Thomas S. Huang
ICML
2003
IEEE
14 years 8 months ago
Adaptive Overrelaxed Bound Optimization Methods
We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and No...
Ruslan Salakhutdinov, Sam T. Roweis
SIGIR
2005
ACM
14 years 29 days ago
Relation between PLSA and NMF and implications
Non-negative Matrix Factorization (NMF, [5]) and Probabilistic Latent Semantic Analysis (PLSA, [4]) have been successfully applied to a number of text analysis tasks such as docum...
Éric Gaussier, Cyril Goutte
ALT
2008
Springer
14 years 4 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil