Results 261 to 270 of about 123,647 (323)
Directional Discrete Cosine Transforms—A New Framework for Image Coding [PDF]
IEEE Transactions on Circuits and Systems for Video Technology, 2008 Nearly all block-based transform schemes for image and video coding developed so far choose the 2-D discrete cosine transform (DCT) of a square block shape.
Bing Zeng, Jingjing Fu
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Binary Discrete Cosine and Hartley Transforms
IEEE Transactions on Circuits and Systems I: Regular Papers, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saad Bouguezel +2 more
openaire +3 more sources
New fast recursive algorithms for the computation of discrete cosine and sine transforms [PDF]
IEEE Transactions on Signal Processing, 1992 In this correspondence, new fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point DCT or DST can be computed from two N/2-point DCT's or DST's.
Z. Cvetković, M. Popovic
exaly +3 more sources
Diagonalizing properties of the discrete cosine transforms
IEEE Transactions on Signal Processing, 1995Since its introduction in 1974 by Ahmed et al., the discrete cosine transform (DCT) has become a significant tool in many areas of digital signal processing, especially in signal compression. There exist eight types of discrete cosine transforms (DCTs).
Victoria E. Sánchez +4 more
openaire +2 more sources
Discrete cosine transform of encrypted images [PDF]
2008 15th IEEE International Conference on Image Processing, 2008 Processing a signal directly in the encrypted domain provides an elegant solution in application scenarios where valuable signals must be protected from a malicious processing device. In a previous paper we considered the implementation of the ID discrete fourier transform (DFT) in the encrypted domain, by using the homomorphic properties of the ...
Tiziano Bianchi +2 more
openaire +4 more sources
Discrete cosine transform for filter pruning
Applied Intelligence, 2022Yaosen Chen +6 more
openaire +2 more sources
Discrete Transforms and Orthogonal Polynomials of (Anti)Symmetric Multivariate Cosine Functions [PDF]
SIAM Journal on Numerical Analysis, 2014 The discrete cosine transforms of types V--VIII are generalized to the antisymmetric and symmetric multivariate discrete cosine transforms. Four families of discretely and continuously orthogonal Chebyshev-like polynomials corresponding to the ...
Jiří Hrivnák, Lenka Motlochová
exaly +2 more sources
On the Computation of the Discrete Cosine Transform
IEEE Transactions on Communications, 1978An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data. This method is about two times faster compared to the conventional method which uses a 2N -point DFT.
Madihally J. Narasimha +1 more
openaire +1 more source
On Computing the Discrete Cosine Transform
IEEE Transactions on Computers, 1978Haralick has shown that the discrete cosine transform of N points can be computed more rapidly by taking two N-point fast Fourier transforms (FFT's) than by taking one 2N-point FFT as Ahmed had proposed. In this correspondence, we show that if Haralick had made use of the fact that the FFT's of real sequences can be computed more rapidly than general ...
Ben-Dau Tseng, William C. Miller
openaire +2 more sources
Discrete cosine transform filtering
Signal Processing, 1990Circular convolution-multiplication relationships for the discrete cosine transform (DCT) that are similar to those for the discrete Fourier transform (DFT) are developed. The relations are valid if the filter frequency response is real and even. Two fairly simple relations are developed.
Bowonkoon Chitprasert, K. R. Rao 0001
openaire +1 more source