Elastic image matching is NP-complete

Pattern Recognition Letters

Volumn 24, Issue 1-3, 2003, Pages 445-453

  Keysers, Daniel ^a   Unger, Walter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Elastic image matching; NP completeness; Two dimensional warping

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; IMAGE ANALYSIS;

IMAGE RECOGNITION;

PATTERN MATCHING;

PATTERN RECOGNITION;

EID: 0037233350     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(02)00268-4     Document Type: Article

References (18)

1. Casacuberta, F., de la Higuera, C., 1999. Linguistic decoding is a difficult computational problem. Pattern Recognition Letters 20, 813-821.
2. di Battista, G., Eades, P., Tamassia, R., 1999. Graph Drawing. Prentice Hall, Upper Saddle River, NJ.
3. Fischer, B., Modersitzki, J., 2001. A super fast registration algorithm. In: Proceedings Bildverarbeitung für die Medizin. Springer, Lübeck, Germany, pp. 169-173.
4. Garey, M.R., Johnson, D.S., 1979. Computers and Intractibility, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
5. Keysers, D., Dahmen, J., Theiner, T., Ney, H., 2000. Experiments with an extended tangent distance. In: Proceedings 15th International Conference on Pattern Recognition, Vol. 2. Barcelona, Spain, pp. 38-42.
6. Kuo, S., Agazzi, O., 1994. Keyword spotting in poorly printed documents using pseudo 2-d hidden Markov models. IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (8), 842-848.
7. Levin, E., Pieraccini, R., 1992. Dynamic planar warping for optical character recognition. In: International Conference on Acoustics, Speech and Signal Processing, Vol. 3. San Francisco, CA, pp. 149-152.
8. Moghaddam, B., Nastar, C., Pentland, A., 1996. A bayesian similarity measure for direct image matching. In: Proceedings 13th International Conference on Pattern Recognition. Vienna, Austria, pp. 350-358.
9. Moore, R.K., 1979. A dynamic programming algorithm for the distance between two finite areas. IEEE Transactions on Pattern Analysis and Machine Intelligence 1 (1), 86-88.
10. Ney, H., Mergel, D., Noll, A., Paeseler, A., 1992. Data driven search organization for continuous speech recognition. IEEE Transactions on Signal Processing 40 (2), 271-281.
11. Ronee, M.A., Uchida, S., Sakoe, H., 2001. Handwritten character recognition using piecewise linear two-dimensional warping. In: Proceedings 6th International Conference on Document Analysis and Recognition. Seattle, WA, pp. 39-43.
12. Samaria, F.S., 1994. Face recognition using hidden Markov models. Ph.D. thesis, University of Cambridge, Cambridge, UK.
13. Schnörr, C., Weickert, J., 2000. Variational image motion computation: Theoretical framework, problems and perspectives. In: Proceedings 22. DAGM Symposium Mustererkennung 2000. Springer, Kiel, Germany, pp. 476-487.
14. Uchida, S., Sakoe, H., 1998. A monotonic and continuous two-dimensional warping based on dynamic programming. In: Proceedings 14th International Conference on Pattern Recognition, Vol. 1. Brisbane, Australia, pp. 521-524.
15. Uchida, S., Sakoe, H., 1999a. An efficient two-dimensional warping algorithm. IEICE Transactions on Information & Systems E82-D (3), 693-700.
16. Uchida, S., Sakoe, H., 1999b. Handwritten character recognition using monotonic and continuous two-dimensional warping. In: Proceedings 5th International Conference on Document Analysis and Recognition. Bangalore, India, pp. 499-502.
17. Uchida, S., Sakoe, H., 2000a. An approximation algorithm for two-dimensional warping. IEICE Transactions on Information & Systems E83-D (1), 109-111.
18. Uchida, S., Sakoe, H., 2000b. Piecewise linear two-dimensional warping. In: Proceedings of the 15th International Conference on Pattern Recognition, Vol. 3. Barcelona, Spain, pp. 538-541.