266 search results - page 5 / 54 » New algorithms for computing directional discrete Fourier tr... |
CRV
2011
IEEE
12 years 7 months ago
2011
IEEE
—We present an algorithm that finds the rotation which best aligns a given configuration of directions on an unsorted set of directions. Using a cost function that we derive in...
ICIP
2003
IEEE
14 years 9 months ago
2003
IEEE
Inthispaper we formulatethe Radon transform asa wnvolution integral over the Euclidean motion group (SE(2)) and provideaminimummeansquare error(MMSE) stochastic deconvolution meth...
ICMCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We present an implementation of general FFTs for graphics processing units (GPUs). Unlike most existing GPU FFT implementations, we handle both complex and real data of any size t...
PACT
2009
Springer
14 years 2 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
STOC
2012
ACM
11 years 10 months 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...