Sciweavers

2295 search results - page 18 / 459
» Learning Overcomplete Representations
Sort
View
ICASSP
2009
IEEE
14 years 3 months ago
Quadtree structured restoration algorithms for piecewise polynomial images
Iterative shrinkage of sparse and redundant representations are at the heart of many state of the art denoising and deconvolution algorithms. They assume the signal is well approx...
Adam Scholefield, Pier Luigi Dragotti
ICANN
2007
Springer
14 years 2 months ago
Sparse and Transformation-Invariant Hierarchical NMF
The hierarchical non-negative matrix factorization (HNMF) is a multilayer generative network for decomposing strictly positive data into strictly positive activations and base vect...
Sven Rebhan, Julian Eggert, Horst-Michael Gro&szli...
JMIV
2011
138views more  JMIV 2011»
13 years 3 months ago
Direct Sparse Deblurring
We propose a deblurring algorithm that explicitly takes into account the sparse characteristics of natural images and does not entail solving a numerically ill-conditioned backwar...
Yifei Lou, Andrea L. Bertozzi, Stefano Soatto
DCC
2005
IEEE
14 years 8 months ago
Progressive Low Bit Rate Coding of Simple 3D Objects with Matching Pursuit
This paper presents a low rate progressive 3D mesh compression scheme for simple genuszero 3D objects. The proposed scheme is based on signal representation using redundant expans...
Ivana Tosic, Pascal Frossard, Pierre Vandergheynst
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