2D-Pattern matching image and video compression: Theory, algorithms, and experiments

IEEE Transactions on Image Processing

Volumn 11, Issue 3, 2002, Pages 318-331

  Alzina, Marc ^b   Szpankowski, Wojciech ^a,c   Grama, Ananth ^c  

^a IEEE   (United States)

^b TELECOM PARISTECH   (France)

^c Purdue University   (United States)

Author keywords

Approximate pattern matching; Arithmetic coding; Generalized run length coding; Generalized Shannon entropy; k d trees; Lempel Ziv schemes; Multimedia compression; Rate distortion

Indexed keywords

ADAPTIVE ARITHMETIC CODING; DIFFERENTIAL CODING; GENERALIZED RUN LENGTH CODING; GENERALIZED SHANNON ENTROPY; LEMPEL-ZIV LOSSLESS SCHEME; MULTIMEDIA COMPRESSION;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; DATA STRUCTURES; DATABASE SYSTEMS; FREQUENCY DOMAIN ANALYSIS; IMAGE CODING; IMAGE QUALITY; INTERPOLATION; MULTIMEDIA SYSTEMS; PATTERN MATCHING; TWO DIMENSIONAL;

IMAGE COMPRESSION;

EID: 0036504594     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/83.988964     Document Type: Article

References (27)

1. The Erdös-Rényi strong law for pattern matching with given proportion of mismatches
2. Pattern matching image compression with prediction loop: Preliminary experimental results
3. A pattern matching image compression: Algorithmic and empirical results
4. Improved techniques for single-pass adaptive vector quantization
5. The asymptotics of waiting times between stationary processes, allowing distortion
6. Lossy compression with the Lempel-Ziv algorithm
7. Partial match retrieval of multidimensional data
8. An algorithm for finding best matches in logarithmic expected time
9. Lossless and lossy compression of text images by soft pattern matching
10. Analysis of arithmetic coding for data compression
11. An implementable lossy version of the Lempel-Ziv algorithm-Part I: Optimality for memoryless sources
12. Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
13. A suboptimal lossy data compression based in approximate pattern matching
14. An algorithm for source coding subject to a fidelity criterion, based on string matching
15. The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
16. Fixed data base version of the Lempel-Ziv data compression algorithm
17. The sliding window Lempel-Ziv algorithm is asymptotically optimal
18. On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
19. On the performance of data compression algorithms based upon string matching
20. Natural type selection in adaptive lossy compression
21. An on-line universal lossy data compression algorithm via continuous codebook refinement-part I: Basic results
22. A universal algorithm for sequential data compression
23. Compression of individual sequences via variable-rate coding