Efficient algorithms for shape and pattern matching.

MaRDI QIDQ3410193zbMATH OpenFDO

Authors Axel Mosig

Publication date 23 November 2006

Full work available at URL http://hss.ulb.uni-bonn.de/diss_online/math_nat_fak/2003/mosig_axel/0305.pdf

zbMATH Keywords

Dynamic Time Warping DistanceFrechet distanceG-inverted listsgeometric patterns

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05)

Recommendations

• Approximately matching polygonal curves with respect to the Fréchet distance
• Pattern matching for sets of segments
• Approximate input sensitive algorithms for point pattern matching
• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate congruence in nearly linear time

Cited in

(3)

• Elastic geometric shape matching for translations under the Manhattan norm
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
• Approximately matching polygonal curves with respect to the Fréchet distance

This page was built for publication: Efficient algorithms for shape and pattern matching.

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