Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions

@article{dAmico2008NaturalPA,
  title={Natural Pseudo-Distance and Optimal Matching between Reduced Size Functions},
  author={Michele d'Amico and Patrizio Frosini and Claudia Landi},
  journal={Acta Applicandae Mathematicae},
  year={2008},
  volume={109},
  pages={527-554}
}
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 L∞-norm. In order to obtain the lower bound, a suitable metric between size… 
On certain optimal diffeomorphisms between closed curves
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between shape properties of topological spaces, modeled as continuous real-valued functions
ON CERTAIN OPTIMAL HOMEOMORPHISMS BETWEEN CLOSED CURVES
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between shape properties of topological spaces, modeled as continuous real-valued functions
Natural pseudo-distances between closed curves
Abstract Let us consider two closed curves ℳ, of class C 1 and two functions of class C 1, called measuring functions. The natural pseudo-distance d between the pairs (ℳ, φ), (, ψ) is defined as the
Using matching distance in size theory: A survey
TLDR
The link between reduced size functions and the dissimilarity measure δ is established by a theorem, stating that the matching distance provides an easily computable lower bound for δ.
Optimal homeomorphisms between closed curves
The concept of natural pseudo-distance has proven to be a powerful tool for measuring the dissimilarity between topological spaces endowed with continuous real-valued functions. Roughly speaking, the
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
  • F. Mémoli
  • Computer Science
    Found. Comput. Math.
  • 2011
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.
A new algorithm for computing the 2-dimensional matching distance between size functions
On the geometrical properties of the coherent matching distance in 2D persistent homology
TLDR
A new metric for comparing Betti numbers functions in bidimensional persistent homology, based on coherent matchings, i.e. families of matchings that vary in a continuous way is studied, including its stability.
Invariance properties of the multidimensional matching distance in Persistent Topology and Homology
TLDR
This paper shows that the multidimensional matching distance is actually invariant with respect to such a choice, and formally depends on a subset of $\R^n\times-valued filtering functions inducing a parameterization of these half-planes.
The Coherent Matching Distance in 2D Persistent Homology
TLDR
This paper introduces a new matching distance for 2D persistent Betti numbers, called coherent matching distance and based on matchings that change coherently with the filtrations the authors take into account, and proves that the coherent 2D matching distance is well-defined and stable.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 47 REFERENCES
Using matching distance in size theory: A survey
TLDR
The link between reduced size functions and the dissimilarity measure δ is established by a theorem, stating that the matching distance provides an easily computable lower bound for δ.
Natural pseudodistances between closed manifolds
Let us consider two closed homeomorphic manifolds M;N of class C 1 and two functions j : M ! R, c : N ! R of class C . The natural pseudodistance d between the pairs ðM; jÞ; ðN;cÞ is defined as the
Archives of Inequalities and Applications xx (200x)xxx-xxx LOWER BOUNDS FOR NATURAL PSEUDODISTANCES VIA SIZE FUNCTIONS
Let us consider two C closed homeomorphic manifolds M, N and two C functions φ : M → R, ψ : N → R, called measuring functions. The natural pseudodistance d between the pairs (M, φ), (N , ψ) is
Measuring shapes by size functions
  • P. Frosini
  • Mathematics, Computer Science
    Other Conferences
  • 1992
TLDR
The concept of deformation distance between manifolds is presented, a distance which measures the `difference in shape' of two manifolds and the link between deformation distances and size functions is pointed out.
Morse homology descriptor for shape characterization
  • M. Allili, D. Corriveau, D. Ziou
  • Computer Science
    Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.
  • 2004
TLDR
A new topological method for shape description is proposed that is suitable for any multi-dimensional data set that can be modelled as a manifold and Classical Morse theory is used to establish a link between the topology of a pair of lower level sets of f and its critical points lying between the two levels.
Describing shapes by geometrical-topological properties of real functions
TLDR
This survey is to provide a clear vision of what has been developed so far, focusing on methods that make use of theoretical frameworks that are developed for classes of real functions rather than for a single function, even if they are applied in a restricted manner.
Reparametrization invariant norms
This paper explores the concept of reparametrization invariant norm (RPI-norm) for C 1 functions that vanish at −∞ and whose derivative has compact support, such as C 1 c functions. An RPI-norm is
The Use of Size Functions for Comparison of Shapes Through Differential Invariants
TLDR
This study focuses on a projective differential invariant which allows to decide if one shape can be considered as the deformation of another one by a rotation of the camera.
On the use of size functions for shape analysis
TLDR
It is shown that the representation of shape in terms of size functions can be tailored to suit the invariance of the problem at hand and is stable against small qualitative and quantitative changes of the viewed shape.
Geometry Helps in Bottleneck Matching and Related Problems
TLDR
An O(n5log  n) -time algorithm for determining whether for some translated copy the resemblance gets below a given ρ is presented, thus improving the previous result of Alt, Mehlhorn, Wagener, and Welzl by a factor of almost n.
...
1
2
3
4
5
...