Analytical dynamic programming matching

Seiichi Uchida, Satoshi Hokahori, Yaokai Feng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


In this paper, we show that the truly two-dimensional elastic image matching problem can be solved analytically using dynamic programming (DP) in polynomial time if the problem is formulated as a maximum a posteriori problem using Gaussian distributions for the likelihood and prior. After giving the derivation of the analytical DP matching algorithm, we evaluate its performance on handwritten character images containing various nonlinear deformations, and compare other elastic image matching methods.

Original languageEnglish
Title of host publicationComputer Vision, ECCV 2012 - Workshops and Demonstrations, Proceedings
PublisherSpringer Verlag
Number of pages10
EditionPART 1
ISBN (Print)9783642338625
Publication statusPublished - 2012
EventComputer Vision, ECCV 2012 - Workshops and Demonstrations, Proceedings - Florence, Italy
Duration: Oct 7 2012Oct 13 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume7583 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceComputer Vision, ECCV 2012 - Workshops and Demonstrations, Proceedings

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Analytical dynamic programming matching'. Together they form a unique fingerprint.

Cite this