Discrete Cosine Transform
- 1 January 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in International Conference on Acoustics, Speech, and Signal Processing (ICASSP)
- Vol. C-23 (1), 90-93
- https://doi.org/10.1109/t-c.1974.223784
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Slant Transform Image CodingIEEE Transactions on Communications, 1974
- Generalized Wiener Filtering Computation TechniquesInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1972
- Performance Measures for Transform Data CodingIEEE Transactions on Communications, 1972
- Spatial Transform Coding of Color ImagesIEEE Transactions on Communication Technology, 1971
- Multidimensional Rotations in Feature SelectionInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1971
- Waish Processing of Random SignalsIEEE Transactions on Electromagnetic Compatibility, 1971