Journal ArticleDOI
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
TLDR
This paper discusses certain modifications of the ideas concerning the Gromov–Hausdorff distance which have the goal of modeling and tackling the practical problems of object matching and comparison by proving explicit lower bounds for the proposed distance that involve many of the invariants previously reported by researchers.Abstract:
This paper discusses certain modifications of the ideas concerning the Gromov–Hausdorff distance which have the goal of modeling and tackling the practical problems of object matching and comparison. Objects are viewed as metric measure spaces, and based on ideas from mass transportation, a Gromov–Wasserstein type of distance between objects is defined. This reformulation yields a distance between objects which is more amenable to practical computations but retains all the desirable theoretical underpinnings. The theoretical properties of this new notion of distance are studied, and it is established that it provides a strict metric on the collection of isomorphism classes of metric measure spaces. Furthermore, the topology generated by this metric is studied, and sufficient conditions for the pre-compactness of families of metric measure spaces are identified. A second goal of this paper is to establish links to several other practical methods proposed in the literature for comparing/matching shapes in precise terms. This is done by proving explicit lower bounds for the proposed distance that involve many of the invariants previously reported by researchers. These lower bounds can be computed in polynomial time. The numerical implementations of the ideas are discussed and computational examples are presented.read more
Citations
More filters
Journal Article
Multidimensional Scaling: Infinite Metric Measure Spaces
TL;DR: A notion of MDS on infinite metric measure spaces is studied, along with its optimality properties and goodness of fit, and questions on convergence of M DS are addressed.
Book ChapterDOI
Computable invariants for curves and surfaces
TL;DR: A review of constructions that are useful for the geometric analysis of visual information, including the construction of a scale or similarity invariant arc-length for curves and surfaces, an affine invariant one, and potential signatures that reflect the result of the discrepancies between the corresponding metric spaces.
Journal ArticleDOI
On Assignment Problems Related to Gromov-Wasserstein Distances on the Real Line
TL;DR: In this paper , it was shown that the assignment problem is in general neither solved by the identical permutation (id) nor the anti-identical permutation(a-id) if n>2 + 2 + 2^\alpha.
Journal ArticleDOI
Hilbert Curve Projection Distance for Distribution Comparison
Tao Sheng Li,Jun Yu,Hongteng Xu +2 more
TL;DR: This study proposes a novel metric, called Hilbert curve projection (HCP) distance, to measure the distance between two probability distributions with high robustness and low complexity, and demonstrates that the empirical HCP distance converges to its population counterpart at a rate of no more than O ( n − 1 / 2 d ) under regularity conditions.
Book ChapterDOI
Fixpoint Theory – Upside Down
TL;DR: In this paper, the authors provide proof rules which are similar in spirit but for showing that an element is above the greatest fixpoint or, dually, below the least fixpoint.
References
More filters
Proceedings ArticleDOI
YALMIP : a toolbox for modeling and optimization in MATLAB
TL;DR: Free MATLAB toolbox YALMIP is introduced, developed initially to model SDPs and solve these by interfacing eternal solvers by making development of optimization problems in general, and control oriented SDP problems in particular, extremely simple.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Journal ArticleDOI
Shape matching and object recognition using shape contexts
TL;DR: This paper presents work on computing shape models that are computationally fast and invariant basic transformations like translation, scaling and rotation, and proposes shape detection using a feature called shape context, which is descriptive of the shape of the object.
Book
Probability and Measure
TL;DR: In this paper, the convergence of distributions is considered in the context of conditional probability, i.e., random variables and expected values, and the probability of a given distribution converging to a certain value.
Book
Linear and nonlinear programming
David G. Luenberger,Yinyu Ye +1 more
TL;DR: Strodiot and Zentralblatt as discussed by the authors introduced the concept of unconstrained optimization, which is a generalization of linear programming, and showed that it is possible to obtain convergence properties for both standard and accelerated steepest descent methods.