Elastic image matching is NP-complete
From MaRDI portal
Publication:4421052
Recommendations
- On the Complexity of Affine Image Matching
- A remark on NP-completeness of picture matching
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- On intractability of spatial relationships in content-based image database systems
Cited in
(6)- The generic combinatorial algorithm for image matching with classes of projective transformations
- Computational complexity of similarity retrieval in a pictorial database
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- On the Complexity of Affine Image Matching
- A remark on NP-completeness of picture matching
- Affine invariants of generalized polygons and matching under affine transformations
This page was built for publication: Elastic image matching is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421052)