Efficient pattern matching with scaling

DOI10.1016/0196-6774(92)90003-UMaRDI QIDQ3990613zbMATH OpenOpenAlexFDO

Authors Amihood Amir, Gad M. Landau, Uzi Vishkin

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 visionlinear time algorithmscalingtwo-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)

Recommendations

• Faster Two Dimensional Scaled Matching
• Faster two dimensional scaled matching
• Real two dimensional scaled matching.
• Real two dimensional scaled matching
• Alphabet-Independent and Scaled Dictionary Matching

Cited in

(28)

• Real two dimensional scaled matching
• A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
• Efficient matching of nonrectangular shapes.
• Collage system: A unifying framework for compressed pattern matching.
• Efficient 2-dimensional approximate matching of half-rectangular figures
• Super-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
• Permuted scaled matching
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• A new efficient indexing algorithm for one-dimensional real scaled patterns
• The Negligible and Yet Subtle Cost of Pattern Matching
• Parallel range minima on coarse grained multicomputers
• String Processing and Information Retrieval
• THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
• Real two dimensional scaled matching.
• Quantum data structure for range minimum query
• Logarithmic-time internal pattern matching queries in compressed and dynamic texts
• FL-RMQ: a learned approach to range minimum queries
• Efficient indexing algorithms for one-dimensional discretely-scaled strings
• Scaled and permuted string matching
• Faster two dimensional scaled matching
• Property matching and weighted matching

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990613)