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

DOI10.1016/J.COMGEO.2006.10.001zbMATH Open1129.65008OpenAlexW2000705203MaRDI QIDQ2462736FDOQ2462736

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

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

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

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)

Cites Work

• Title not available (Why is that?)
• The earth mover's distance as a metric for image retrieval
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Fast approximations for sums of distances, clustering and the Fermat-Weber problem
• Algebraic optimization: The Fermat-Weber location problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Matching Shapes with a Reference Point
• Title not available (Why is that?)
• Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
• Algorithms and Computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using geometry to solve the transportation problem in the plane

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A data-dependent approach for high-dimensional (robust) Wasserstein alignment
• Title not available (Why is that?)
• On Geometric Prototype and Applications
• Approximate Map Matching with respect to the Fréchet Distance
• Selecting a subset of diverse points based on the squared Euclidean distance
• Computing and Combinatorics
• FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
• ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES

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)