Elastic image matching is NP-complete

DOI10.1016/S0167-8655(02)00268-4zbMATH Open1053.68085MaRDI QIDQ4421052FDOQ4421052

Authors: Daniel Keysers, Walter Unger 

Publication date: 19 August 2003

Published in: Pattern Recognition Letters (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenessElastic image matchingTwo-dimensional warping

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

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)