By Topic

The performance of an adaptive image data compression system in the presence of noise

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 the present paper the problem of image data compression is considered, and the evaluation of system performance with quantitative figures of merit as well as qualitative results is attempted. Three adaptive prediction techniques proposed by Balakrishnan are described and applied to video data for the removal of so-called redundant samples. Typical prediction efficiencies of several predictors are cited and compared. Encoding of "compressed" data for transmission in a noiseless channel is next considered. The efficiencies of several practical encoding procedures are compared with the efficiency of the ideal noiseless code. The most important results describe the performance of an image data compression system in a noisy channel. Davisson has related the sample error rate of the data reconstructed at the receiver to the channel error rate for a special case. This result is used as a quantitative basis for evaluating the effects of channel errors on the performance of a specific compression system. In addition, sample television pictures which depict the qualitative effects of channel errors are exhibited. Finally, an experimental laboratory facility is briefly described, and its use in this and future work is outlined.

Published in:

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