Paper
4 December 1984 Direct Computation Of Higher-Order Dct Coefficients From Lower-Order Dct Coefficients
Bayesteh G. Kashef, Ali Habibi
Author Affiliations +
Abstract
An efficient algorithm is proposed that computes the coefficients of a higher-order discrete cosine transform (DOT) from the coefficients of a lower-order DCT. The main feature of this algorithm is that it calculates the DCT coefficients of the larger block sizes from the DCT coefficients of smaller block sizes without any need to generate the inverse DCT. It is more efficient than the standard approach, which involves an inverse as well as DCT, if the standard fast-Fourier transform (FFT) procedure is used. However, it is not as efficient as the standard procedure if DCT and IDCT are generated using the newly discovered Winograd Fourier transform algorithm. This paper develops the computational algorithm for the one-dimensional DCT, then extends it to the two-dimensional DCT.
© (1984) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bayesteh G. Kashef and Ali Habibi "Direct Computation Of Higher-Order Dct Coefficients From Lower-Order Dct Coefficients", Proc. SPIE 0504, Applications of Digital Image Processing VII, (4 December 1984); https://doi.org/10.1117/12.944892
Lens.org Logo
CITATIONS
Cited by 10 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Algorithm development

Digital image processing

Matrix multiplication

Fourier transforms

Surface plasmons

Aerospace engineering

RELATED CONTENT

New fast DCT algorithms based on Loeffler's factorization
Proceedings of SPIE (October 15 2012)
Recursive Transforms In Hybrid Processing
Proceedings of SPIE (October 15 1986)
A Unified Approach To Iterative Image Restoration
Proceedings of SPIE (October 13 1987)
The Fast Hartley Transform
Proceedings of SPIE (December 19 1985)

Back to Top