Matching point sets with respect to the earth mover's distance

DOI10.1016/J.COMGEO.2006.10.001MaRDI QIDQ2462736zbMATH OpenOpenAlexFDO

Authors S. Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote

Publication date 3 December 2007

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2006.10.001

zbMATH Keywords

approximation algorithmsgeometric optimizationearth mover's distanceshape matchingrigid motionsweighted point sets

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Algorithms – ESA 2005
• An algorithm for matching point sets using the \(l_1\) norm
• Computing and Combinatorics
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• Approximating the problem, not the solution: an alternative view of point set matching
• Graph-Based Representations in Pattern Recognition
• Distance measures for point sets and their computation
• Point set pattern matching in \(d\)-dimensions
• Affine matching of two sets of points in arbitrary dimensions

Cites work

• scientific article; zbMATH DE number 437554 (Why is no real title available?)
• scientific article; zbMATH DE number 1803754 (Why is no real title available?)
• scientific article; zbMATH DE number 1808087 (Why is no real title available?)
• scientific article; zbMATH DE number 1305475 (Why is no real title available?)
• scientific article; zbMATH DE number 2062646 (Why is no real title available?)
• scientific article; zbMATH DE number 1424291 (Why is no real title available?)
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Algebraic optimization: The Fermat-Weber location problem
• Algorithms and Computation
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Matching Shapes with a Reference Point
• Network flows. Theory, algorithms, and applications.
• The earth mover's distance as a metric for image retrieval
• Using geometry to solve the transportation problem in the plane

Cited in

(14)

• scientific article; zbMATH DE number 7561380 (Why is no real title available?)
• scientific article; zbMATH DE number 175988 (Why is no real title available?)
• Elastic geometric shape matching for translations under the Manhattan norm
• A data-dependent approach for high-dimensional (robust) Wasserstein alignment
• Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
• scientific article; zbMATH DE number 2062646 (Why is no real title available?)
• Approximate Map Matching with respect to the Fréchet Distance
• Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
• Selecting a subset of diverse points based on the squared Euclidean distance
• Computing and Combinatorics
• Algorithms – ESA 2005
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES
• On geometric prototype and applications

Describes a project that uses

Uses Software

• EMD

This page was built for publication: Matching point sets with respect to the earth mover's distance

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