Elastic image matching is NP-complete

Authors:
Daniel Keysers;Walter Unger
Affiliations:
Lehrstuhl für Informatik VI, Department of Computer Science, RWTH Aachen--University of Technology, D-52056 Aachen, Germany;Lehrstuhl für Informatik, I, Department of Computer Science, RWTH Aachen--University of Technology, D-52056 Aachen, Germany
Venue:
Pattern Recognition Letters
Year:
2003

Citing 9
Cited 9

Optimal linguistic decoding is a difficult computational problem

Pattern Recognition Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Keyword Spotting in Poorly Printed Documents using Pseudo 2-D Hidden Markov Models

IEEE Transactions on Pattern Analysis and Machine Intelligence
Variational Image Motion Computation: Theoretical Framework, Problems and Perspectives

Mustererkennung 2000, 22. DAGM-Symposium
Handwritten Character Recognition Using Monotonic and Continuous Two-Dimensional Warping

ICDAR '99 Proceedings of the Fifth International Conference on Document Analysis and Recognition
A Monotonic and Continuous Two-Dimensional Warping Based on Dynamic Programming

ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Piecewise Linear Two-Dimensional Warping

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Handwritten Character Recognition Using Piecewise Linear Two-Dimensional Warping

ICDAR '01 Proceedings of the Sixth International Conference on Document Analysis and Recognition
A Bayesian Similarity Measure for Direct Image Matching

ICPR '96 Proceedings of the 13th International Conference on Pattern Recognition - Volume 2

The Infection Algorithm: An Artificial Epidemic Approach for Dense Stereo Correspondence

Artificial Life
Deformation Models for Image Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Multi-operator media retargeting

ACM SIGGRAPH 2009 papers
On the complexity of affine image matching

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The fast and the flexible: extended pseudo two-dimensional warping for face recognition

IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
On the intractability of inverting geometric distortions in watermarking schemes

IH'05 Proceedings of the 7th international conference on Information Hiding
Image warping for face recognition: From local optimality towards global optimization

Pattern Recognition
Analytical dynamic programming matching

ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume Part I

Quantified Score

Hi-index	0.10

Visualization

Abstract

One fundamental problem in image recognition is to establish the resemblance of two images. This can be done by searching the best pixel to pixel mapping taking into account monotonicity and continuity constraints. We show that this problem is NP-complete by reduction from 3-SAT, thus giving evidence that the known exponential time algorithms are justified, but approximation algorithms or simplifications are necessary.