Paper
28 May 2004 Integer orthogonal transforms: design, fast algorithms, and applications
Author Affiliations +
Proceedings Volume 5298, Image Processing: Algorithms and Systems III; (2004) https://doi.org/10.1117/12.538694
Event: Electronic Imaging 2004, 2004, San Jose, California, United States
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, Dmytro Rusanovskyy, and Jaakko T. Astola "Integer orthogonal transforms: design, fast algorithms, and applications", Proc. SPIE 5298, Image Processing: Algorithms and Systems III, (28 May 2004); https://doi.org/10.1117/12.538694
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Prototyping

Denoising

Algorithm development

Video

Image denoising

Video coding

RELATED CONTENT

Study on deep CNN as preprocessing for video compression
Proceedings of SPIE (August 01 2021)
Joint trilateral filtering for depth map compression
Proceedings of SPIE (July 14 2010)
Quadtree-based block merging algorithm for subband coding
Proceedings of SPIE (February 17 1995)
Multicomposite wavelet estimation
Proceedings of SPIE (September 27 2011)

Back to Top