Sciweavers

335 search results - page 9 / 67
» Non-negative sparse coding
Sort
View
63
Voted
ALT
2008
Springer
15 years 6 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
EUROPAR
1997
Springer
15 years 1 months ago
A Relational Approach to the Compilation of Sparse Matrix Programs
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
ICCV
2011
IEEE
13 years 9 months ago
In Defense of Soft-assignment Coding
In object recognition, soft-assignment coding enjoys computational efficiency and conceptual simplicity. However, its classification performance is inferior to the newly develop...
Lingqiao Liu, Lei Wang, Xinwang Liu
ICML
2010
IEEE
14 years 10 months 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
ICCV
2011
IEEE
13 years 9 months ago
Sparse Dictionary-based Representation and Recognition of Action Attributes
We present an approach for dictionary learning of action attributes via information maximization. We unify the class distribution and appearance information into an objective func...
Qiang Qiu, Zhuolin Jiang, Rama Chellappa