Sciweavers

58 search results - page 3 / 12
» Sparse Coding with Invariance Constraints
Sort
View
CORR
2004
Springer
152views Education» more  CORR 2004»
13 years 7 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
ECCC
2010
91views more  ECCC 2010»
13 years 8 months ago
Limits on the rate of locally testable affine-invariant codes
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
Eli Ben-Sasson, Madhu Sudan
CVPR
2011
IEEE
13 years 4 months ago
Learning A Discriminative Dictionary for Sparse Coding via Label Consistent K-SVD
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also assoc...
Zhuolin Jiang, Zhe Lin, Larry Davis
ICCV
2011
IEEE
12 years 7 months ago
Centralized Sparse Representation for Image Restoration
This paper proposes a novel sparse representation model called centralized sparse representation (CSR) for image restoration tasks. In order for faithful image reconstruction, it ...
Weisheng Dong, Lei Zhang, Guangming Shi
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