296 search results - page 10 / 60 » Kernel Matching Pursuit |
115
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we present a mathematical theory for Marr's primal sketch. We first conduct a theoretical study of the descriptive Markov random field model and the generative...
124
Voted
CIMAGING
2008
15 years 5 months ago
2008
This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements
130
Voted
ICASSP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
165
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...