Discrete Cosine Transform

  title={Discrete Cosine Transform},
  author={Nasir Ahmed and T. Raj Natarajan and K. R. Rao},
  journal={IEEE Transactions on Computers},
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-Loeve transform, which is known to be optimal. The performances of the Karhunen-Loeve and… 
Recursive algorithms for discrete cosine transform
  • Zhao Zhijin, Qian Huisheng
  • Computer Science
    Proceedings of Third International Conference on Signal Processing (ICSP'96)
  • 1996
A recursive algorithm with a regular structure is first presented for computing the discrete cosine transform (DCT-II), it requires no data shifts, the multiplication coefficients can be generated by a simple recursion.
Running discrete cosine transform.
  • H. Olkkonen
  • Computer Science
    Journal of biomedical engineering
  • 1992
On discrete cosine transform
This work proposes a generalized discrete W transform with three parameters, and proves its orthogonality for some new cases, and proposes a new type of discrete cosine transform, which is proposed and its orthOGonality is proved.
Generalized Discrete Cosine Transform
  • Jianqin Zhou, Ping Chen
  • Computer Science
    2009 Pacific-Asia Conference on Circuits, Communications and Systems
  • 2009
In simulating the discrete cosine transform, a generalized discrete Cosine transform with three parameters is proposed, and its orthogonality for some new cases is proved.
A new look at DCT-type transforms
  • W. Kou, J. Mark
  • Computer Science
    IEEE Trans. Acoust. Speech Signal Process.
  • 1989
The proposed transform offers a higher computational efficiency than the traditional even discrete cosine transform and yields a mean-squared error close to that of the DCT.
Discrete cosine transform filtering
  • B. Chitprasert, K. Rao
  • Engineering
    International Conference on Acoustics, Speech, and Signal Processing
  • 1990
Circular convolution-multiplication relationships for the discrete cosine transform (DCT) that are similar to those forThe discrete Fourier transform (DFT) are developed and can be used to filter an image in the frequency domain as an approximation of circular convolution in the spatial domain.
Frequency cosine transform: A bridge between gradient based frequency transform and discrete cosine transform
It is shown that the FCT can be regarded as a special case of FRT or DCT and it is as sophisticated as the FRT and as fast as the DCT.
Image coding using weighted cosine transform
  • K. Lo, W. Cham
  • Computer Science
    IEEE TENCON'90: 1990 IEEE Region 10 Conference on Computer and Communication Systems. Conference Proceedings
  • 1990
A new orthogonal transform, called weighted cosine transform (WCT), is developed for digital image coding applications and the transform matrix is the weighted version of that in the discrete cosinetransform (DCT).
A fast recursive algorithm for computing the discrete cosine transform
  • H. Hou
  • Computer Science, Engineering
    IEEE Trans. Acoust. Speech Signal Process.
  • 1987
This paper presents a recursive algorithm for DCT with a structure that allows the generation of the next higher order DCT from two identical lower order D CT's.


Generalized Wiener Filtering Computation Techniques
  • W. Pratt
  • Computer Science, Mathematics
    IEEE Transactions on Computers
  • 1972
The classical signal processing technique known as Wiener filtering has been extended to the processing of one-and two-dimensional discrete data by digital operations with emphasis on reduction of
Slant Transform Image Coding
A new unitary transform called the slant transform, specifically designed for image coding, has been developed. The transformation possesses a discrete sawtoothlike basis vector which efficiently
Spatial Transform Coding of Color Images
The transform-coding concept has been applied to the coding of color images represented by three primary color planes of data and it is shown that, by transform coding, the chrominance content of a color image can be coded with an average of 1.0 bits per element or less without serious degradation.
Multidimensional Rotations in Feature Selection
  • H. Andrews
  • Computer Science
    IEEE Transactions on Computers
  • 1971
A character recognition experiment is selected for exemplary purposes and the use of features in the rotated spaces results in effective minimum distance classification.
Performance Measures for Transform Data Coding
This paper develops performance criteria for evaluating transform data coding schemes under computational constraints characterized by a rate-distortion relation R(D) similar in form to the theoretical rate- Distortion function.
Walsh functions in image processing and two - dimensional filtering , " in 1972
  • IEEE Trans . Commun . Technol .
  • 1972
Waish Processing of Random Signals
External link „ This page was last modified 17:12, 7 Apr 2005. „ All text is available under the terms of the GNU Free Documentation License (see Copyrights for details)
  • External link „ This page was last modified 17:12, 7 Apr 2005. „ All text is available under the terms of the GNU Free Documentation License (see Copyrights for details)
Retrieved from "http://en.wikipedia.org/wiki/Discrete_cosine_transform" Categories: Digital signal processing | Fourier analysis
  • Retrieved from "http://en.wikipedia.org/wiki/Discrete_cosine_transform" Categories: Digital signal processing | Fourier analysis
„ discrete cosine transform (http://planetmath.org/?op=getobj&from=objects&id=1469) on PlanetMath
  • „ discrete cosine transform (http://planetmath.org/?op=getobj&from=objects&id=1469) on PlanetMath