Efficient pattern matching with scaling

DOI10.1016/0196-6774(92)90003-UzbMath0767.68046MaRDI QIDQ3990613

Uzi Vishkin, Gad M. Landau, Amihood Amir

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(92)90003-u

zbMATH Keywords

computer vision; scaling; linear time algorithm; two-dimensional string matching

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68U99: Computing methodologies and applications

68W10: Parallel algorithms in computer science

Related Items

PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS, Permuted scaled matching, A new efficient indexing algorithm for one-dimensional real scaled patterns, Efficient indexing algorithms for one-dimensional discretely-scaled strings, Scaled and permuted string matching, Faster two dimensional scaled matching, Property matching and weighted matching, Real two dimensional scaled matching, A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation, Collage system: A unifying framework for compressed pattern matching., The indexing for one-dimensional proportionally-scaled strings, Topology-preserving conditions for 2D digital images under rigid transformations, Modulated string searching, Efficient one-dimensional real scaled matching, Homotopic affine transformations in the 2D Cartesian grid, Order-preserving pattern matching with scaling, Run-Length Encoded Nondeterministic KMP and Suffix Automata, Two-Dimensional Pattern Matching with Combined Scaling and Rotation