# Persistence barcodes for shapes

@article{Carlsson2004PersistenceBF,
title={Persistence barcodes for shapes},
author={Gunnar E. Carlsson and Afra Zomorodian and Anne D. Collins and Leonidas J. Guibas},
journal={Int. J. Shape Model.},
year={2004},
volume={11},
pages={149-188}
}
• Published 8 July 2004
• Mathematics, Computer Science
• Int. J. Shape Model.
In this paper, we initiate a study of shape description and classification via the application of persistent homology to two tangential constructions on geometric objects. Our techniques combine the differentiating power of geometry with the classifying power of topology. The homology of our first construction, the tangent complex, can distinguish between topologically identical shapes with different "sharp" features, such as corners. To capture "soft" curvature-dependent features, we define a…
209 Citations

## Figures from this paper

Homological illusions of persistence and stability
• Mathematics
• 2008
In this thesis we explore and extend the theory of persistent homology, which captures topological features of a function by pairing its critical values. The result is represented by a collection of
2008 BARCODES : THE PERSISTENT TOPOLOGY OF DATA
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data and sketches an application of these techniques to the classification of natural images.
Barcodes: The persistent topology of data
This article surveys recent work of Carlsson and collaborators on applications of computational algebraic topology to problems of feature detection and shape recognition in high-dimensional data. The
Moduli spaces of morse functions for persistence
• Mathematics
J. Appl. Comput. Topol.
• 2020
New invariants are introduced to study Morse functions on the sphere in the context of persistent homology and are as simple—but more discerning than—existing topological invariants, such as persistence barcodes and Reeb graphs.
Proximity of persistence modules and their diagrams
• Mathematics, Computer Science
SCG '09
• 2009
This paper presents new stability results that do not suffer from the restrictions of existing stability results, and makes it possible to compare the persistence diagrams of functions defined over different spaces, thus enabling a variety of new applications of the concept of persistence.
Computational Homology of cubical and permutahedral complexes
Homology is the study of connectivity and “holes” in spaces. The aim of this thesis is to introduce and develop a theory of permutahedral complexes for computations of homology of large data sets and
CUP PRODUCTS IN COMPUTATIONAL TOPOLOGY
Topological persistence methods provide a robust framework for analyzing large point cloud datasets topologically, and have been applied with great success towards homology computations on simplicial
A Sheaf and Topology Approach to Generating Local Branch Numbers in Digital Images
• Mathematics
ArXiv
• 2020
A theoretic framework that utilizes the sheaf theory to uncover finer information from the persistent homology (PH) is established and the proposed theory can be applied to identify the branch numbers of local objects in digital images.
Describing shapes by geometrical-topological properties of real functions
• Mathematics
CSUR
• 2008
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.
Invariance properties of the multidimensional matching distance in Persistent Topology and Homology
• Mathematics
ArXiv
• 2010
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.

## References

SHOWING 1-10 OF 48 REFERENCES
Computing persistent homology
• Mathematics, Computer Science
SCG '04
• 2004
The analysis establishes the existence of a simple description of persistent homology groups over arbitrary fields and derives an algorithm for computing individual persistent homological groups over an arbitrary principal ideal domain in any dimension.
Topological Persistence and Simplification
• Economics
Discret. Comput. Geom.
• 2002
Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.
FORMS: A flexible object recognition and modelling system
• Computer Science
International Journal of Computer Vision
• 2004
A model for generating the shapes of animate objects which gives a formalism for solving the inverse problem of object recognition and how such a representation scheme can be automatically learnt from examples is described.
Shape and Shape Theory
• Mathematics, Art
• 1999
Shapes and Shape Spaces. The Global Structure of Shape Spaces. Computing the Homology of Cell Complexes. A Chain Complex for Shape Spaces. The Homology Groups of Shape Spaces. Geodesics in Shape
The Nonlinear Statistics of High-Contrast Patches in Natural Images
This study explores the space of data points representing the values of 3 × 3 high-contrast patches from optical and 3D range images and finds that the distribution of data is extremely “sparse” with the majority of the data points concentrated in clusters and non-linear low-dimensional manifolds.
A geometric framework for sparse matrix problems
• Computer Science, Mathematics