Analytical Dynamic Programming Matching
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.
Cite
Text
Uchida et al. "Analytical Dynamic Programming Matching." European Conference on Computer Vision, 2012. doi:10.1007/978-3-642-33863-2_10Markdown
[Uchida et al. "Analytical Dynamic Programming Matching." European Conference on Computer Vision, 2012.](https://mlanthology.org/eccv/2012/uchida2012eccv-analytical/) doi:10.1007/978-3-642-33863-2_10BibTeX
@inproceedings{uchida2012eccv-analytical,
title = {{Analytical Dynamic Programming Matching}},
author = {Uchida, Seiichi and Hokahori, Satoshi and Feng, Yaokai},
booktitle = {European Conference on Computer Vision},
year = {2012},
pages = {92-101},
doi = {10.1007/978-3-642-33863-2_10},
url = {https://mlanthology.org/eccv/2012/uchida2012eccv-analytical/}
}