Sciweavers

242 search results - page 12 / 49
» Fast computation of general Fourier Transforms on GPUS
Sort
View
JMIV
2011
135views more  JMIV 2011»
14 years 6 months ago
Periodic Plus Smooth Image Decomposition
When the Discrete Fourier Transform of an image is computed, the image is implicitly assumed to be periodic. Since there is no reason for opposite borders to be alike, the “peri...
Lionel Moisan
ICIP
2003
IEEE
16 years 1 months ago
Radon transform inversion via Wiener filtering over the Euclidean motion group
Inthispaper we formulatethe Radon transform asa wnvolution integral over the Euclidean motion group (SE(2)) and provideaminimummeansquare error(MMSE) stochastic deconvolution meth...
Can Evren Yarman, Birsen Yazici
CIMAGING
2009
184views Hardware» more  CIMAGING 2009»
15 years 22 days ago
Fast space-varying convolution and its application in stray light reduction
Space-varying convolution often arises in the modeling or restoration of images captured by optical imaging systems. For example, in applications such as microscopy or photography...
Jianing Wei, Guangzhi Cao, Charles A. Bouman, Jan ...
NIPS
2001
15 years 1 months ago
Fast, Large-Scale Transformation-Invariant Clustering
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
Brendan J. Frey, Nebojsa Jojic
77
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
14 years 11 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts