arXiv subjects

Anna Song

Publications and source records attributed to Anna Song.

7 recordsLinked to original sources

arXiv2024

A Topological Gaussian Mixture Model for Bone Marrow Morphology in Leukaemia

Acute myeloid leukaemia (AML) is a type of blood and bone marrow cancer characterized by the proliferation of abnormal clonal haematopoietic cells in the bone marrow leading to bone marrow failure. Over the course of the disease, angiogenic factors released by leukaemic cells drastically alter the bone marrow vascular niches resulting in observable structural abnormalities. We use a technique from topological data analysis - persistent homology - to quantify the images and infer on the disease through the imaged morphological features. We find that persistent homology uncovers succinct dissimilarities between the control, early, and late stages of AML development. We then integrate persistent homology into stage-dependent Gaussian mixture models for the first time, proposing a new class of models which are applicable to persistent homology summaries and able to both infer patterns in morphological changes between different stages of progression as well as provide a basis for prediction.

stat.AP↗

arXiv2023

Generalized Morse Theory of Distance Functions to Surfaces for Persistent Homology

This paper brings together three distinct theories with the goal of quantifying shape textures with complex morphologies. Distance fields are central objects in shape representation, while topological data analysis uses algebraic topology to characterize geometric and topological patterns in shapes. The most well-known and widely applied tool from this approach is persistent homology, which tracks the evolution of topological features in a dynamic manner as a barcode. Morse theory is a framework from differential topology that studies critical points of functions on manifolds; it has been used to characterize the birth and death of persistent homology features. However, a significant limitation to Morse theory is that it cannot be readily applied to distance functions because distance functions lack smoothness, which is required in Morse theory. Our contributions to addressing this issue is two fold. First, we generalize Morse theory to Euclidean distance functions of bounded sets with smooth boundaries. We focus in particular on distance fields for shape representation and we study the persistent homology of shape textures using a sublevel set filtration induced by the signed distance function. We use transversality theory to prove that for generic embeddings of a smooth compact surface in $\mathbb{R}^3$, signed distance functions admit finitely many non-degenerate critical points. This gives rise to our second contribution, which is that shapes and textures can both now be quantified and rigorously characterized in the language of persistent homology: signed distance persistence modules of generic shapes admit a finite barcode decomposition whose birth and death points can be classified and described geometrically. We use this approach to quantify shape textures on both simulated data and real vascular data from biology.

math.AT↗

arXiv2022

Fast Topological Signal Identification and Persistent Cohomological Cycle Matching

Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are important and useful inferential tasks in many applications. The limitation of existing solutions to these problems, however, is computational speed. In this paper, we harness the state-of-the-art for persistent homology computation by studying the problem of determining topological prevalence and cycle matching using a cohomological approach, which increases their feasibility and applicability to a wider variety of applications and contexts. We demonstrate this on a wide range of real-life, large-scale, and complex datasets. We extend existing notions of topological prevalence and cycle matching to include general non-Morse filtrations. This provides the most general and flexible state-of-the-art adaptation of topological signal identification and persistent cycle matching, which performs comparisons of orders of ten for thousands of sampled points in a matter of minutes on standard institutional HPC CPU facilities.

math.AT↗

arXiv2021

Spatial and color hallucinations in a mathematical model of primary visual cortex

We study a simplified model of the representation of colors in the primate primary cortical visual area V1. The model is described by an initial value problem related to a Hammerstein equation. The solutions to this problem represent the variation of the activity of populations of neurons in V1 as a function of space and color. The two space variables describe the spatial extent of the cortex while the two color variables describe the hue and the saturation represented at every location in the cortex. We prove the well-posedness of the initial value problem. We focus on its stationary, i.e. independent of time, and periodic in space solutions. We show that the model equation is equivariant with respect to the direct product G of the group of the Euclidean transformations of the planar lattice determined by the spatial periodicity and the group of color transformations, isomorphic to O(2), and study the equivariant bifurcations of its stationary solutions when some parameters in the model vary. Their variations may be caused by the consumption of drugs and the bifurcated solutions may represent visual hallucinations in space and color. Some of the bifurcated solutions can be determined by applying the Equivariant Branching Lemma (EBL) by determining the axial subgroups of G . These define bifurcated solutions which are invariant under the action of the corresponding axial subgroup. We compute analytically these solutions and illustrate them as color images. Using advanced methods of numerical bifurcation analysis we then explore the persistence and stability of these solutions when varying some parameters in the model. We conjecture that we can rely on the EBL to predict the existence of patterns that survive in large parameter domains but not to predict their stability. On our way we discover the existence of spatially localized stable patterns through the phenomenon of "snaking".

