Translator Disclaimer
27 March 1989 A Fast Recursive Two Dimensional Cosine Transform
Author Affiliations +
Proceedings Volume 1002, Intelligent Robots and Computer Vision VII; (1989) https://doi.org/10.1117/12.960315
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States
Abstract
This paper presents a recursive, radix two by two, fast algorithm for computing the two dimensional discrete cosine transform (2D-DCT). The algorithm allows the generation of the next higher order 2D-DCT from four identical lower order 2D-DCT's with the structure being similar to the two dimensional fast Fourier transform (2D-FFT). As a result, the method for implementing this recursive 2D-DCT requires fewer multipliers and adders than other 2D-DCT algorithms.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chingwo Ma "A Fast Recursive Two Dimensional Cosine Transform", Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); https://doi.org/10.1117/12.960315
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top