Scheduled System Maintenance on December 17th, 2014:
IEEE Xplore will be upgraded between 2:00 and 5:00 PM EST (18:00 - 21:00) UTC. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

New bounds to R(D) for additive sources and applications to image encoding

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)

In order to apply the results of information theory to the efficient storage or transmission of images, it is necessary to model the image source distribution and specify an appropriate fidelity criterion. One useful source model results from separating the log intensity random field of a typical image into the sum of two nearly independent random fields with a simpler description. It has also been found that under certain conditions a frequency-weighted squared-error fidelity criterion is satisfactory for evaluating the images. Thus it is important to consider the situation in which the source output is the sum of two independent random entities with known rate-distortion functions with respect to a (perhaps frequency-weighted) squared-error criterion. These rate-distortion functions are used to provide new bounds to the rate-distortion function of the additive source with respect to the same criterion. In one example considered, the new bounds are the tightest known in certain distortion regions. Examples from image coding are given, including a comparison of the performances of various encoding schemes.

Published in:

Information Theory, IEEE Transactions on  (Volume:25 ,  Issue: 2 )