SearcharxivSearch

arXiv subjects

Vanessa Robins

Publications and source records attributed to Vanessa Robins.

15 recordsLinked to original sources

Computing extended persistent homology of radial distance filtrations of Euclidean shapes

We study the extended persistent homology of the radial filtration of a shape $M\subseteq \mathbb{R}^n$. A radial filtration is formed by choosing a center point $c$ and taking points of $M$ within distance $r$ of $c$. We show that, under mild assumptions, we can recover the radial extended persistence of a manifold with boundary from the radial persistence of its boundary. We also establish algorithms to compute radial extended persistence when $M$ is a set of pixels in a 2D digital grid. The methods are similar to those used to compute the extended persistent homology of a height filtration of a shape embedded in Euclidean space. We envisage these results will be useful in biomedical image analysis settings where it is natural to consider a radial filtration with respect to a fixed center, for example in the study of neuronal structures.

math.AT

The distilled Vietoris Rips filtration for persistent homology and a new memory efficient algorithm

The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of these computations. It presents a new construction, the distilled Vietoris Rips filtration, and proves that its persistent homology is isomorphic to that of standard Vietoris Rips. The distilled complex is constructed using a discrete Morse vector field defined on the reduced Vietoris Rips complex. The algorithm for building and reducing the distilled filtration boundary matrix is highly parallelisable and memory efficient. It can be implemented for point clouds in any metric space given the pairwise distance matrix.

math.AT

Automatic classification of magnetic field lines by persistent homology

A method for the automatic classification of the orbits of magnetic field lines into topologically distinct classes using the Vietoris-Rips persistent homology is presented. The input to the method is the Poincare map orbits of field lines and the output is a separation into three classes: islands, chaotic layers, and invariant tori. The classification is tested numerically for the case of a toy model of a perturbed tokamak represented initially in its geometric coordinates. The persistent $H_1$ data is demonstrated to be sufficient to distinguish magnetic islands from the other orbits. When combined with persistent $H_0$ information, describing the average spacing between points on the Poincare section, the larger chaotic orbits can then be separated from very thin chaotic layers and invariant tori. It is then shown that if straight field line coordinates exist for a nearby integrable field configuration, the performance of the classification can be improved by transforming into this natural coordinate system. The focus is the application to toroidal magnetic confinement but the method is sufficiently general to apply to generic $1\frac{1}{2}$d Hamiltonian systems.

physics.plasm-ph

Planar Symmetry Detection and Quantification using the Extended Persistent Homology Transform

Symmetry is ubiquitous throughout nature and can often give great insights into the formation, structure and stability of objects studied by mathematicians, physicists, chemists and biologists. However, perfect symmetry occurs rarely so quantitative techniques must be developed to identify approximate symmetries. To facilitate the analysis of an independent variable on the symmetry of some object, we would like this quantity to be a smoothly varying real parameter rather than a boolean one. The extended persistent homology transform is a recently developed tool which can be used to define a distance between certain kinds of objects. Here, we describe how the extended persistent homology transform can be used to visualise, detect and quantify certain kinds of symmetry and discuss the effectiveness and limitations of this method.

math.AT

The Extended Persistent Homology Transform of manifolds with boundary

The Extended Persistent Homology Transform (XPHT) is a topological transform which takes as input a shape embedded in Euclidean space, and to each unit vector assigns the extended persistence module of the height function over that shape with respect to that direction. We can define a distance between two shapes by integrating over the sphere the distance between their respective extended persistence modules. By using extended persistence we get finite distances between shapes even when they have different Betti numbers. We use Morse theory to show that the extended persistence of a height function over a manifold with boundary can be deduced from the extended persistence for that height function restricted to the boundary, alongside labels on the critical points as positive or negative critical. We study the application of the XPHT to binary images; outlining an algorithm for efficient calculation of the XPHT exploiting relationships between the PHT of the boundary curves to the extended persistence of the foreground.

math.AT

Quantifying the homology of periodic cell complexes

A periodic cell complex, $K$, has a finite representation as the quotient space, $q(K)$, consisting of equivalence classes of cells identified under the translation group acting on $K$. We study how the Betti numbers and cycles of $K$ are related to those of $q(K)$, first for the case that $K$ is a graph, and then higher-dimensional cell complexes. When $K$ is a $d$-periodic graph, it is possible to define $\mathbb{Z}^d$-weights on the edges of the quotient graph and this information permits full recovery of homology generators for $K$. The situation for higher-dimensional cell complexes is more subtle and studied in detail using the Mayer-Vietoris spectral sequence.

math.AT

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

