Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
Abstract
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.
Cite
Text
Trouvé and Younes. "Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals." European Conference on Computer Vision, 2000. doi:10.1007/3-540-45054-8_37Markdown
[Trouvé and Younes. "Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals." European Conference on Computer Vision, 2000.](https://mlanthology.org/eccv/2000/trouve2000eccv-diffeomorphic/) doi:10.1007/3-540-45054-8_37BibTeX
@inproceedings{trouve2000eccv-diffeomorphic,
title = {{Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals}},
author = {Trouvé, Alain and Younes, Laurent},
booktitle = {European Conference on Computer Vision},
year = {2000},
pages = {573-587},
doi = {10.1007/3-540-45054-8_37},
url = {https://mlanthology.org/eccv/2000/trouve2000eccv-diffeomorphic/}
}