q-bio.NC↗

arXiv2021

Generation of tubular and membranous shape textures with curvature functionals

Tubular and membranous shapes display a wide range of morphologies that are difficult to analyze within a common framework. By generalizing the classical Helfrich energy of biomembranes, we model them as solutions to a curvature optimization problem in which the principal curvatures may play asymmetric roles. We then give a novel phase-field formulation to approximate this geometric problem, and study its Gamma-limsup convergence. This results in an efficient GPU algorithm that we validate on well-known minimizers of the Willmore energy; the software for the implementation of our algorithm is freely available online. Exploring the space of parameters reveals that this comprehensive framework leads to a wide continuum of shape textures. This first step towards a unifying theory will have several implications, in biology for quantifying tubular shapes or designing bio-mimetic scaffolds, but also in computer graphics or architecture.

q-bio.QM↗

arXiv2019

Dictionary Learning for Two-Dimensional Kendall Shapes

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplicity and faithfulness with respect to the nonlinear geometric structure of Kendall's shape space. Remarkably, it boils down to a classical dictionary learning formulation modified using complex weights. Existing dictionary learning methods extended to nonlinear spaces either map the manifold to a reproducing kernel Hilbert space or to a tangent space. The first approach is unnecessarily heavy in the case of Kendall's shape space and causes the geometrical understanding of shapes to be lost, while the second one induces distortions and theoretical complexity. Our approach does not suffer from these drawbacks. Instead of embedding the shape space into a linear space, we rely on the hyperplane of centered configurations, including pre-shapes from which shapes are defined as rotation orbits. In this linear space, the dictionary atoms are scaled and rotated using complex weights before summation. Furthermore, our formulation is more general than Kendall's original one: it applies to discretely-defined configurations of landmarks as well as continuously-defined interpolating curves. We implemented our algorithm by adapting the method of optimal directions combined to a Cholesky-optimized order recursive matching pursuit. An interesting feature of our shape dictionary is that it produces visually realistic atoms, while guaranteeing reconstruction accuracy. Its efficiency can mostly be attributed to a clear formulation of the framework with complex numbers. We illustrate the strong potential of our approach for the characterization of datasets of shapes up to similitudes and the analysis of patterns in deforming 2D shapes.

eess.IV↗

arXiv2018

A neural field model for color perception unifying assimilation and contrast

We address the question of color-space interactions in the brain, by proposing a neural field model of color perception with spatial context for the visual area V1 of the cortex. Our framework reconciles two opposing perceptual phenomena, known as simultaneous contrast and chromatic assimilation. They have been previously shown to act synergistically, so that at some point in an image, the color seems perceptually more similar to that of adjacent neighbors, while being more dissimilar from that of remote ones. Thus, their combined effects are enhanced in the presence of a spatial pattern, and can be measured as larger shifts in color matching experiments. Our model supposes a hypercolumnar structure coding for colors in V1, and relies on the notion of color opponency introduced by Hering. The connectivity kernel of the neural field exploits the balance between attraction and repulsion in color and physical spaces, so as to reproduce the sign reversal in the influence of neighboring points. The color sensation at a point, defined from a steady state of the neural activities, is then extracted as a nonlinear percept conveyed by an assembly of neurons. It connects the cortical and perceptual levels, because we describe the search for a color match in asymmetric matching experiments as a mathematical projection on color sensations. We validate our color neural field alongside this color matching framework, by performing a multi-parameter regression to data produced by psychophysicists and ourselves. All the results show that we are able to explain the nonlinear behavior of shifts observed along one or two dimensions in color space, which cannot be done using a simple linear model.

q-bio.NC↗