SIAM Journal on Computing
Data structures and algorithms for approximate string matching
Journal of Complexity
Fundamentals of digital image processing
Fundamentals of digital image processing
Vector quantization and signal compression
Vector quantization and signal compression
Self-alignments in words and their applications
Journal of Algorithms
A generalized suffix tree and its (un)expected asymptotic behaviors
SIAM Journal on Computing
Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
Digital Image Compression Techniques
Digital Image Compression Techniques
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Pattern Matching Image Compression
DCC '96 Proceedings of the Conference on Data Compression
Pattern Matching Image Compression with Predication Loop
DCC '97 Proceedings of the Conference on Data Compression
2D-Pattern Matching Image and Video Compression
DCC '99 Proceedings of the Conference on Data Compression
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A suboptimal lossy data compression based on approximate pattern matching
IEEE Transactions on Information Theory
On the performance of data compression algorithms based upon string matching
IEEE Transactions on Information Theory
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
IEEE Transactions on Information Theory
Multidimensional signal compression using multiscale recurrent patterns
Signal Processing - Image and Video Coding beyond Standards
Real-Time Decompression of Streaming Video Using Mobile Code
DCC '01 Proceedings of the Data Compression Conference
Scanned compound document encoding using multiscale recurrent patterns
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Bridging lossy and lossless compression by motif pattern discovery
General Theory of Information Transfer and Combinatorics
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
Problems of Information Transmission
Hi-index | 0.14 |
We propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name 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 (e.g., in the sense of the Hamming distance or, alternatively, of the square error distortion). This main algorithm is enhanced with several new features such as searching for reverse approximate matching, recognizing substrings 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.