Sciweavers

140 search results - page 4 / 28
» A Novel Approach to Fast Discrete Hartley Transform
Sort
View
NIPS
2003
13 years 9 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 9 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
CORR
2007
Springer
194views Education» more  CORR 2007»
13 years 7 months ago
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
Markus Püschel, José M. F. Moura
IAJIT
2008
201views more  IAJIT 2008»
13 years 7 months ago
Implementation of a Novel Efficient Multiwavelet Based Video Coding Algorithm
: The recent explosion in digital video storage and delivery has presented strong motivation for high performance video compression solutions. An efficient video compression techni...
Sudhakar Radhakrishnan, Jayaraman Subramaniam
ICIP
2007
IEEE
14 years 9 months ago
Subspace Extension to Phase Correlation Approach for Fast Image Registration
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 ...
Jinchang Ren, Theodore Vlachos, Jianmin Jiang