Pattern Matching in Compressed Raster Images (1996)
| Venue: | In Third South American Workshop on String Processing WSP 1996, International Informatics Series 4 |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Pajarola96patternmatching,
author = {Renato Pajarola and Peter Widmayer},
title = {Pattern Matching in Compressed Raster Images},
booktitle = {In Third South American Workshop on String Processing WSP 1996, International Informatics Series 4},
year = {1996},
pages = {228--242},
publisher = {Carleton University Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the problem of finding a two-dimensional pattern in a compressed satellite image. We present an algorithm that solves this problem without decompressing the image. The runtime of our algorithm is linear in the sum of the sizes of the compressed image and the pattern, unless the image contains many large parts that match the pattern partially, but not fully --- an unlikely situation for satellite images. This study contributes to a better understanding of what operations can be performed directly on compressed raster images. 1 Introduction The amount of data that is stored in computers has grown substantially over the past few years, and the growth is expected to continue. In particular, satellite images are sent to earth regularly, and they fill computer file archives quickly. This data should therefore be kept in compressed form. With these large amounts of compressed data in computer archives, the need arises to process the data in it's compressed form. Here, processing imp...
