481 search results - page 13 / 97 » A Fast Program Generator of Fast Fourier Transforms |
ICIP
2007
IEEE
15 years 11 months ago
2007
IEEE
A novel extension of phase correlation to subspace correlation is proposed, in which 2-D translation is decomposed into two 1-D motions thus only 1-D Fourier transform is used to ...
107
click to vote
STOC
2012
ACM
13 years 1 days ago
2012
ACM
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...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
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...
103
click to vote
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
The Fast Fourier Transform (FFT) allows the Discrete Time Fourier Transform (DTFT) to be efficiently sampled on a uniform grid in frequency. In many applications, including Magnet...