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.
Chapter PDF
Similar content being viewed by others
keywords
References
R. Basri, L. Costa, D. Geiger, AND D. Jacobs, Determining the similarity of deformable shapes, in IEEE Workshop on Physics based Modeling in Computer Vision, 1995, pp. 135–143.
I. Cohen, N. Ayache, AND P. Sulger, Tracking points on deformable objects using curvature information, in Computer Vision-ECCV’92, G. Sandini, ed.., 1992, pp. 458–466.
S. Cohen, G. Elber, AND B. Bar-Yehuda, Matching of freeform curves, Computer-Aided design, 29 (1997), pp. 369–378.
B. Dacorogna, Direct methods in the calculus of variations, Springer, 1989.
D. Geiger, A. Gupta, A Costa, L, AND J. Vlontzos, Dynamic programming for detecting, tracking and matching deformable contours, IEEE PAMI, 17 1995, pp. 295–302.
W. Gorman, J, R. Mitchell, AND P. Kuel, F, Partial shape recognition using dynamic programming, IEEE PAMI, 10 1988.
S. Marques, J AND J. Abrantes, A, Shape alignment-optimal initial point and pose estimation, Pattern Recogn. Letters, 1997.
P. Olver, Equivalence, Invariants and Symmetry, Cambridge University Press, 1995.
A. Picaz AND I. Dinstein, Matching of partially occulted planar curves, Pattern Recognition, 28 1995, pp. 199–209.
M. Piccioni, S. Scarlatti, AND A. Trouv, A variational problem arising from speech recognition, SIAM Journ. Appl. Math., 58 1998), pp. 753–771.
H. Sakoe AND S. Chiba, Dynamic programming algorithm optimization for spoken word recognition, IEEE Trans. Accoustic, Speech and Signal Proc., 26 1978, pp. 43–49.
A. Trouvé AND L. Younes, On a class of diffeomorphic matching problems in one dimension, tech. rep., LAGA (UMR CNRS 7593), Institut Galilée, Université Paris XIII, 1998. To appear in SIAM J. Optimization and Control. 579, 579
L. Younes, Computable elastic distances between shapes, SIAM J. Appl. Math, 58 (1998), pp. 565–586.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trouvé, A., Younes, L. (2000). Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals. In: Computer Vision - ECCV 2000. ECCV 2000. Lecture Notes in Computer Science, vol 1842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45054-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-45054-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67685-0
Online ISBN: 978-3-540-45054-2
eBook Packages: Springer Book Archive