Digital images enable quantitative analysis of material properties at micro and macro length scales, but choosing an appropriate resolution when acquiring the image is challenging. A high resolution means longer image acquisition and larger data requirements for a given sample, but if the resolution is too low, significant information may be lost. This paper studies 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. Given prior information about a function, the geometry of an object, or its density distribution at a given resolution, we provide methods to select the coarsest resolution yielding results within an acceptable tolerance. We present numerical case studies for an illustrative synthetic example and samples from porous materials where the theoretical bounds are unknown.

cs.CG

The Persistent Homology of Dual Digital Image Constructions

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 persistent homology of two dual filtered cell complexes, and also establish how various modifications to a filtered complex change the persistence diagram. Applying these results to images, we derive a method to transform the persistence diagram computed using one type of cubical complex into a persistence diagram for the other construction. This means software for computing persistent homology from images can now be easily adapted to produce results for either of the two cubical complex constructions without additional low-level code implementation.

math.AT

Duality in Persistent Homology of Images

We derive the relationship between the persistent homology barcodes of two dual filtered CW complexes. Applied to greyscale digital images, we obtain an algorithm to convert barcodes between the two different (dual) topological models of pixel connectivity.

math.AT

Tiling the Euclidean and Hyperbolic planes with ribbons

We describe a method to classify crystallographic tilings of the Euclidean and hyperbolic planes by tiles whose stabiliser group contains translation isometries or whose topology is not that of a closed disk. We tackle this problem from two different viewpoints, one with constructive techniques to enumerate such tilings and the other from a viewpoint of classification. The methods are purely topological and generalise Delaney-Dress combinatorial tiling theory. The classification is up to equivariant equivalence and is achieved by viewing tilings as decorations of orbifolds.

math.GT

The most symmetric surfaces in the 3-torus

Suppose an orientation preserving action of a finite group $G$ on the closed surface $Σ_g$ of genus $g>1$ extends over the 3-torus $T^3$ for some embedding $Σ_g\subset T^3$. Then $|G|\le 12(g-1)$, and this upper bound $12(g-1)$ can be achieved for $g=n^2+1, 3n^2+1, 2n^3+1, 4n^3+1, 8n^3+1, n\in \mathbb{Z}_+$. Those surfaces in $T^3$ realizing the maximum symmetries can be either unknotted or knotted. Similar problems in non-orientable category is also discussed. Connection with minimal surfaces in $T^3$ is addressed and when the maximum symmetric surfaces above can be realized by minimal surfaces is identified.

math.GT

Principal Component Analysis of Persistent Homology Rank Functions with case studies of Spatial Point Patterns, Sphere Packing and Colloids

Persistent homology, while ostensibly measuring changes in topology, captures multiscale geometrical information. It is a natural tool for the analysis of point patterns. In this paper we explore the statistical power of the (persistent homology) rank functions. For a point pattern $X$ we construct a filtration of spaces by taking the union of balls of radius $a$ centered on points in $X$, $X_a = \cup_{x\in X}B(x,a)$. The rank function $β_k(X):{\{(a,b)\in \mathbb{R}^2: a\leq b\}} \to \mathbb{R}$ is then defined by $β_k(X)(a,b) = rank ( ι_*:H_k(X_a) \to H_k(X_b))$ where $ι_*$ is the induced map on homology from the inclusion map on spaces. We consider the rank functions as lying in a Hilbert space and show that under reasonable conditions the rank functions from multiple simulations or experiments will lie in an affine subspace. This enables us to perform functional principal component analysis which we apply to experimental data from colloids at different effective temperatures and of sphere packings with different volume fractions. We also investigate the potential of rank functions in providing a test of complete spatial randomness of 2D point patterns using the distances to an empirically computed mean rank function of binomial point patterns in the unit square.

math.ST

Algebraic Topology

The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology, including persistent homology.

math-ph

Betti number signatures of homogeneous Poisson point processes

The Betti numbers are fundamental topological quantities that describe the k-dimensional connectivity of an object: B_0 is the number of connected components and B_k effectively counts the number of k-dimensional holes. Although they are appealing natural descriptors of shape, the higher-order Betti numbers are more difficult to compute than other measures and so have not previously been studied per se in the context of stochastic geometry or statistical physics. As a mathematically tractable model, we consider the expected Betti numbers per unit volume of Poisson-centred spheres with radius alpha. We present results from simulations and derive analytic expressions for the low intensity, small radius limits of Betti numbers in one, two, and three dimensions. The algorithms and analysis depend on alpha-shapes, a construction from computational geometry that deserves to be more widely known in the physics community.

math-ph