Sciweavers

23 search results - page 2 / 5
» Near-optimal sparse fourier representations via sampling
Sort
View
FOCM
2008
156views more  FOCM 2008»
13 years 5 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
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

Publication
468views
13 years 1 months ago
Visual object tracking via sample-based Adaptive Sparse Representation (AdaSR)
When appearance variation of object and its background, partial occlusion or deterioration in object images occurs, most existing visual tracking methods tend to fail in tracking ...
Zhenjun Han, Jianbin Jiao, Baochang Zhang, Qixiang...
ICASSP
2009
IEEE
14 years 15 hour ago
Compressive sampling of pulse trains: Spread the spectrum!
In this paper we consider the problem of sampling far below the Nyquist rate signals that are sparse linear superpositions of shifts of a known, potentially wide-band, pulse. This...
Farid M. Naini, Rémi Gribonval, Laurent Jac...
TIP
2010
255views more  TIP 2010»
12 years 12 months ago
Image Super-Resolution Via Sparse Representation
This paper presents a new approach to single-image superresolution, based on sparse signal representation. Research on image statistics suggests that image patches can be wellrepre...
Jianchao Yang, John Wright, Thomas S. Huang, Yi Ma
PAMI
2011
13 years 6 days ago
Coded Strobing Photography: Compressive Sensing of High Speed Periodic Videos
—We show that, via temporal modulation, one can observe and capture a high-speed periodic video well beyond the abilities of a low-frame-rate camera. By strobing the exposure wit...
Ashok Veeraraghavan, Dikpal Reddy, Ramesh Raskar