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