scispace - formally typeset
Journal ArticleDOI

A Fast Computational Algorithm for the Discrete Cosine Transform

Wen-Hsiung Chen, +2 more
- 01 Sep 1977 - 
- Vol. 25, Iss: 9, pp 1004-1009
Reads0
Chats0
TLDR
A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional DiscreteCosine Transform algorithms using the Fast Fourier Transform.
Abstract
A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.

read more

Citations
More filters
Journal ArticleDOI

A fast cosine transform in one and two dimensions

TL;DR: The discrete cosine transform (DCT) of an N-point real signal is derived by taking the discrete Fourier transform (DFT) of a 2N-point even extension of the signal and the method is extended to two dimensions, with a saving of 1/4 over the traditional method that uses the DFT.
Journal ArticleDOI

On the Computation of the Discrete Cosine Transform

TL;DR: An N -point discrete Fourier transform (DFT) algorithm can be used to evaluate a discrete cosine transform by a simple rearrangement of the input data.
Journal ArticleDOI

A Visual Model Weighted Cosine Transform for Image Compression and Quality Assessment

TL;DR: A new analytical solution, taking the form of a straightforward multiplicative weighting function, is developed which is readily applicable to image compression and quality assessment in conjunction with a visual model and the image cosine transform.
Book

Digital Picture Processing, Volume 1

TL;DR: The rapid rate at which the field of digital picture processing has grown in the past five years had necessitated extensive revisions and the introduction of topics not found in the original edition as discussed by the authors.
Journal ArticleDOI

Fast algorithm and implementation of 2-D discrete cosine transform

TL;DR: An algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented and it is shown that the N*N DCT, where N=2/sup m/, can be computed using only N 1-D DCTs and additions, instead of using 2N 1-Ds as in the conventional row-column approach.
References
More filters
Journal ArticleDOI

Discrete Cosine Transform

TL;DR: In this article, a discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed, which can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Journal ArticleDOI

Hybrid Coding of Pictorial Data

TL;DR: Two hybrid coding systems utilizing a cascade of a unitary transformation and differential pulse code modulators (DPCM) systems are proposed and the performance of this system is compared to the performances of the two- dimensional DPCM and the standard two-dimensional transform encoders.
Proceedings ArticleDOI

An Investigation Of MSE Contributions In Transform Image Coding Schemes

TL;DR: This work addresses the individual error sources in transform image coding by separating the component of the MSE introduced by transform coefficient deletion is separated from requantization effects.