相关论文: On Nonrigid Shape Similarity and Correspondence

This article presents a new distance for measuring shape dissimilarity between objects. Recent publications introduced the use of eigenvalues of the Laplace operator as compact shape descriptors. Here, we revisit the eigenvalues to define a…

This work introduces a novel dissimilarity measure between two convex cones, based on the max-min angle between them. We demonstrate that this measure is closely related to the Pompeiu-Hausdorff distance, a well-established metric for…

We propose a principled approach for non-isometric landmark-preserving non-rigid shape matching. Our method is based on the functional maps framework, but rather than promoting isometries we focus instead on near-conformal maps that…

The question of representation of 3D geometry is of vital importance when it comes to leveraging the recent advances in the field of machine learning for geometry processing tasks. For common unstructured surface meshes state-of-the-art…

In this paper we introduce a notion of the Gromov-Hausdorff distance with boundary, denoted by $d_{GHB}$, to construct a framework of convergence of noncomplete metric spaces. We show that a class of bounded $A$-uniform spaces with diameter…

The Hausdorff distance measures how far apart two sets are in a common metric space. By contrast, the Gromov-Hausdorff distance provides a notion of distance between two abstract metric spaces. How do these distances behave for quotients of…

Techniques from metric geometry have become fundamental tools in modern mathematical data science, providing principled methods for comparing datasets modeled as finite metric spaces. Two of the central tools in this area are the…

In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…

This note is based on Professor Vitali Kapovitch's comparison geometry course at the University of Toronto. It delves into various comparison theorems, including those by Rauch and Toponogov, focusing on their applications, such as…

Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…

The Gromov-Hausdorff (GH) distance is a natural way to measure distance between two metric spaces. We prove that it is $\mathrm{NP}$-hard to approximate the Gromov-Hausdorff distance better than a factor of $3$ for geodesic metrics on a…

We present a survey of the dual Gromov-Hausdorff propinquity, a noncommutative analogue of the Gromov-Hausdorff distance which we introduced to provide a framework for the study of the noncommutative metric properties of C*-algebras. We…

In the context of metric geometry, we introduce a new necessary and sufficient condition for the convergence of an inductive sequence of quantum compact metric spaces for the Gromov-Hausdorff propinquity, which is a noncommutative analogue…

We study the Gromov-Hausdorff convergence of metric pairs and metric tuples and prove the equivalence of different natural definitions of this concept. We also prove embedding, completeness and compactness theorems in this setting. Finally,…

In this paper, we aim to provide a statistical theory for object matching based on the Gromov-Wasserstein distance. To this end, we model general objects as metric measure spaces. Based on this, we propose a simple and efficiently…

Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice,…

We suggest a variation of the Hellerstein--Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the structure of indexing schemes for similarity-based search and…

A new similarity measure for two sets of S-parameters is proposed. It is constructed with the modified Hausdorff distance applied to S-parameter points in 3D space with real, imaginary and normalized frequency axes. New S-parameters…

The paper is devoted to geometrical investigation of the Gromov-Hausdorff distance on the classes of all metric spaces and of all bounded metric spaces. The main attention is paid to pass connectivity questions. The pass connected…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…