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 | |
| State | Published - 1992 |
| Externally published | Yes |
| Event | 1992 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 |
Conference
| Conference | 1992 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 |