Method of mathematical programming developed by Richard Bellman (Dynamic Programming, Princeton University Press, 1957).
It is useful in obtaining the optimal strategy when the objective function to be maximized is monotonic and recursively defined depending on a variable. In the dynamic programming comparison method for signature recognition, dynamic programming is applied to obtain the best warping function of the location variable of the template against the location variable of the questionable image, using the similarity between the questionable image and the template as the objective function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
(2009). Dynamic Programming Comparison Method. In: Li, S.Z., Jain, A. (eds) Encyclopedia of Biometrics. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73003-5_9006
Download citation
DOI: https://doi.org/10.1007/978-0-387-73003-5_9006
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-73002-8
Online ISBN: 978-0-387-73003-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering