LNCS Homepage
ContentsAuthor IndexSearch

Analytical Dynamic Programming Matching

Seiichi Uchida, Satoshi Hokahori, and Yaokai Feng

Kyushu University, Fukuoka, Japan

Abstract. 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.

LNCS 7583, p. 92 ff.

Full article in PDF | BibTeX


lncs@springer.com
© Springer-Verlag Berlin Heidelberg 2012