Sciweavers

11 search results - page 1 / 3
» Nearly optimal sparse fourier transform
Sort
View
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
11 years 7 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...
IPPS
2002
IEEE
13 years 9 months ago
A Prototypical Self-Optimizing Package for Parallel Implementation of Fast Signal Transforms
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....
Kang Chen, Jeremy R. Johnson
FOCM
2010
140views more  FOCM 2010»
13 years 3 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
BMVC
2000
13 years 6 months ago
Statistical Properties of the Hybrid Radon-Fourier Technique
The hybrid Radon-Fourier technique has been proposed for the discrimination and tracking of deforming and compound targets. The current work investigates the technique's uniq...
Violet F. Leavers
ICIP
2007
IEEE
13 years 11 months ago
Sparse Gradient Image Reconstruction Done Faster
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we...
Ray Maleh, Anna C. Gilbert, Martin J. Strauss