A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation

DOI10.1016/j.tcs.2009.09.009zbMath1187.68182OpenAlexW1969995248MaRDI QIDQ1038471

Christian Hundt, Maciej Liśkiewicz, Ragnar Nevries

Publication date: 18 November 2009

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

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

zbMATH Keywords

discrete algorithmscombinatorial pattern matchingdigital image matchingdiscrete rotations and scalings

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Related Items (7)

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 ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster two-dimensional pattern matching with rotations
• Real two dimensional scaled matching
• Pattern matching in a digitized image
• Real scaled matching
• Two-dimensional pattern matching with rotations
• Rotation and lighting invariant template matching
• Sequential and indexed two-dimensional combinatorial template matching allowing rotations
• Digital Image Analysis
• Low distortion maps between point sets
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Efficient pattern matching with scaling
• Alphabet-Independent and Scaled Dictionary Matching
• Faster Two Dimensional Scaled Matching

This page was built for publication: A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation