28 May 2004 Integer orthogonal transforms: design, fast algorithms, and applications
Author Affiliations +
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Karen O. Egiazarian, Karen O. Egiazarian, Dmytro Rusanovskyy, Dmytro Rusanovskyy, Jaakko T. Astola, Jaakko T. Astola, } "Integer orthogonal transforms: design, fast algorithms, and applications", Proc. SPIE 5298, Image Processing: Algorithms and Systems III, (28 May 2004); doi: 10.1117/12.538694; https://doi.org/10.1117/12.538694
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top