By Topic

Efficiency of shape-adaptive 2-D transforms for coding of arbitrarily shaped image segments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sikora, T. ; Heinrich-Hertz-Inst. for Commun. Technol., Berlin, Germany ; Bauer, S. ; Makai, B.

We introduce a formula to compute an optimum 2-D shape-adaptive Karhunen-Loeve transform (KLT) suitable for coding pels in arbitrarily-shaped image segments. The efficiency of the KLT on a 2-D AR(1) process is used to benchmark two other shape-adaptive transforms described in literature. It is shown that the optimum KLT significantly outperforms the well known shape-adaptive DCT method introduced by Gilge et al. (1989) for coding Segments of arbitrary shape in intraframe coding mode. A statistical transform gain close to the Gilge-method can be achieved with a shape-adaptive DCT algorithm introduced by Sikora and Makai (see Proc. Workshop Image Anal. Image Coding, Berlin, FRG, Nov. 1993) which is implemented with much lower complexity

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:5 ,  Issue: 3 )