Efficient two-dimensional compressed matching

Amihood Amir; Gary Benson

doi:10.1109/dcc.1992.227453

Efficient two-dimensional compressed matching

Amihood Amir
, Gary Benson

Georgia Institute of Technology
University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

142 Scopus citations

Abstract

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 language	English
Title of host publication	Data Compression Conference, DCC 1992
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	279-288
Number of pages	10
ISBN (Electronic)	0818627174
DOIs	https://doi.org/10.1109/dcc.1992.227453
State	Published - 1992
Externally published	Yes
Event	2nd Data Compression Conference, DCC 1992 - Snowbird, United States Duration: 24 Mar 1992 → 27 Mar 1992

Publication series

Name	Data Compression Conference Proceedings
Volume	1992-March
ISSN (Print)	1068-0314
ISSN (Electronic)	2375-0359

Conference

Conference	2nd Data Compression Conference, DCC 1992
Country/Territory	United States
City	Snowbird
Period	24/03/92 → 27/03/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Funding

Partially supported by NSF grant IRI-9013055. Partially supported by NSF grant IRI-9013055.

Funders	Funder number
Norsk Sykepleierforbund	IRI-9013055

Access to Document

10.1109/dcc.1992.227453

Cite this

@inproceedings{5e2bfb70fd9047b2908e45ae9a5853a7,

title = "Efficient two-dimensional compressed matching",

abstract = "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.",

author = "Amihood Amir and Gary Benson",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 2nd Data Compression Conference, DCC 1992 ; Conference date: 24-03-1992 Through 27-03-1992",

year = "1992",

doi = "10.1109/dcc.1992.227453",

language = "אנגלית",

series = "Data Compression Conference Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "279--288",

booktitle = "Data Compression Conference, DCC 1992",

address = "ארצות הברית",

}

TY - GEN

T1 - Efficient two-dimensional compressed matching

AU - Amir, Amihood

AU - Benson, Gary

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85009167014

U2 - 10.1109/dcc.1992.227453

DO - 10.1109/dcc.1992.227453

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85009167014

T3 - Data Compression Conference Proceedings

SP - 279

EP - 288

BT - Data Compression Conference, DCC 1992

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2nd Data Compression Conference, DCC 1992

Y2 - 24 March 1992 through 27 March 1992

ER -

Efficient two-dimensional compressed matching

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this