296 search results - page 1 / 60 » Kernel Matching Pursuit |
NIPS
2008
13 years 6 months ago
2008
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
PKDD
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
DAGM
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. This paper proposes a regression-based method for singleimage super-resolution. Kernel ridge regression (KRR) is used to estimate the high-frequency details of the underl...
ML
2002
ACM
13 years 5 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
ICASSP
2009
IEEE
14 years 3 days ago
2009
IEEE
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...