Issue No.01 - January (1974 vol.23)
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Lo?ve transform, which is known to be optimal. The performances of the Karhunen-Lo?ve and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.
Discrete cosine transform, discrete Fourier transform, feature selection, Haar transform, Karhunen-Lo?ve transform, rate distortion, Walsh-Hadamard transform, Wiener vector and scalar filtering.
T. Natarajan, K.R. Rao, "Discrete Cosine Transfom", IEEE Transactions on Computers, vol.23, no. 1, pp. 90-93, January 1974, doi:10.1109/T-C.1974.223784