Sciweavers

ICASSP
2010
IEEE
13 years 11 months ago
Clustering disjoint subspaces via sparse representation
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
Ehsan Elhamifar, René Vidal
ICML
2010
IEEE
14 years 18 days ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
ESANN
2008
14 years 29 days ago
Learning Data Representations with Sparse Coding Neural Gas
Abstract. We consider the problem of learning an unknown (overcomplete) basis from an unknown sparse linear combination. Introducing the "sparse coding neural gas" algori...
Kai Labusch, Erhardt Barth, Thomas Martinetz
ICASSP
2009
IEEE
14 years 6 months ago
Inpainting with sparse linear combinations of exemplars
We introduce a new exemplar-based inpainting algorithm that represents the region to be inpainted as a sparse linear combination of example blocks, extracted from the image being ...
Brendt Wohlberg