Real two dimensional scaled matching

DOI10.1007/s00453-007-9021-xzbMath1188.68119OpenAlexW2055003119MaRDI QIDQ1024780

Ely Porat, Ayelet Butman, Amihood Amir, Moshe Lewenstein

Publication date: 17 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9021-x

zbMATH Keywords

pattern matchingapproximate pattern matchingcombinatorial algorithms on wordsgeneralized pattern matchingdesign and analysis of algorithmsscaled pattern matching

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies for image processing (68U10) Combinatorics on words (68R15) Pattern recognition, speech recognition (68T10)

Related Items (10)

Permuted scaled matching ⋮ Homotopic affine transformations in the 2D Cartesian grid ⋮ A new efficient indexing algorithm for one-dimensional real scaled patterns ⋮ The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ Topology-preserving conditions for 2D digital images under rigid transformations ⋮ New complexity bounds for image matching under rotation and scaling ⋮ The exact complexity of projective image matching ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ Efficient indexing algorithms for one-dimensional discretely-scaled strings ⋮ A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

Cites Work

• Unnamed Item
• On the construction of classes of suffix trees for square matrices: Algorithms and applications
• Two-dimensional dictionary matching
• Finding level-ancestors in trees
• Pattern matching in a digitized image
• Real scaled matching
• Two-dimensional pattern matching with rotations
• Efficient 2-dimensional approximate matching of half-rectangular figures
• On-line construction of suffix trees
• Fast parallel and serial multidimensional approximate array matching
• A fast string searching algorithm
• Suffix Arrays: A New Method for On-Line String Searches
• Fast Algorithms for Finding Nearest Common Ancestors
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Efficient pattern matching with scaling
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Multiple matching of rectangular patterns
• On the sorting-complexity of suffix tree construction

This page was built for publication: Real two dimensional scaled matching