Natural pseudo-distance and optimal matching between reduced size functions
From MaRDI portal
(Redirected from Publication:966491)
Abstract: This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued continuous function. Measuring dissimilarity amounts to minimizing the change in the functions due to the application of homeomorphisms between topological spaces, with respect to the -norm. In order to obtain the lower bound, a suitable metric between size functions, called matching distance, is introduced. It compares size functions by solving an optimal matching problem between countable point sets. The matching distance is shown to be resistant to perturbations, implying that it is always smaller than the natural pseudo-distance. We also prove that the lower bound so obtained is sharp and cannot be improved by any other distance between size functions.
Recommendations
- The natural pseudo-distance as a quotient pseudo-metric, and applications
- scientific article; zbMATH DE number 2111366
- An introduction to the notion of natural pseudo-distance in topological data analysis
- On certain optimal diffeomorphisms between closed curves
- Combining persistent homology and invariance groups for shape comparison
Cites work
- scientific article; zbMATH DE number 1950311 (Why is no real title available?)
- scientific article; zbMATH DE number 2111366 (Why is no real title available?)
- scientific article; zbMATH DE number 894371 (Why is no real title available?)
- scientific article; zbMATH DE number 3264065 (Why is no real title available?)
- scientific article; zbMATH DE number 3326329 (Why is no real title available?)
- Differential Topology
- Geometry helps in bottleneck matching and related problems
- Natural pseudodistances between closed manifolds
- Natural pseudodistances between closed surfaces
- New methods for reducing size graphs
- One-dimensional reduction of multidimensional persistent homology
- Reparametrization invariant norms
- Size functions and formal series
- Size functions and morphological transformations
- Size homotopy groups for computation of natural size distances
- Special issue: Shape representation and similarity for image databases
- Stability of persistence diagrams
- The bottleneck transportation problem
Cited in
(33)- Geometry of the matching distance for 2D filtering functions
- A new approximation algorithm for the matching distance in multidimensional persistence
- Distribution of Distances based Object Matching: Asymptotic Inference
- scientific article; zbMATH DE number 2111366 (Why is no real title available?)
- Universality of persistence diagrams and the bottleneck and Wasserstein distances
- Steady and ranging sets in graph persistence
- Betti numbers in multidimensional persistent homology are stable functions
- Topological graph persistence
- The coherent matching distance in 2D persistent homology
- Homological persistence in time series: an application to music classification
- A Mayer-Vietoris formula for persistent homology with an application to shape recognition in the presence of occlusions
- A global reduction method for multidimensional size graphs
- \(A_\infty\) persistent homology estimates detailed topology from pointcloud datasets
- One-dimensional reduction of multidimensional persistent homology
- Natural pseudodistances between closed surfaces
- The Reeb graph edit distance is universal
- Stable comparison of multidimensional persistent homology groups with torsion
- Generalization of the Kullback-Leibler divergence in the Tsallis statistics
- The natural pseudo-distance as a quotient pseudo-metric, and applications
- Multi-scale approximation of the matching distance for shape retrieval
- Towards a topological fingerprint of music
- The theory of the interleaving distance on multidimensional persistence modules
- scientific article; zbMATH DE number 5942297 (Why is no real title available?)
- Rank-based persistence
- A feasibility study for a persistent homology-based \(k\)-nearest neighbor search algorithm in melanoma detection
- On the set of optimal homeomorphisms for the natural pseudo-distance associated with the Lie group \(S^{1}\)
- A brief introduction to multidimensional persistent Betti numbers
- An introduction to the notion of natural pseudo-distance in topological data analysis
- Combining persistent homology and invariance groups for shape comparison
- On the geometrical properties of the coherent matching distance in 2D persistent homology
- Persistent Homology: A Topological Tool for Higher-Interaction Systems
- Comparison of persistent homologies for vector functions: from continuous to discrete and back
- Moduli spaces of Morse functions for persistence
This page was built for publication: Natural pseudo-distance and optimal matching between reduced size functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966491)
