Combinatorial and experimental methods for approximate point pattern matching
From MaRDI portal
Publication:1889585
DOI10.1007/s00453-003-1043-4zbMath1072.68109OpenAlexW2046605360MaRDI QIDQ1889585
Suresh Venkatasubramanian, Martin Gavrilov, Piotr Indyk
Publication date: 2 December 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1043-4
Nonnumerical algorithms (68W05) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)
Related Items (13)
Output sensitive algorithms for approximate incidences and their applications ⋮ Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space ⋮ Geometric pattern matching reduces to \(k\)-SUM ⋮ FPTAS for minimizing the earth mover's distance under rigid transformations and related problems ⋮ Hausdorff matching and Lipschitz optimization ⋮ Geometric Pattern Matching Reduces to k-SUM. ⋮ Geometric pattern matching for point sets in the plane under similarity transformations ⋮ Approximate input sensitive algorithms for point pattern matching ⋮ Unnamed Item ⋮ Recurrence analysis on Julia sets of semigroups of complex polynomials ⋮ MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION ⋮ Small candidate set for translational pattern search ⋮ Finding Largest Common Point Sets
Uses Software
This page was built for publication: Combinatorial and experimental methods for approximate point pattern matching
