Approximate input sensitive algorithms for point pattern matching

DOI10.1016/j.patcog.2009.05.014zbMath1176.68172OpenAlexW1964192719MaRDI QIDQ733152

Dror Aiger, Klara Kedem

Publication date: 15 October 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2009.05.014

zbMATH Keywords

randomizationapproximationHausdorff distancegeometric pattern matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (6)

Output sensitive algorithms for approximate incidences and their applications ⋮ Ant colony optimization based binary search for efficient point pattern matching in images ⋮ Efficient point pattern matching algorithm for planar point sets under transform of translation, rotation and scale ⋮ Point pattern matching algorithm for planar point sets under Euclidean transform ⋮ Curvature based shape detection ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Geometric pattern matching under Euclidean motion
• Extremal problems in discrete geometry
• The upper envelope of Voronoi surfaces and its applications
• Cutting hyperplanes for divide-and-conquer
• Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets
• Approximate decision algorithms for point set congruence
• Combinatorial and experimental methods for approximate point pattern matching
• Selecting distances in the plane
• Improved approximation bounds for planar point pattern matching
• Point set pattern matching in 3-D
• Approximate Range Searching: The Absolute Model
• On Sets of Distances of n Points

This page was built for publication: Approximate input sensitive algorithms for point pattern matching