On the Complexity of Affine Image Matching

DOI10.1007/978-3-540-70918-3_25MaRDI QIDQ3590940zbMATH OpenOpenAlexFDO

Authors Christian Hundt, Maciej Liśkiewicz

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) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10)

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

Cited in

(16)

• 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
• On arrangements of quadrics in decomposing the parameter space of 3D digitized rigid motions
• Covering the Space of Tilts. Application to Affine Invariant Image Comparison
• Computational complexity of similarity retrieval in a pictorial database
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
• Topology-preserving conditions for 2D digital images under rigid transformations
• The exact complexity of projective image matching
• Elastic image matching is NP-complete
• Quadric arrangement in classifying rigid motions of a 3D digital image
• Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete
• Two-Dimensional Pattern Matching with Combined Scaling and Rotation
• Homotopic affine transformations in the 2D Cartesian grid
• On 2D constrained discrete rigid transformations
• 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)