Partial Shape Recognition Using Dynamic Programming
IEEE Transactions on Pattern Analysis and Machine Intelligence
Direct methods in the calculus of variations
Direct methods in the calculus of variations
Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape alignment—optimal initial point and pose estimation
Pattern Recognition Letters
Computable elastic distances between shapes
SIAM Journal on Applied Mathematics
A variational problem arising from speech recognition
SIAM Journal on Applied Mathematics
Tracking Points on Deformable Objects Using Curvature Information
ECCV '92 Proceedings of the Second European Conference on Computer Vision
Variational shape matching for shape classification and retrieval
Pattern Recognition Letters
Geodesic Methods in Computer Vision and Graphics
Foundations and Trends® in Computer Graphics and Vision
Extrapolation of sparse tensor fields: application to the modeling of brain variability
IPMI'05 Proceedings of the 19th international conference on Information Processing in Medical Imaging
Spaces and manifolds of shapes in computer vision: An overview
Image and Vision Computing
| Hi-index | 0.00 |
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.