Skip to content

Discrete Cosine Transform

N. Ahmed, T. Natarajan, K.R. Rao

IEEE Transactions on Computers · 1974 · 5,276 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Ahmed, N., Natarajan, T., & Rao, K. (1974). Discrete cosine transform. IEEE Transactions on Computers, C-23(1), 90–93. https://doi.org/10.1109/t-c.1974.223784

In text: (Ahmed et al., 1974)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

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.

  1. Compressed sensing2006
  2. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information2006
  3. An Introduction To Compressive Sampling2008
  4. De-noising by soft-thresholding1995
  5. Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit2007

Metadata from OpenAlex (CC0). Citations are generated from the published record.