By Topic

Spectrum Decomposition for Image/Signal Coding

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
$33 $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

2 Author(s)
Jianyu Lin ; Department of Electrical and Computer Engineering, Curtin University, Perth, Australia ; Mark J. T. Smith

In conventional subband/wavelet image coding, the subband decomposition is performed on the spatial-domain image. Here, we introduce a novel decomposition where the subband decomposition is performed on the global DCT spectrum of the image. That is, the two-dimensional spectrum rather than the image is represented by a sum of basis functions, each weighted by the transform coefficients. The distinct features of this decomposition are analyzed from a transform perspective. This spectral subband decomposition is then used as the basis for a new image coder, building on the condensed wavelet packet (CWP) algorithm. Ironically, this new method is shown to have lower arithmetic complexity than conventional subband/wavelet coders that directly decompose a time or spatial domain signal. Comparisons of the new method against conventional subband/wavelet coders that use the popular 9/7 dyadic decomposition, condensed wavelet packets, and generalized lapped orthogonal transforms, show that the new method has lower complexity and higher compression performance.

Published in:

IEEE Transactions on Signal Processing  (Volume:61 ,  Issue: 5 )