By Topic

Prediction by partial approximate matching for lossless image compression

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)
Yong Zhang ; Lane Dept. of Comput. Sci. & Electr. Eng., West Virginia Univ., Morgantown, WV, USA ; Adjeroh, D.

Summary form only given. In this paper, motivated by the characteristics of natural images, we introduce PPAM - prediction by partial approximate matching, a modification of the context model used by the prediction by partial matching (PPM) family of text compression algorithms, for images. Unless there is a strong edge boundary, natural images usually contain locally homogeneous areas. However, the correlation within these local neighborhoods is usually not exact. Repeating contexts often occur in an approximate (rather than exact) form. In PPAM, we exploit these inexact contexts using methods from text pattern matching with errors. In PPM, context searching starts by looking for the maximum-order context and then escapes to shorter contexts until a match is found. PPAM uses a simple context quantization scheme to avoid potentially huge time and space requirements. We group the contexts based on the square of their Euclidean distances (SED) from a reference context. We tested the performance of the proposed PPAM on standard test images and good results were obtained.

Published in:

Data Compression Conference, 2005. Proceedings. DCC 2005

Date of Conference:

29-31 March 2005