Sciweavers

11 search results - page 2 / 3
» Nearly optimal sparse fourier transform
Sort
View
CVPR
2010
IEEE
14 years 25 days ago
Fast Image Alignment in the Fourier Domain
In this paper we propose a framework for gradient descent image alignment in the Fourier domain. Specifically, we propose an extension to the classical Lucas & Kanade (LK) a...
Ahmed Ashraf, Simon Lucey, Tsuhan Chen
DAC
1996
ACM
13 years 8 months ago
A Parallel Precorrected FFT Based Capacitance Extraction Program for Signal Integrity Analysis
In order to optimize interconnect to avoid signal integrity problems, very fast and accurate 3-D capacitance extraction is essential. Fast algorithms, such as the multipole or prec...
Narayan R. Aluru, V. B. Nadkarni, James White
CVPR
2008
IEEE
14 years 6 months ago
An efficient algorithm for compressed MR imaging using total variation and wavelets
Compressed sensing, an emerging multidisciplinary field involving mathematics, probability, optimization, and signal processing, focuses on reconstructing an unknown signal from a...
Shiqian Ma, Wotao Yin, Yin Zhang, Amit Chakraborty
ICASSP
2008
IEEE
13 years 11 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
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 5 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson