Curve matching, time warping, and light fields: New algorithms for computing similarity between curves

DOI10.1007/S10851-006-0647-0MaRDI QIDQ2384118zbMATH OpenOpenAlexFDO

Authors Quanfu Fan, Suresh Venkatasubramanian, Alon Efrat

Publication date 20 September 2007

Published in Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10851-006-0647-0

zbMATH Keywords

curve matchingsignature verificationlight fieldcurve compression

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Recommendations

• scientific article; zbMATH DE number 7051233
• Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
• Efficient algorithms for shape and pattern matching.
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Approximately matching polygonal curves with respect to the Fréchet distance

Cites work

• scientific article; zbMATH DE number 1689042 (Why is no real title available?)
• scientific article; zbMATH DE number 3141869 (Why is no real title available?)
• scientific article; zbMATH DE number 5506195 (Why is no real title available?)
• scientific article; zbMATH DE number 3981462 (Why is no real title available?)
• scientific article; zbMATH DE number 51970 (Why is no real title available?)
• scientific article; zbMATH DE number 1302349 (Why is no real title available?)
• scientific article; zbMATH DE number 6472656 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Approximate matching of polygonal shapes
• Approximately matching polygonal curves with respect to the Fréchet distance
• Approximating shortest paths on weighted polyhedral surfaces
• Approximation algorithms for geometric shortest path problems
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computing geodesic paths on manifolds
• Efficient algorithms for approximating polygonal chains
• Efficient computation of geodesic shortest paths
• Matching planar maps
• Pattern matching for sets of segments
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• The Discrete Geodesic Problem
• The Geometry of Dynamical Triangulations

Cited in

(9)

• Stretching of dynamic mathematical symbols taking care of similarity and geometric characterization
• Approximating the integral Fréchet distance
• Shape Matching by Random Sampling
• Shape matching by random sampling
• A comprehensive study of clustering a class of 2D shapes
• Computing optimal homotopies over a spiked plane with polygonal boundary
• Integrated shape-sensitive functional metrics
• Computing continuous dynamic time warping of time series in polynomial time
• scientific article; zbMATH DE number 7238975 (Why is no real title available?)

This page was built for publication: Curve matching, time warping, and light fields: New algorithms for computing similarity between curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2384118)