Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete

DOI10.1007/978-3-642-13509-5_2zbMath1286.68466OpenAlexW120885949MaRDI QIDQ3575233

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

zbMATH Keywords

combinatorial pattern matchingdigital image matchingdesign and analysis of parallel algorithms

Mathematics Subject Classification ID

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

Related Items (4)

Homotopic affine transformations in the 2D Cartesian grid ⋮ 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

This page was built for publication: Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete