Noisy colored point set matching

DOI10.1016/J.DAM.2010.12.006zbMATH Open1214.68428OpenAlexW2088857275MaRDI QIDQ628337FDOQ628337

Authors: 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

Recommendations

• Approximate one-to-one point pattern matching
• A simple algorithm for approximate partial point set pattern matching under rigid motion
• Simple algorithms for partial point set pattern matching under rigid motion
• Matching sets of line segments
• Approximate congruence in nearly linear time

zbMATH Keywords

computational geometryapproximate solutionsexact solutionsbottleneck distancenoisy matchingpoint set matching

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Finding Largest Common Point Sets

Uses Software

• BRENT

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

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