Affine image matching is uniform TC^0-complete
From MaRDI portal
Publication:3575233
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
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)