Efficient pattern matching with scaling

DOI10.1016/0196-6774(92)90003-UzbMath0767.68046OpenAlexW2024795930MaRDI 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 visionscalinglinear time algorithmtwo-dimensional string matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)

Related Items (18)

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

This page was built for publication: Efficient pattern matching with scaling