Algorithms to automatically quantify the geometric similarity of anatomical surfaces

Abstract

We describe new approaches for distances between pairs of 2-dimensional surfaces (embedded in 3-dimensional space) that use local structures and global information contained in inter-structure geometric relationships. We present algorithms to automatically determine these distances as well as geometric correspondences. This is motivated by the aspiration of students of natural science to understand the continuity of form that unites the diversity of life. At present, scientists using physical traits to study evolutionary relationships among living and extinct animals analyze data extracted from carefully defined anatomical correspondence points (landmarks). Identifying and recording these landmarks is time consuming and can be done accurately only by trained morphologists. This renders these studies inaccessible to non-morphologists, and causes phenomics to lag behind genomics in elucidating evolutionary patterns. Unlike other algorithms presented for morphological correspondences our approach does not require any preliminary marking of special features or landmarks by the user. It also differs from other seminal work in computational geometry in that our algorithms are polynomial in nature and thus faster, making pairwise comparisons feasible for significantly larger numbers of digitized surfaces. We illustrate our approach using three datasets representing teeth and different bones of primates and humans, and show that it leads to highly accurate results.

Changes with respect to v1, v2: an Erratum was added, correcting the references for one of the three datasets. Note that the datasets and code for this paper can be obtained from the Data Conservancy (see Download column on v1, v2)

References in corpus (1)

• Conformal Wasserstein distances: comparing surfaces in polynomial time

Cited by in corpus (20)

• Imaging with Kantorovich-Rubinstein discrepancy
• Predicting Clinical Outcomes in Glioblastoma: An Application of Topological and Functional Data Analysis
• Multi-chart Generative Surface Modeling
• ariaDNE: A Robustly Implemented Algorithm for Dirichlet Energy of the Normal
• Connection graph Laplacian methods can be made robust to noise
• Shape analysis via inconsistent surface registration
• An Invitation to the Euler Characteristic Transform
• The Geometry of Synchronization Problems and Learning Group Actions
• A Data-driven Adversarial Examples Recognition Framework via Adversarial Feature Genome
• Randomness of Shapes and Statistical Inference on Shapes via the Smooth Euler Characteristic Transform
• MREC: a fast and versatile framework for aligning and matching point clouds with applications to single cell molecular data
• The Convergence of Discrete Uniformizations for Closed Surfaces
• The Diffusion Geometry of Fibre Bundles: Horizontal Diffusion Maps
• A Metric for genus-zero surfaces
• Computing Harmonic Maps and Conformal Maps on Point Clouds
• A curvature and density-based generative representation of shapes
• An Algorithm for Comparing Similarity Between Two Trees
• Hypoelliptic Diffusion Maps I: Tangent Bundles
• Distortion measure of spectrograms for classification of respiratory diseases
• Random Lie Brackets that Induce Torsion: A Model for Noisy Vector Fields