Sciweavers

9 search results - page 2 / 2
» Faster GPS via the sparse fourier transform
Sort
View
CISS
2008
IEEE
14 years 1 months ago
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm
—This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DS...
Mark A. Iwen, Craig V. Spencer
FOCM
2008
156views more  FOCM 2008»
13 years 7 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
ICASSP
2011
IEEE
12 years 11 months ago
Computationally efficient regularized acoustic imaging
Sparse recovery techniques have been shown to produce very accurate acoustic images, significantly outperforming traditional deconvolution approaches. However, so far these propo...
Flavio P. Ribeiro, Vitor H. Nascimento
ICASSP
2008
IEEE
14 years 1 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin