Search Sciweavers | Sciweavers

11

NIPS
2008

149views Information Technology» more NIPS 2008»

13 years 5 months ago

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...

Zakria Hussain, John Shawe-Taylor

claim paper

Read More »

11

click to vote

ICCV
2003
IEEE

151views Computer Vision» more ICCV 2003»

Towards a Mathematical Theory of Primal Sketch and Sketchability

14 years 6 months ago

Download www.stat.ucla.edu

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...

Cheng-en Guo, Song Chun Zhu, Ying Nian Wu

claim paper

Read More »

12

click to vote

ICASSP
2009
IEEE

167views Signal Processing» more ICASSP 2009»

A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries

13 years 11 months ago

Download infoscience.epfl.ch

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...

Boris Mailhé, Rémi Gribonval, Fr&eac...

claim paper

Read More »

18

click to vote

FOCM
2008

156views more FOCM 2008»

Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit

13 years 4 months ago

Download rauhut.ins.uni-bonn.de

We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...

Stefan Kunis, Holger Rauhut

claim paper

Read More »

12

click to vote

ICIP
2001
IEEE

148views Image Processing» more ICIP 2001»

Matching pursuits multiple description coding for wireless video

14 years 6 months ago