Affine image matching is uniform TC^0-complete

DOI10.1007/978-3-642-13509-5_2zbMATH Open1286.68466OpenAlexW120885949MaRDI QIDQ3575233FDOQ3575233

Authors: Christian Hundt 

Publication date: 26 July 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13509-5_2

Recommendations

• On the Complexity of Affine Image Matching
• The exact complexity of projective image matching
• New complexity bounds for image matching under rotation and scaling
• New Complexity Bounds for Image Matching under Rotation and Scaling
• Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations

zbMATH Keywords

combinatorial pattern matchingdigital image matchingdesign and analysis of parallel algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Cited In (5)

• The generic combinatorial algorithm for image matching with classes of projective transformations
• Topology-preserving conditions for 2D digital images under rigid transformations
• The exact complexity of projective image matching
• On the Complexity of Affine Image Matching
• Homotopic affine transformations in the 2D Cartesian grid

This page was built for publication: Affine image matching is uniform \({\text \textrm{TC}^0}\)-complete

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