113 search results - page 4 / 23 » Fast algorithms for discrete polynomial transforms |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and it...
ISCAS
2007
IEEE
14 years 4 months ago
2007
IEEE
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
BILDMED
2008
13 years 11 months ago
2008
We propose a method, which treats metal artifact reduction in CT by sinogram restoration as a problem of scattered data interpolation. Corrupted sinogram entries are discarded and ...
ISMVL
2002
IEEE
14 years 2 months ago
2002
IEEE
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
106
click to vote
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...