• Corpus ID: 232013910

The Persistent Homology of Dual Digital Image Constructions

  title={The Persistent Homology of Dual Digital Image Constructions},
  author={Beatrice Bleile and Ad'elie Garin and Teresa Heiss and K. A. R. Maggs and Vanessa Robins},
To compute the persistent homology of a grayscale digital image one needs to build a simplicial or cubical complex from it. For cubical complexes, the two commonly used constructions (corresponding to direct and indirect digital adjacencies) can give different results for the same image. The two constructions are almost dual to each other, and we use this relationship to extend and modify the cubical complexes to become dual filtered cell complexes. We derive a general relationship between the… 

Figures from this paper

A Convolutional Persistence Transform

—We consider a new topological feauturization of d - dimensional images, obtained by convolving images with various filters before computing persistence. Viewing a convolution filter as a motif within

The Impact of Changes in Resolution on the Persistent Homology of Images

The impact of changes in resolution on persistent homology, a tool from topological data analysis that provides a signature of structure in an image across all length scales, is studied.

Persistent Homology with Improved Locality Information for more Effective Delineation

It is experimentally demonstrate that deep networks trained with the Persistent-Homology-based loss yield reconstructions of road networks and neuronal processes that preserve the connectivity of the originals better than existing topological and non-topological loss functions.

Extending conventional surface roughness ISO parameters using topological data analysis for shot peened surfaces

The roughness of material surfaces is of greatest relevance for applications. These include wear, friction, fatigue, cytocompatibility, or corrosion resistance. Today’s descriptors of the

Euler Characteristic Curves and Profiles: a stable shape invariant for big data problems

It is shown that the Euler Curves and Profiles enjoys certain type of stability which makes them robust tool in data analysis, and practical applicability for big data problems.



Theory and Algorithms for Constructing Discrete Morse Complexes from Grayscale Digital Images

An algorithm for determining the Morse complex of a two or three-dimensional grayscale digital image that agrees with the digital image and has exactly the number and type of critical cells necessary to characterize the topological changes in the level sets is presented.

Computing Persistent Homology

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.

Extending Persistence Using Poincaré and Lefschetz Duality

An algebraic formulation is given that extends persistence to essential homology for any filtered space, an algorithm is presented to calculate it, and how it aids the ability to recognize shape features for codimension 1 submanifolds of Euclidean space is described.

Skeletonization and Partitioning of Digital Images Using Discrete Morse Theory

This paper defines basins and skeletons via Morse-theoretic cancellation of critical cells in the discrete gradient vector field using a strategy informed by persistent homology and proves the topological validity of these constructions.

Vines and vineyards by updating persistence in linear time

The main result of this paper is an algorithm that maintains the pairing in worst-case linear time per transposition in the ordering and uses the algorithm to compute 1-parameter families of diagrams which are applied to the study of protein folding trajectories.

Homological Algebra for Persistence Modules

It is shown that the graded module point of view produces a closed symmetric monoidal category that is enriched over itself, and a Gabriel–Popescu theorem for persistence modules is given.

Tri-partitions and Bases of an Ordered Complex

This work proves a combinatorial analog of the classic Helmholtz–Hodge decomposition of a smooth vector field, which is a partition of the set of p -cells into a maximal p -tree, a minimal p -cotree, and a collection of p-cells whose cardinality is the p -th reduced Betti number of K .

Finite topology as applied to image analysis

Homological algebra of modules over posets.

Homological algebra of modules over posets is developed, as closely parallel as possible to that of finitely generated modules over noetherian commutative rings, in the direction of finite

Cubical Ripser: Software for computing persistent homology of image and volume data

This work introduces Cubical Ripser, the fastest and the most memory-efficient program for computing persistent homology of weighted cubical complexes, and demonstrates the software with an example of image analysis in which persistent Homology and convolutional neural networks are successfully combined.