By Topic

Embedded zerotree image coding using low complexity IIR filter banks

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

1 Author(s)
Creusere, C.D. ; Weapons Div., Naval Air Warfare Center, China Lake, CA, USA

Compares for image coding applications a low-complexity IIR wavelet based on an all-pass polyphase decomposition to a pair of linear phase biorthogonal wavelets. To code the wavelet coefficients, the authors use Shapiro's (1993) zerotree algorithm which has the virtues of being both efficient and delivering excellent performance (in a rate-distortion sense). They consider a variety of methods for eliminating filter transients at the image boundaries including circular convolution, symmetric extension (for the biorthogonal wavelets), and direct transmission (for the IIR wavelet). By also coding the filter states in a zerotree form, they find that direct transmission generally performs better than circular convolution. Finally, they show that the use of this IIR wavelet provides equivalent performance to the biorthogonal wavelets at greatly reduced computational complexity

Published in:

Acoustics, Speech, and Signal Processing, 1995. ICASSP-95., 1995 International Conference on  (Volume:4 )

Date of Conference:

9-12 May 1995