Share Email Print

Proceedings Paper

Integer orthogonal transforms: design, fast algorithms, and applications
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The paper is devoted to design, fast implementation and applications of a family of 8-points integer orthogonal transforms based on a parametric matrix. A unified algorithm for their efficient computations is developed. Derived fast transforms have close coding gain performance to the optimal Karhunen-Loeve transform for the first order Markov process. Among them are also such that closely approximate the DCT-II and, at the same time, have a larger coding gain. For a particular set of parameters, integer transforms with reduced computational complexity are obtained. The comparative analysis of these transforms with the DCT-II in the framework of image denoising and video coding is performed.

Paper Details

Date Published: 28 May 2004
PDF: 12 pages
Proc. SPIE 5298, Image Processing: Algorithms and Systems III, (28 May 2004); doi: 10.1117/12.538694
Show Author Affiliations
Karen O. Egiazarian, Tampere Univ. of Technology (Finland)
Dmytro Rusanovskyy, Tampere Univ. of Technology (Finland)
Jaakko T. Astola, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 5298:
Image Processing: Algorithms and Systems III
Edward R. Dougherty; Jaakko T. Astola; Karen O. Egiazarian, Editor(s)

© SPIE. Terms of Use
Back to Top