Scaled and permuted string matching Page 1 Information Processing Letters 92 (2004) 293–297
www.elsevier.com/locate/ipl Scaled and permuted string matching Ayelet Butmana, Revital …

We give fast filtering algorithms to search for a 2-dimensional pattern in a 2-dimensional text
allowing any rotation of the pattern. We consider the cases of exact and approximate …

This thesis presents a study on rotation in 2 dimensional and 3 dimensional discrete spaces.
In computer science, using floating numbers is problematic due to computation errors. Thus …

The most efficient currently known algorithms for two-dimensional pattern matching with
rotations have a worst case time complexity of O (n2m3), where the size of the text is n× n …

A discrete rotation algorithm can be apprehended as a parametric map f α from \mathbbZi to
\mathbbZi, whose resulting permutation “looks like” the map induced by an Euclidean …

Motif patterns consisting of sequences of intermixed solid and don't-care characters have
been introduced and studied in connection with pattern discovery problems of computational …

The possibility of applying compressed matching in JPEG encoded images is investigated
and the problems raised by the scheme are discussed. A part of the problems can be solved …

The problem of image matching is to find for two given digital images A and B an admissible
transformation that converts image A as close as possible to B. This problem becomes hard …

The problem of two-dimensional pattern matching invariant under a given class of
admissible transformations F is to find matches of transformed versions f (P) of a pattern P in …

Scaled Matching refers to the problem of finding all locations in the text where the pattern,
proportionally enlarged according to an arbitrary real-sized scale, appears. Scaled matching …