By Topic

Pattern matching image compression: algorithmic and empirical results

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

3 Author(s)
M. Atallah ; Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA ; Y. Genin ; W. Szpankowski

We propose a non-transform image compression scheme based on approximate 1D pattern matching, called pattern matching image compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image. This main algorithm is enhanced with several new features such as searching for reverse approximate matching, recognizing sub-strings in images that are additively shifted versions of each other, introducing a variable and adaptive maximum distortion level D, and so forth. These enhancements are crucial to the overall quality of our scheme and their efficient implementation leads to algorithmic issues of interest in their own right. Both algorithmic and experimental results are presented. Our scheme turns out to be competitive with JPEG and wavelet compression for good quality graphical images. We also review related theoretical results

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:21 ,  Issue: 7 )