A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Fast Dynamic Programming for Elastic Registration of Curves
2016 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW)
Curve registration problems in data analysis and computer vision can often be reduced to the problem of matching two functions defined on an interval. Dynamic Programming (DP) is an effective approach to solve this problem. In this paper, we propose a DP algorithm that runs in O(N ) time to compute optimal diffeomorphisms for elastic registration of curves with N nodes. This algorithm contrasts favorably with other DP algorithms used for this problem: the commonly used algorithm of quadraticdoi:10.1109/cvprw.2016.137 dblp:conf/cvpr/BernalDH16 fatcat:yhb2u6b7v5effnjpexnqrv43fm