Efficient one-dimensional real scaled matching

Authors:
Amihood Amir;Ayelet Butman;Moshe Lewenstein;Ely Porat;Dekel Tsur
Affiliations:
Bar-Ilan University and Georgia Tech, Israel;Holon Academic Institute of Technology, Israel;Bar-Ilan University, Israel;Bar-Ilan University, Israel;Bern-Gurion University, Israel
Venue:
Journal of Discrete Algorithms
Year:
2007

Citing 12
Cited 4

Efficient two-dimensional pattern matching in the presence of errors

Information Sciences: an International Journal
Fast parallel and serial multidimensional approximate array matching

Theoretical Computer Science
Efficient pattern matching with scaling

Journal of Algorithms
Efficient 2-dimensional approximate matching of half-rectangular figures

Information and Computation
Real scaled matching

Information Processing Letters
Alphabet-independent and scaled dictionary matching

Journal of Algorithms
A fast string searching algorithm

Communications of the ACM
A Rotation Invariant Filter for Two-Dimensional String Matching

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Efficient text fingerprinting via Parikh mapping

Journal of Discrete Algorithms
Two-dimensional pattern matching with rotations

Theoretical Computer Science
Character sets of strings

Journal of Discrete Algorithms

Property matching and weighted matching

Theoretical Computer Science
Efficient indexing algorithms for one-dimensional discretely-scaled strings

Information Processing Letters
The indexing for one-dimensional proportionally-scaled strings

Information Processing Letters
A new efficient indexing algorithm for one-dimensional real scaled patterns

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real Scaled Matching is the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized scale, appears. Real scaled matching is an important problem that was originally inspired by Computer Vision. In this paper, we present a new, more precise and realistic, definition for one-dimensional real scaled matching, and an efficient algorithm for solving this problem. For a text of length n and a pattern of length m, the algorithm runs in time O(nlogm+nm^3^/^2logm).