A work-optimal parallel implementation of lossless image compression by block matching

Authors:
Luigi Cinque;Franco Liberati;Sergio De Agostino
Affiliations:
Universita' "La Sapienza", Dipartimento di Scienze dell' Informazione, Via Salaria 113, 00198 Roma, Italy;Universita' "La Sapienza", Dipartimento di Scienze dell' Informazione, Via Salaria 113, 00198 Roma, Italy;Armstrong Atlantic State University, Department of Computer Science, 11935 Abercorn Street, Savannah, Georgia
Venue:
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Year:
2003

Citing 6
Cited 0

Data compression: methods and theory

Data compression: methods and theory
Text compression

Text compression
Data compression via textual substitution

Journal of the ACM (JACM)
Lossless Image Compression Using Generalized LZ1-Type Methods

DCC '96 Proceedings of the Conference on Data Compression
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Storer suggested that fast encoders are possible for two-dimensional lossless compression by showing a square greedy matching LZ1 heuristic for bi-level images, which can be implemented by a simple hashing scheme [Storer 1996]. Rectangle matching improves the compression performance, but it is slower since it requires O(M log M) time for a single match, where M is the size of the match [Storer and Helfgott 1997]. Therefore, the sequential time to compress an image of size n by rectangle matching is Ω(n log M). In this paper, we show a work-optimal parallel algorithm using a rectangle greedy matching technique requiring O(log M log n) time on the PRAM EREW model.