Barbara Di Fabio
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Barbara Di Fabio has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Claudia Landi
University of Modena and Reggio Emilia Italy
5 shared publications - Massimo Ferri
ARCES and Department of Mathematics, University of Bologna, 40126 Bologna, Italy
3 shared publications - Andrea Cerri
IMATI – CNR
2 shared publications - Francesca Cagliari
Univ Bologna, Dipartimento Matemat, Piazza Porta San Donato 5, I-40127 Bologna, Italy
1 shared publication - Patrizio Frosini
University of Pisa
1 shared publication
Latest Publications
- 21 August 2015
- Published by Springer Nature
- p. 294-305
Comparing Persistence Diagrams Through Complex Vectors
- 21 August 2015
- Published by Springer Nature
- p. 294-305
Comparing Persistence Diagrams Through Complex Vectors
- Open Access
Comparing persistence diagrams through complex vectors
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from combinatorial explosion. A possible algebraic representation of persistence diagrams is offered by complex polynomials; since far polynomials represent far persistence diagrams, a fast comparison of the coefficient vectors can reduce the size of the database to be classified by the bottleneck distance. This article explores experimentally three transformations from diagrams to polynomials and three distances between the complex vectors of coefficients.
Open AccessComparing persistence diagrams through complex vectors
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from combinatorial explosion. A possible algebraic representation of persistence diagrams is offered by complex polynomials; since far polynomials represent far persistence diagrams, a fast comparison of the coefficient vectors can reduce the size of the database to be classified by the bottleneck distance. This article explores experimentally three transformations from diagrams to polynomials and three distances between the complex vectors of coefficients.
- Open Access
The edit distance for Reeb graphs of surfaces
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost necessary to transform one graph into another by edit operations. The main contributions of this paper are the stability property and the optimality of this edit distance. More precisely, the stability result states that changes in the functions, measured by the maximum norm, imply not greater changes in the corresponding Reeb graphs, measured by the edit distance. The optimality result states that our edit distance discriminates Reeb graphs better than any other metric for Reeb graphs of surfaces satisfying the stability property.
Open AccessThe edit distance for Reeb graphs of surfaces
Reeb graphs are structural descriptors that capture shape properties of a topological space from the perspective of a chosen function. In this work we define a combinatorial metric for Reeb graphs of orientable surfaces in terms of the cost necessary to transform one graph into another by edit operations. The main contributions of this paper are the stability property and the optimality of this edit distance. More precisely, the stability result states that changes in the functions, measured by the maximum norm, imply not greater changes in the corresponding Reeb graphs, measured by the edit distance. The optimality result states that our edit distance discriminates Reeb graphs better than any other metric for Reeb graphs of surfaces satisfying the stability property.
- Open Access
- 16 April 2013
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 27 (3) , 1729-1742
The natural pseudo-distance as a quotient pseudo-metric, and applications
The natural pseudo-distance is a similarity measure conceived for the purpose of comparing shapes. In this paper we revisit this pseudo-metric from the point of view of quotients. In particular, we show that the natural pseudo-distance coincides with the quotient pseudo-metric on the space of continuous functions on a compact manifold, endowed with the uniform convergence metric, modulo self-homeomorphisms of the manifold. As applications of this result, the natural pseudo-distance is shown to be actually a metric on a number of function subspaces such as the space of topological embeddings, of isometries, and of simple Morse functions on surfaces.
- 16 April 2013
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 27 (3) , 1729-1742
Open AccessThe natural pseudo-distance as a quotient pseudo-metric, and applications
The natural pseudo-distance is a similarity measure conceived for the purpose of comparing shapes. In this paper we revisit this pseudo-metric from the point of view of quotients. In particular, we show that the natural pseudo-distance coincides with the quotient pseudo-metric on the space of continuous functions on a compact manifold, endowed with the uniform convergence metric, modulo self-homeomorphisms of the manifold. As applications of this result, the natural pseudo-distance is shown to be actually a metric on a number of function subspaces such as the space of topological embeddings, of isometries, and of simple Morse functions on surfaces.
- Top Cited Papers
- 17 January 2013
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 36 (12) , 1543-1557
Betti numbers in multidimensional persistent homology are stable functions
Multidimensional persistence mostly studies topological features of shapes by analyzing the lower level sets of vector‐valued functions, called filtering functions. As is well known, in the case of scalar‐valued filtering functions, persistent homology groups can be studied through their persistent Betti numbers, that is, the dimensions of the images of the homomorphisms induced by the inclusions of lower level sets into each other. Whenever such inclusions exist for lower level sets of vector‐valued filtering functions, we can consider the multidimensional analog of persistent Betti numbers. Varying the lower level sets, we obtain that persistent Betti numbers can be seen as functions taking pairs of vectors to the set of non‐negative integers. In this paper, we prove stability of multidimensional persistent Betti numbers. More precisely, we prove that small changes of the vector‐valued filtering functions imply only small changes of persistent Betti numbers functions. This result can be obtained by assuming the filtering functions to be just continuous. Multidimensional stability opens the way to a stable shape comparison methodology based on multidimensional persistence. In order to obtain our stability theorem, some other new results are proved for continuous filtering functions. They concern the finiteness of persistent Betti numbers for vector‐valued filtering functions and the representation via persistence diagrams of persistent Betti numbers, as well as their stability, in the case of scalar‐valued filtering functions. Finally, from the stability of multidimensional persistent Betti numbers, we obtain a lower bound for the natural pseudo‐distance. Copyright © 2013 John Wiley & Sons, Ltd.
- 17 January 2013
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 36 (12) , 1543-1557
Top Cited PapersBetti numbers in multidimensional persistent homology are stable functions
Multidimensional persistence mostly studies topological features of shapes by analyzing the lower level sets of vector‐valued functions, called filtering functions. As is well known, in the case of scalar‐valued filtering functions, persistent homology groups can be studied through their persistent Betti numbers, that is, the dimensions of the images of the homomorphisms induced by the inclusions of lower level sets into each other. Whenever such inclusions exist for lower level sets of vector‐valued filtering functions, we can consider the multidimensional analog of persistent Betti numbers. Varying the lower level sets, we obtain that persistent Betti numbers can be seen as functions taking pairs of vectors to the set of non‐negative integers. In this paper, we prove stability of multidimensional persistent Betti numbers. More precisely, we prove that small changes of the vector‐valued filtering functions imply only small changes of persistent Betti numbers functions. This result can be obtained by assuming the filtering functions to be just continuous. Multidimensional stability opens the way to a stable shape comparison methodology based on multidimensional persistence. In order to obtain our stability theorem, some other new results are proved for continuous filtering functions. They concern the finiteness of persistent Betti numbers for vector‐valued filtering functions and the representation via persistence diagrams of persistent Betti numbers, as well as their stability, in the case of scalar‐valued filtering functions. Finally, from the stability of multidimensional persistent Betti numbers, we obtain a lower bound for the natural pseudo‐distance. Copyright © 2013 John Wiley & Sons, Ltd.
- 24 May 2012
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 35 (12) , 1456-1471
Reeb graphs of curves are stable under function perturbations
- 24 May 2012
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 35 (12) , 1456-1471
Reeb graphs of curves are stable under function perturbations
- 10 December 2011
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 26 (6) , 1611-1628
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 defined on the spaces themselves. Roughly speaking, the natural pseudo-distance is defined as the infimum of the change of the functions' values, when moving from one space to the other through homeomorphisms, if possible. In this paper, we prove the first available result about the existence of optimal homeomorphisms between closed curves, i.e. inducing a change of the function that equals the natural pseudo-distance. Moreover, we show that, under our assumptions, this optimal homeomorphism is actually a diffeomorphism.
- 10 December 2011
- Published by Walter de Gruyter GmbH in Forum Mathematicum
- Vol. 26 (6) , 1611-1628
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 defined on the spaces themselves. Roughly speaking, the natural pseudo-distance is defined as the infimum of the change of the functions' values, when moving from one space to the other through homeomorphisms, if possible. In this paper, we prove the first available result about the existence of optimal homeomorphisms between closed curves, i.e. inducing a change of the function that equals the natural pseudo-distance. Moreover, we show that, under our assumptions, this optimal homeomorphism is actually a diffeomorphism.
- 7 September 2011
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 11 (5) , 499-527
A Mayer–Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions
- 7 September 2011
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 11 (5) , 499-527
A Mayer–Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions