Results 251 to 260 of about 149,139 (331)

Discrete cosine transform filtering

Signal Processing, 1990
Circular 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.
B. Chitprasert, K.R. Rao
openaire   +1 more source

Running discrete cosine transform

Journal of Biomedical Engineering, 1992
The discrete cosine transform (DCT) has become an important tool in digital signal processing because its performance is close to the optimal Karhunen-Loeve transform. In this work the running discrete cosine transform (RDCT) is introduced. Using the properties of the discrete Fourier transform kernel W = exp (-2 pi j/N), a fast recursive algorithm was
openaire   +2 more sources

Adaptive discrete cosine transform

Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers, 2002
The theory and performance of the adaptive discrete cosine transform filter is examined. The discrete cosine transform filter is a realization of an FIR filter as the cascade of an all-zero FIR filter with a bank of IIR digital resonators. Each bank has a single magnitude and a single phase. The result of such a realization is that each coefficient can
S.J. Bukowinski, L. Gerhardt, M. Fargues, G. Coutu   +3 more
openaire   +1 more source

The Discrete Cosine Transform (DCT)

2009
The Fourier transform and the DFT are designed for processing complex-valued signals, and they always produce a complex-valued spectrum even in the case where the original signal was strictly realvalued. The reason is that neither the real nor the imaginary part of the Fourier spectrum alone is sufficient to represent (i.e., reconstruct) the signal ...
Wilhelm Burger, Mark J. Burge
openaire   +1 more source

Reversible discrete cosine transform

Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181), 2002
In this paper a reversible discrete cosine transform (RDCT) is presented. The N-point reversible transform is firstly presented, then the 8-point RDCT is obtained by substituting the 2 and 4-point reversible transforms for the 2 and 4-point transforms which compose the 8-point discrete cosine transform (DCT), respectively.
K. Komatsu, K. Sezaki
openaire   +1 more source

Fast Three-Dimensional Discrete Cosine Transform

SIAM Journal on Scientific Computing, 2008
Summary: A fast three-dimensional discrete cosine transform algorithm (3D FCT) and a fast 3D inverse cosine transform (3D IFCT) algorithm are presented, suitable for analysis of 3D data points. Many existing algorithms for three-dimensional data points make use of either the 1D cosine transform or both the 2D and 1D cosine transforms.
Lee, M. C., Chan, Raymond K. W., Adjeroh, Don A.   +2 more
openaire   +2 more sources

On Computing the Discrete Cosine Transform

IEEE Transactions on Computers, 1978
Haralick 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 ...
Tseng, B. D., Miller, W. C.
openaire   +2 more sources

Algorithm 749: fast discrete cosine transform

ACM Transactions on Mathematical Software, 1995
An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated. The transform length may be an arbitrary power of two.
Sherlock, B. G., Monro, D. M.
openaire   +1 more source

Discrete cosine transform of encrypted images

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 ...
T. Bianchi, PIVA, ALESSANDRO, M. Barni
openaire   +2 more sources

Efficient Recursive Algorithm for Discrete Cosine Transform and Inverse Discrete Cosine Transform

2018 International Conference on Sustainable Energy, Electronics, and Computing Systems (SEEMS), 2018
In this paper, efficient algorithms based on recursive technique are proposed for even length Discrete cosine Transform (DCT) and Inverse Discrete Cosine Transform (IDCT). The recursive relations are derived to compute N-point DCT and IDCT coefficients by utilizing $\frac {N}{1}$execution cycles per transform coefficient.
Pragati Dahiya, Priyanka Jain
openaire   +1 more source