A work-optimal parallel implementation of lossless image compression by block matching
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
A Parallel Algorithm for Lossless Image Compression by Block Matching
DCC '02 Proceedings of the Data Compression Conference
LZ1 Compression of Binary Images Using a Simple Rectangle Greedy Matching Technique
DCC '01 Proceedings of the Data Compression Conference
Improving on-line construction of two-dimensional suffix trees for square matrices
Information Processing Letters
RDVideo: A new lossless video codec on GPU
ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing - Volume Part II
O(n2 log n) time on-line construction of two-dimensional suffix trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Lossless image compression has traditionally employed techniques quite separate from those used for text compression or lossy image compression; most standards today employ modeling followed by coding (e.g., the JBIG standard, the IBM Q-coder, CCIIT Group 4). Constantinescu and Storer [1994] present a lossy image compression scheme that can be viewed as a generalization of lossless dynamic dictionary compression ("LZ2" type methods) to two dimensions with approximate matching; recently, Constantinescu and Storer [1995] have experimented with this approach for lossless image compression with great success. Here we generalize "LZ1" type methods to lossless image compression. We examine complexity issues and 2D implementations.