Share Email Print

Proceedings Paper

Efficient computation of the two-dimensional fast cosine transform
Author(s): Charilaos A. Christopoulos; Jan G. Bormans; Athanasios N. Skodras; Jan P.H. Cornelis
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 1 June 1994
PDF: 9 pages
Proc. SPIE 2238, Hybrid Image and Signal Processing IV, (1 June 1994); doi: 10.1117/12.177718
Show Author Affiliations
Charilaos A. Christopoulos, Vrije Univ. Brussel (Belgium)
Jan G. Bormans, Vrije Univ. Brussel (Belgium)
Athanasios N. Skodras, Univ. of Patras (Greece)
Jan P.H. Cornelis, Vrije Univ. Brussel (Belgium)

Published in SPIE Proceedings Vol. 2238:
Hybrid Image and Signal Processing IV
David P. Casasent; Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?