On the Complexity of Affine Image Matching

DOI10.1007/978-3-540-70918-3_25zbMATH Open1186.68523OpenAlexW1507581736MaRDI QIDQ3590940FDOQ3590940

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

Recommendations

• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Elastic image matching is NP-complete
• Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
• The generic combinatorial algorithm for image matching with classes of projective transformations
• New Complexity Bounds for Image Matching under Rotation and Scaling

Mathematics Subject Classification ID

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

Cited In (12)

• New Complexity Bounds for Image Matching under Rotation and Scaling
• New complexity bounds for image matching under rotation and scaling
• The generic combinatorial algorithm for image matching with classes of projective transformations
• Covering the Space of Tilts. Application to Affine Invariant Image Comparison
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Topology-preserving conditions for 2D digital images under rigid transformations
• Elastic image matching is NP-complete
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• Homotopic affine transformations in the 2D Cartesian grid
• On 2D constrained discrete rigid transformations
• Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image
• Point matching under non-uniform distortions.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590940)