Efficient two-dimensional compressed matching

Amihood Amir, Gary Benson

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

130 Scopus citations


Digitized images are known to be extremely space consuming. However, regularities in the images can often be exploited to reduce the necessary storage area. Thus we find that many systems store images in a compressed form. We propose that compression be used as a time saving tool, in addition to its traditional role of space saving. We introduce a new pattern matching paradigm - Compressed Matching. A text array T and pattern array P are given in compressed forms c(T) and c(P). We seek all appearances of P in T, without decompressing T. This achieves a search time that is sublinear in the size of the uncompressed text |T|. We show that for the two-dimensional run-length compression there is a O(|c(T)|log|P| + |P|), or almost optimal algorithm. The algorithm uses a novel multidimensional pattern matching technique - two-dimensional periodicity analysis.

Original languageEnglish
Title of host publicationData Compression Conference, DCC 1992
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)0818627174
StatePublished - 1992
Externally publishedYes
Event1992 Data Compression Conference, DCC 1992 - Snowbird, United States
Duration: 24 Mar 199227 Mar 1992

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Conference1992 Data Compression Conference, DCC 1992
Country/TerritoryUnited States

Bibliographical note

Funding Information:
Partially supported by NSF grant IRI-9013055. Partially supported by NSF grant IRI-9013055.

Publisher Copyright:
© 1992 IEEE.


Dive into the research topics of 'Efficient two-dimensional compressed matching'. Together they form a unique fingerprint.

Cite this