Title :
A fast multiplierless block transform for image and video compression
Author_Institution :
Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD
Abstract :
In this paper, we present a family of fast biorthogonal block transforms called binDCT that can be implemented using only shift and add operations. All transforms are based on a VLSI-friendly lattice structure which robustly enforces both linear phase and perfect reconstruction properties. The lattice coefficients are parameterized as a series of dyadic lifting steps, providing fast, efficient in-place computation of the transform coefficients as well as the ability to map integers to integers. The new 8×8 transforms approximate closely the popular 8×8 DCT, attaining coding gains from 8.77 to 8.82 dB, despite requiring a modest amount of computations: as low as 14 shifts and 31 additions per 8 input samples. Application of the novel transforms in both lossy and lossless image coding yields very competitive results compared to the performance of the original heating-point DCT
Keywords :
data compression; discrete cosine transforms; image coding; video coding; VLSI-friendly lattice structure; binDCT; dyadic lifting steps; fast biorthogonal block transforms; fast multiplierless block transform; image coding; image compression; in-place computation; lattice coefficients; transform coefficients; video compression; Discrete cosine transforms; Discrete transforms; Filter bank; Image coding; Karhunen-Loeve transforms; Lattices; Robustness; Transform coding; Video coding; Video compression;
Conference_Titel :
Image Processing, 1999. ICIP 99. Proceedings. 1999 International Conference on
Conference_Location :
Kobe
Print_ISBN :
0-7803-5467-2
DOI :
10.1109/ICIP.1999.817241