By Topic

Improved bounds for the rate loss of multiresolution source codes

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

2 Author(s)
Hanying Feng ; Teradyne Inc., Agoura Hills, CA, USA ; Effros, M.

We present new bounds for the rate loss of multiresolution source codes (MRSCs). Considering an M-resolution code, the rate loss at the ith resolution with distortion Di is defined as Li=Ri-R(Di), where Ri is the rate achievable by the MRSC at stage i. This rate loss describes the performance degradation of the MRSC compared to the best single-resolution code with the same distortion. For two-resolution source codes, there are three scenarios of particular interest: (i) when both resolutions are equally important; (ii) when the rate loss at the first resolution is 0 (L1=0); (iii) when the rate loss at the second resolution is 0 (L2=0). The work of Lastras and Berger (see ibid., vol.47, p.918-26, Mar. 2001) gives constant upper bounds for the rate loss of an arbitrary memoryless source in scenarios (i) and (ii) and an asymptotic bound for scenario (iii) as D2 approaches 0. We focus on the squared error distortion measure and (a) prove that for scenario (iii) L1<1.1610 for all D21; (b) tighten the Lastras-Berger bound for scenario (ii) from L2≤1 to L2<0.7250; (c) tighten the Lastras-Berger bound for scenario (i) from Li≤1/2 to Li<0.3802, i∈{1,2}; and (d) generalize the bounds for scenarios (ii) and (iii) to M-resolution codes with M≥2. We also present upper bounds for the rate losses of additive MRSCs (AMRSCs). An AMRSC is a special MRSC where each resolution describes an incremental reproduction and the kth-resolution reconstruction equals the sum of the first k incremental reproductions. We obtain two bounds on the rate loss of AMRSCs: one primarily good for low-rate coding and another which depends on the source entropy.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 4 )