Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-23T15:24:29.741Z Has data issue: false hasContentIssue false

GEOMETRIC AND TOPOLOGICAL SHAPE ANALYSIS: INVESTIGATING AND SUMMARISING THE SHAPE OF DATA

Published online by Cambridge University Press:  15 September 2023

YOSSI BOKOR BLEILE*
Affiliation:
Department of Mathematical Sciences, Aalborg University, Aalborg Øst 9220, Denmark and School of Mathematics and Statistics, The University of Sydney, Camperdown, NSW 2006, Australia
Rights & Permissions [Opens in a new window]

Abstract

Type
PhD Abstract
Copyright
© The Author(s), 2023. Published by Cambridge University Press on behalf of Australian Mathematical Publishing Association Inc.

Tools from geometry and topology can be applied in a wide variety of settings. In particular, they are adept at exploring and summarising the shape of data. By considering the shape of objects, we can answer questions related to object reconstruction and classification problems. These problems often face difficulty distinguishing signals from noise, which can be overcome using ideas from persistent homology and computational geometry.

This thesis can be split into two parts, with Chapters 1 and 2 forming the first, and Chapter 3 the second. We first look at an application of geometry and topology to learning the abstract structure of embedded stratified spaces and then consider an object classification problem relating to human mesenchymal stem cells. Chapter 1 presents an algorithm for learning the abstract structure underlying an embedded graph $|G| \subset \mathbb {R}^n$ given an $\varepsilon $ -sample P of $|G|$ , as well as a method for modelling the embedding (see [Reference Bokor, Turner and Williams2]). Learning the abstract structure is extended to embedded 2-complexes $|X| \subset \mathbb {R}^n$ from $\varepsilon $ -samples P in Chapter 2. Chapter 3 is a change in topic and pace, exploring the use of persistent homology and persistence diagrams to identify abnormal growth patterns in cultured human mesenchymal stem cells.

While these topics seem disconnected, they can be considered two sides of the same dice. In both settings, we are using tools from geometry and topology to understand the shape of the data at hand. In Chapters 1 and 2 the end goal is to understand the abstract structure underlying a point cloud, while in Chapter 3 we use shape to identify subpopulations.

People familiar with topological data analysis, computational topology and computational geometry will notice that Chapters 1 and 2 are centred on results that could be considered purely problems in computational geometry. This is in part because when working with data sets, topological data analysis often becomes computational geometry. In particular, this occurs when we care about the extrinsic structure of the data within the ambient space, rather than just the intrinsic topology and geometry. Exploring the computational geometry aspects of these problems comes with benefits as well as costs. While we are able to develop an algorithm that is more efficient in terms of time complexity, often the associated proofs about its correctness are, to quote a supervisor, ‘gross’. This grossness stems from the expressions which bound distances between various objects, as they do not simplify to a ‘nice, neat expression’. These expressions could be approximated to become ‘nicer’, without affecting the proofs, but then the assumptions placed upon our underlying spaces become stricter.

Chapter 3 explores the use of geometric and topological tools to understand growth patterns in human mesenchymal stem cells (see [Reference Bleile1]). In particular, we use morphological features of the cells to identify subgroups within experimental conditions. By identifying the subpopulations, we are able to clean the data when investigating the impact of environmental conditions on multi-potent cells in the future, as well as potentially having an unbiased method for identifying unipotent cells. The cells were purchased, cultured and imaged by Dr Florian Rehfeldt (Bayreuth University).

Footnotes

Thesis submitted to the Australian National University and the University of Sydney in October 2022; degree approved on 27 March 2023; supervisors Katharine Turner, Vigleik Angeltveit, Vanessa Robins, Stephan Tillmann and Jonathan Spreer.

References

Bleile, Y. B., ‘Towards stratified space learning: 2-complexes’, Preprint, 2023, arXiv:2305.02724.Google Scholar
Bokor, Y., Turner, K. and Williams, C., ‘Reconstructing linearly embedded graphs: a first step to stratified space learning’, Found. Data Sci. 4(4) (2022), 537561.CrossRefGoogle Scholar