On the Complexity of Affine Image Matching

DOI10.1007/978-3-540-70918-3_25zbMath1186.68523OpenAlexW1507581736MaRDI QIDQ3590940

Maciej Liśkiewicz, Christian Hundt

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (9)

Homotopic affine transformations in the 2D Cartesian grid ⋮ Two-Dimensional Pattern Matching with Combined Scaling and Rotation ⋮ 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 ⋮ Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations ⋮ New Complexity Bounds for Image Matching under Rotation and Scaling ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image

This page was built for publication: On the Complexity of Affine Image Matching