Faster two-dimensional pattern matching with rotations

DOI10.1016/j.tcs.2006.09.012zbMath1171.68874OpenAlexW2117360740MaRDI QIDQ859847

Dekel Tsur, Oren Kapah, Amihood Amir

Publication date: 22 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.012

zbMATH Keywords

rotationdesign and analysis of algorithmstwo-dimensional pattern matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items

Homotopic affine transformations in the 2D Cartesian grid, The generic combinatorial algorithm for image matching with classes of projective transformations, On 2D constrained discrete rigid transformations, Topology-preserving conditions for 2D digital images under rigid transformations, The exact complexity of projective image matching, Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image, A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pattern matching in a digitized image
• Real scaled matching
• Two-dimensional pattern matching with rotations
• Fast parallel and serial multidimensional approximate array matching
• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• Algorithms on Strings, Trees and Sequences
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Alphabet-Independent Two-Dimensional Witness Computation
• Algorithms and Data Structures