About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Electronic Imaging: Advanced Devices and Systems 1990
Conference paper
Fast scaled-DCT algorithm
Abstract
The Discrete Cosine Transform (DCT) followed by scaling and quantization is an important operation in image processing. Because of the scaling, the DCT itself need not be computed, but rather a scalar multiple of the DCT might do, with appropriate compensation incorporated into the scaling. We present a fast method for computing such scaled output of the 2-dimensional DCT on 8 × 8 points. We also present a similar algorithm for the inverse scaled DCT.