A Sheaf and Topology Approach to Generating Local Branch Numbers in
Digital Images
- URL: http://arxiv.org/abs/2011.13580v2
- Date: Thu, 3 Dec 2020 02:43:38 GMT
- Title: A Sheaf and Topology Approach to Generating Local Branch Numbers in
Digital Images
- Authors: Chuan-Shen Hu, Yu-Min Chung
- Abstract summary: This paper concerns a theoretical approach that combines topological data analysis (TDA) and sheaf theory.
Sheaf theory provides a framework for describing the local consistency in geometric objects.
We show that the proposed theory can be applied to identify the branch numbers of local objects in digital images.
- Score: 9.645196221785694
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: This paper concerns a theoretical approach that combines topological data
analysis (TDA) and sheaf theory. Topological data analysis, a rising field in
mathematics and computer science, concerns the shape of the data and has been
proven effective in many scientific disciplines. Sheaf theory, a mathematics
subject in algebraic geometry, provides a framework for describing the local
consistency in geometric objects. Persistent homology (PH) is one of the main
driving forces in TDA, and the idea is to track changes of geometric objects at
different scales. The persistence diagram (PD) summarizes the information of PH
in the form of a multi-set. While PD provides useful information about the
underlying objects, it lacks fine relations about the local consistency of
specific pairs of generators in PD, such as the merging relation between two
connected components in the PH. The sheaf structure provides a novel point of
view for describing the merging relation of local objects in PH. It is the goal
of this paper to establish a theoretic framework that utilizes the sheaf theory
to uncover finer information from the PH. We also show that the proposed theory
can be applied to identify the branch numbers of local objects in digital
images.
Related papers
- Learning Discrete Concepts in Latent Hierarchical Models [73.01229236386148]
Learning concepts from natural high-dimensional data holds potential in building human-aligned and interpretable machine learning models.
We formalize concepts as discrete latent causal variables that are related via a hierarchical causal model.
We substantiate our theoretical claims with synthetic data experiments.
arXiv Detail & Related papers (2024-06-01T18:01:03Z) - A Survey of Geometric Graph Neural Networks: Data Structures, Models and
Applications [67.33002207179923]
This paper presents a survey of data structures, models, and applications related to geometric GNNs.
We provide a unified view of existing models from the geometric message passing perspective.
We also summarize the applications as well as the related datasets to facilitate later research for methodology development and experimental evaluation.
arXiv Detail & Related papers (2024-03-01T12:13:04Z) - A Hitchhiker's Guide to Geometric GNNs for 3D Atomic Systems [87.30652640973317]
Recent advances in computational modelling of atomic systems represent them as geometric graphs with atoms embedded as nodes in 3D Euclidean space.
Geometric Graph Neural Networks have emerged as the preferred machine learning architecture powering applications ranging from protein structure prediction to molecular simulations and material generation.
This paper provides a comprehensive and self-contained overview of the field of Geometric GNNs for 3D atomic systems.
arXiv Detail & Related papers (2023-12-12T18:44:19Z) - Topological Parallax: A Geometric Specification for Deep Perception
Models [0.778001492222129]
We introduce topological parallax as a theoretical and computational tool that compares a trained model to a reference dataset.
Our examples show that this geometric similarity between dataset and model is essential to trustworthy and perturbation.
This new concept will add value to the current debate regarding the unclear relationship between overfitting and generalization in applications of deep-learning.
arXiv Detail & Related papers (2023-06-20T18:45:24Z) - Geometric Relational Embeddings: A Survey [39.57716353191535]
We survey methods that underly geometric relational embeddings and categorize them based on the embedding geometries that are used to represent the data.
We identify the desired properties (i.e., inductive biases) of each kind of embedding and discuss some potential future work.
arXiv Detail & Related papers (2023-04-24T09:33:30Z) - Investigating the Role of Centering Theory in the Context of Neural
Coreference Resolution Systems [71.57556446474486]
We investigate the connection between centering theory and modern coreference resolution systems.
We show that high-quality neural coreference resolvers may not benefit much from explicitly modeling centering ideas.
We formulate a version of CT that also models recency and show that it captures coreference information better compared to vanilla CT.
arXiv Detail & Related papers (2022-10-26T12:55:26Z) - Reproducing Kernels and New Approaches in Compositional Data Analysis [0.0]
Analyzing compositional data such as human gut microbiomes needs a careful treatment of the geometry of the data.
In this work, based on the key observation that a compositional data are projective in nature, we re-interpret the compositional domain as the quotient topology of a sphere out by a group action.
This construction of RKHS for compositional data will widely open research avenues for future methodology developments.
arXiv Detail & Related papers (2022-05-02T18:46:23Z) - PTR: A Benchmark for Part-based Conceptual, Relational, and Physical
Reasoning [135.2892665079159]
We introduce a new large-scale diagnostic visual reasoning dataset named PTR.
PTR contains around 70k RGBD synthetic images with ground truth object and part level annotations.
We examine several state-of-the-art visual reasoning models on this dataset and observe that they still make many surprising mistakes.
arXiv Detail & Related papers (2021-12-09T18:59:34Z) - Inter-layer Information Similarity Assessment of Deep Neural Networks
Via Topological Similarity and Persistence Analysis of Data Neighbour
Dynamics [93.4221402881609]
The quantitative analysis of information structure through a deep neural network (DNN) can unveil new insights into the theoretical performance of DNN architectures.
Inspired by both LS and ID strategies for quantitative information structure analysis, we introduce two novel complimentary methods for inter-layer information similarity assessment.
We demonstrate their efficacy in this study by performing analysis on a deep convolutional neural network architecture on image data.
arXiv Detail & Related papers (2020-12-07T15:34:58Z) - Representations, Metrics and Statistics For Shape Analysis of Elastic
Graphs [21.597624908203805]
This paper introduces a far-reaching geometric approach for analyzing shapes of graphical objects, such as road networks, blood vessels, brain fiber tracts, etc.
It represents such objects, exhibiting differences in both geometries and topologies, as graphs made of curves with arbitrary shapes (edges) and connected at arbitrary junctions (nodes)
arXiv Detail & Related papers (2020-02-29T16:07:48Z) - Information geometry in quantum field theory: lessons from simple
examples [0.0]
We show that the symmetries of the physical theory under study play a strong role in the resulting geometry.
We discuss the differences that result from placing a metric on the space of theories vs. states.
We clarify some misconceptions in the literature pertaining to different notions of flatness associated to metric and non-metric connections.
arXiv Detail & Related papers (2020-01-08T19:00:01Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.