Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ECCV
2000
Springer

favoriteEmaildiscussreport

173views Computer Vision» more ECCV 2000»

Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals

14 years 6 months ago

Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals

Download www.dam.brown.edu

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.

Alain Trouvé, Laurent Younes

Real-time Traffic

Computer Vision | Dynamic Programming Algorithm | ECCV 2000 | Optimal Matching | Variational Methods |

claim paper

Related Content

» On a Class of Diffeomorphic Matching Problems in One Dimension

» Geometrically Consistent Elastic Matching of 3D Shapes A Linear Programming Solution

» Landmark matching on the sphere using distance functions

» Mutual InformationBased 3D Surface Matching with Applications to Face Recognition and Brai...

» OneShot MultiSet Nonrigid FeatureSpatial Matching

» Geometric optimization and sums of algebraic functions

» On the design of matched orthonormal wavelets with compact support

» Gate Evaluation Secret Sharing and Secure OneRound TwoParty Computation

» A new canonical form for fast boolean matching in logic synthesis and verification

Post Info
More Details (n/a)

Added	16 Oct 2009
Updated	16 Oct 2009
Type	Conference
Year	2000
Where	ECCV
Authors	Alain Trouvé, Laurent Younes

Comments (0)