Analytical dynamic programming matching

Seiichi Uchida, Satoshi Hokahori, Yaokai Feng

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

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationComputer Vision, ECCV 2012 - Workshops and Demonstrations, Proceedings
PublisherSpringer Verlag
Pages92-101
Number of pages10
EditionPART 1
ISBN (Print)9783642338625
DOIs
Publication statusPublished - Jan 1 2012
Event12th European Conference on Computer Vision, ECCV 2012 - 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

Other

Other12th European Conference on Computer Vision, ECCV 2012
CountryItaly
CityFlorence
Period10/7/1210/13/12

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Uchida, S., Hokahori, S., & Feng, Y. (2012). Analytical dynamic programming matching. In Computer Vision, ECCV 2012 - Workshops and Demonstrations, Proceedings (PART 1 ed., pp. 92-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7583 LNCS, No. PART 1). Springer Verlag. https://doi.org/10.1007/978-3-642-33863-2_10