Efficient computation of the two-dimensional fast cosine transform

Charilaos A. Christopoulos; Jan G. Bormans; Athanasios N. Skodras; Jan P.H. Cornelis

doi:10.1117/12.177718

Translator Disclaimer

1 June 1994 Efficient computation of the two-dimensional fast cosine transform

Charilaos A. Christopoulos; Jan G. Bormans; Athanasios N. Skodras; Jan P.H. Cornelis

Author Affiliations +

Proceedings Volume 2238, Hybrid Image and Signal Processing IV; (1994) https://doi.org/10.1117/12.177718
Event: SPIE's International Symposium on Optical Engineering and Photonics in Aerospace Sensing, 1994, Orlando, FL, United States

Abstract

An extension of one of the fastest existing algorithms for the computation of the 2D discrete cosine transform is given. The algorithm can be implemented in-place requiring N² less memory locations and 2N² less data transfers for the computation of NXN DCT points compared to existing 2D FCT algorithms. Based on the proposed algorithm, a fast pruning algorithm is derived for computing the N₀xN₀ lowest frequency components of a length NXN discrete cosine transform, with both N and N₀ being powers of 2. The computational complexity of the algorithm is compared with the row-column pruning method and experimental results on execution times are given.

Citation Download Citation

Charilaos A. Christopoulos, Jan G. Bormans, Athanasios N. Skodras, and Jan P.H. Cornelis "Efficient computation of the two-dimensional fast cosine transform", Proc. SPIE 2238, Hybrid Image and Signal Processing IV, (1 June 1994); https://doi.org/10.1117/12.177718

ACCESS THE FULL ARTICLE