Translator Disclaimer
1 June 1994 Efficient computation of the two-dimensional fast cosine transform
Author Affiliations +
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 N2 less memory locations and 2N2 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 N0xN0 lowest frequency components of a length NXN discrete cosine transform, with both N and N0 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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Image Data Processing By Hybrid Sampling
Proceedings of SPIE (December 07 1977)
Bit-stream classification using joint and conditional entropies
Proceedings of SPIE (September 29 1996)
Biorthogonal Wilson bases
Proceedings of SPIE (October 25 1999)
Rapid update of odd DCT and DST for real time...
Proceedings of SPIE (May 24 2005)

Back to Top