Approximate one-to-one point pattern matching

DOI10.1016/J.JDA.2012.03.002MaRDI QIDQ450574zbMATH OpenOpenAlexFDO

Authors Marc Benkert, Joachim Gudmundsson, Damian Merrick, Thomas Wolle

Publication date 13 September 2012

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2012.03.002

zbMATH Keywords

approximation algorithmbottleneck distancepoint pattern matchingsimilarity transformations

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Geometric pattern matching for point sets in the plane under similarity transformations
• Approximate congruence in nearly linear time
• Approximate input sensitive algorithms for point pattern matching
• scientific article; zbMATH DE number 1445323
• Geometry helps in bottleneck matching and related problems

Cites work

• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Approximate decision algorithms for point set congruence
• Congruence, similarity, and symmetries of geometric objects
• Geometric pattern matching under Euclidean motion
• Geometry helps in bottleneck matching and related problems
• scientific article; zbMATH DE number 432804 (Why is no real title available?)
• scientific article; zbMATH DE number 1424291 (Why is no real title available?)
• Improvements on geometric pattern matching problems
• Matching Shapes with a Reference Point
• On the parameterized complexity of \(d\)-dimensional point set pattern matching
• The upper envelope of Voronoi surfaces and its applications

Cited in

(18)

• Inexact Bayesian point pattern matching for linear transformations
• Approximating the problem, not the solution: an alternative view of point set matching
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
• Improved approximation bounds for planar point pattern matching
• An algorithm for matching point sets using the \(l_1\) norm
• Finding Largest Common Point Sets
• Elastic geometric shape matching for point sets under translations
• Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
• scientific article; zbMATH DE number 2087048 (Why is no real title available?)
• Curvature based shape detection
• scientific article; zbMATH DE number 1445323 (Why is no real title available?)
• Approximate minimum-weight matching with outliers under translation
• Graph-Based Representations in Pattern Recognition
• Algorithms and Data Structures
• Noisy colored point set matching
• Approximate input sensitive algorithms for point pattern matching
• Bottleneck partial-matching Voronoi diagrams and applications
• Geometric pattern matching for point sets in the plane under similarity transformations

This page was built for publication: Approximate one-to-one point pattern matching

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