Inplace 2D matching in compressed images

Amihood Amir; Gad M. Landau; Dina Sokol

doi:10.1016/S0196-6774(03)00088-9

Inplace 2D matching in compressed images

Amihood Amir, Gad M. Landau, Dina Sokol

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The compressed matching problem is the problem of finding all occurrences of a pattern in a compressed text. In this paper we discuss the 2-dimensional compressed matching problem in Lempel-Ziv compressed images. Given a pattern P of (uncompressed) size m × m, and a text T of (uncompressed) size n × n, both in 2D-LZ compressed form, our algorithm finds all occurrences of P in T. The algorithm is strongly inplace, that is, the amount of extra space used is proportional to the best possible compression of a pattern of size m². The best compression that the 2D-LZ technique can obtain for a file of size m² is O(m). The time for performing the search is O(n²) and the preprocessing time is O(m³). Our algorithm is general in the sense that it can be used for any 2D compression which can be sequentially decompressed in small space.

Original language	English
Pages (from-to)	240-261
Number of pages	22
Journal	Journal of Algorithms
Volume	49
Issue number	2
DOIs	https://doi.org/10.1016/S0196-6774(03)00088-9
State	Published - Nov 2003

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: [email protected] (A. Amir), [email protected] (G.M. Landau), [email protected] (D. Sokol). 1 Partially supported by NSF grant CCR-01-04494 and ISF grant 282/01. Part of this work was done when the author was at AT&T Labs-Research, Shannon Laboratory. 2 Partially supported by NSF grant CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grant 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. 3 Partially supported by an Israel Ministry of Industry and Commerce Magnet grant (KITE) and an AT&T travel grant.

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1016/S0196-6774(03)00088-9

Cite this

@article{1e598977ba48432d90a92f03e50e9ff4,

title = "Inplace 2D matching in compressed images",

abstract = "The compressed matching problem is the problem of finding all occurrences of a pattern in a compressed text. In this paper we discuss the 2-dimensional compressed matching problem in Lempel-Ziv compressed images. Given a pattern P of (uncompressed) size m × m, and a text T of (uncompressed) size n × n, both in 2D-LZ compressed form, our algorithm finds all occurrences of P in T. The algorithm is strongly inplace, that is, the amount of extra space used is proportional to the best possible compression of a pattern of size m2. The best compression that the 2D-LZ technique can obtain for a file of size m2 is O(m). The time for performing the search is O(n2) and the preprocessing time is O(m3). Our algorithm is general in the sense that it can be used for any 2D compression which can be sequentially decompressed in small space.",

author = "Amihood Amir and Landau, {Gad M.} and Dina Sokol",

note = "Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Amir), [email protected] (G.M. Landau), [email protected] (D. Sokol). 1 Partially supported by NSF grant CCR-01-04494 and ISF grant 282/01. Part of this work was done when the author was at AT&T Labs-Research, Shannon Laboratory. 2 Partially supported by NSF grant CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grant 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. 3 Partially supported by an Israel Ministry of Industry and Commerce Magnet grant (KITE) and an AT&T travel grant.",

year = "2003",

month = nov,

doi = "10.1016/S0196-6774(03)00088-9",

language = "English",

volume = "49",

pages = "240--261",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

T1 - Inplace 2D matching in compressed images

AU - Amir, Amihood

AU - Landau, Gad M.

AU - Sokol, Dina

N1 - Funding Information: * Corresponding author. E-mail addresses: [email protected] (A. Amir), [email protected] (G.M. Landau), [email protected] (D. Sokol). 1 Partially supported by NSF grant CCR-01-04494 and ISF grant 282/01. Part of this work was done when the author was at AT&T Labs-Research, Shannon Laboratory. 2 Partially supported by NSF grant CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by the Israel Science Foundation grant 282/01, by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. 3 Partially supported by an Israel Ministry of Industry and Commerce Magnet grant (KITE) and an AT&T travel grant.

PY - 2003/11

Y1 - 2003/11

N2 - The compressed matching problem is the problem of finding all occurrences of a pattern in a compressed text. In this paper we discuss the 2-dimensional compressed matching problem in Lempel-Ziv compressed images. Given a pattern P of (uncompressed) size m × m, and a text T of (uncompressed) size n × n, both in 2D-LZ compressed form, our algorithm finds all occurrences of P in T. The algorithm is strongly inplace, that is, the amount of extra space used is proportional to the best possible compression of a pattern of size m2. The best compression that the 2D-LZ technique can obtain for a file of size m2 is O(m). The time for performing the search is O(n2) and the preprocessing time is O(m3). Our algorithm is general in the sense that it can be used for any 2D compression which can be sequentially decompressed in small space.

AB - The compressed matching problem is the problem of finding all occurrences of a pattern in a compressed text. In this paper we discuss the 2-dimensional compressed matching problem in Lempel-Ziv compressed images. Given a pattern P of (uncompressed) size m × m, and a text T of (uncompressed) size n × n, both in 2D-LZ compressed form, our algorithm finds all occurrences of P in T. The algorithm is strongly inplace, that is, the amount of extra space used is proportional to the best possible compression of a pattern of size m2. The best compression that the 2D-LZ technique can obtain for a file of size m2 is O(m). The time for performing the search is O(n2) and the preprocessing time is O(m3). Our algorithm is general in the sense that it can be used for any 2D compression which can be sequentially decompressed in small space.

UR - http://www.scopus.com/inward/record.url?scp=0242456326&partnerID=8YFLogxK

U2 - 10.1016/S0196-6774(03)00088-9

DO - 10.1016/S0196-6774(03)00088-9

M3 - Article

AN - SCOPUS:0242456326

SN - 0196-6774

VL - 49

SP - 240

EP - 261

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 2

ER -

Inplace 2D matching in compressed images

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this