@inproceedings{c24196431e0d46d0ad65aac34cae7d5e,
title = "Faster two dimensional scaled matching",
abstract = "The rapidly growing need for analysis of digitized images in multimedia systems has lead to a variety of interesting problems in multidimensional pattern matching. One of the problems is that of scaled matching, finding all appearances of a pattern, proportionally enlarged according to an arbitrary real-sized scale, in a given text. The best known algorithm for this problem uses techniques from dictionary matching to solve the problem in O(nm 3 +n2m log m) time using O(nm3 + n2) space, where the text is a two-dimensional n × n array and the pattern is a two-dimensional m × m array. We present a new approach for solving the scaled matching problem improving both the running times and the space requirements. Our algorithm runs in O(n2m) time and uses O(n 2) space. This time includes the preprocessing (O(m3) time and O(m2) space), since the problem is only defined for m ≤ n.",
author = "Amihood Amir and Eran Chencinski",
year = "2006",
doi = "10.1007/11780441\_19",
language = "אנגלית",
isbn = "3540354557",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "200--210",
booktitle = "Combinatorial Pattern Matching - 17th Annual Symposium, CPM 2006, Proceedings",
address = "גרמניה",
note = "17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006 ; Conference date: 05-07-2006 Through 07-07-2006",
}