This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties which should be satisfied by the optimal matching. A new, exact, dynamic programming algorithm is then designed for the minimization. We conclude with experimental results on shape comparison.
CITATION STYLE
Trouvé, A., & Younes, L. (2000). Diffeomorphic matching problems in one dimension: Designing and minimizing matching functionals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1842, pp. 573–587). Springer Verlag. https://doi.org/10.1007/3-540-45054-8_37
Mendeley helps you to discover research relevant for your work.