New Complexity Bounds for Image Matching under Rotation and Scaling

DOI10.1007/978-3-642-02441-2_12zbMath1247.68312OpenAlexW1561467936MaRDI QIDQ3637109

Maciej Liśkiewicz, Christian Hundt

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Related Items (2)

The generic combinatorial algorithm for image matching with classes of projective transformations ⋮ The exact complexity of projective image matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real two dimensional scaled matching
• A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
• Pattern matching in a digitized image
• Two-dimensional pattern matching with rotations
• Digital Image Analysis
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• Low distortion maps between point sets
• On the Complexity of Affine Image Matching
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Fast Multiple-Precision Evaluation of Elementary Functions
• Faster Two Dimensional Scaled Matching
• Combinatorial Pattern Matching

This page was built for publication: New Complexity Bounds for Image Matching under Rotation and Scaling