Abstract
An efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires far less complexity than previous DP-based elastic matching algorithms. This complexity reduction results from piecewise linearization of a 2D-2D mapping which specifies an elastic matching between two given images. Since this linearization can be guided by a priori knowledge related to image patterns to be matched, the present DP algorithm often provides sufficient matching as is shown by experimental results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.