A Near Linear Time Constant Factor Approximation for Euclidean Bichromatic Matching (Cost)∗
Page 1 A Near Linear Time Constant Factor Approximation for Euclidean Bichromatic …

This paper presents a novel algorithm for computing graph edit distance (GED) in image
categorization. This algorithm is purely structural, ie, it needs only connectivity structure of …

The Earth Mover's Distance (EMD) between two weighted point sets (point distributions) is a
distance measure commonly used in computer vision for color-based image retrieval and …

Given a set S of n points in the plane, a Manhattan network on S is a (not necessarily planar)
rectilinear network G with the property that for every pair of points in S the network G …

Given two sets A and B of n points each in R2, we study the problem of computing a
matching between A and B that minimizes the root mean square (rms) distance of matched …

Persistence diagrams (PD) s play a central role in topological data analysis. This analysis
requires computing distances among such diagrams such as the 1-Wasserstein distance …

Abstract The Earth Mover's Distance (EMD) on weighted point sets is a distance measure
with many applications. Since there are no known exact algorithms to compute the minimum …

Deciding whether two n-point sets A, B∈ Rd are congruent is a fundamental problem in
geometric pattern matching. When the dimension d is unbounded, the problem is equivalent …

Deciding whether two n-point sets A, B∈ ℝ d are congruent is a fundamental problem in
geometric pattern matching. When the dimension d is unbounded, the problem is equivalent …

In this paper, we describe an approach for retrieving a ranked list of images containing the
same object as the query. Images in the corpus are primitively represented by a set of salient …