Noisy colored point set matching

DOI10.1016/j.dam.2010.12.006zbMath1214.68428OpenAlexW2088857275MaRDI QIDQ628337

Juan-Miguel Gracia

Publication date: 10 March 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.006

zbMATH Keywords

approximate solutionsexact solutionscomputational geometrybottleneck distancenoisy matchingpoint set matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Finding Largest Common Point Sets

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Geometric pattern matching under Euclidean motion
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Point matching under non-uniform distortions.
• Approximate congruence in nearly linear time
• Simple algorithms for partial point set pattern matching under rigid motion
• Hausdorff distance under translation for points and balls
• The skip quadtree
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Geometry helps in bottleneck matching and related problems
• Matching point features under small nonrigid motion

This page was built for publication: Noisy colored point set matching