Image Segmentation with Topological Priors
- URL: http://arxiv.org/abs/2205.06197v1
- Date: Thu, 12 May 2022 16:36:21 GMT
- Title: Image Segmentation with Topological Priors
- Authors: Shakir Showkat Sofi, Nadezhda Alsahanova
- Abstract summary: Solving segmentation tasks with topological priors proved to make fewer errors in fine-scale structures.
In this work, we use topological priors both before and during the deep neural network training procedure.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Solving segmentation tasks with topological priors proved to make fewer
errors in fine-scale structures. In this work, we use topological priors both
before and during the deep neural network training procedure. We compared the
results of the two approaches with simple segmentation on various accuracy
metrics and the Betti number error, which is directly related to topological
correctness, and discovered that incorporating topological information into the
classical UNet model performed significantly better. We conducted experiments
on the ISBI EM segmentation dataset.
Related papers
- Topologically faithful multi-class segmentation in medical images [43.6770098513581]
We propose a general loss function for topologically faithful multi-class segmentation.
We project the N-class segmentation problem to N single-class segmentation tasks.
Our loss formulation significantly enhances topological correctness in cardiac, cell, artery-vein, and Circle of Willis segmentation.
arXiv Detail & Related papers (2024-03-16T19:11:57Z) - Minimally Supervised Learning using Topological Projections in
Self-Organizing Maps [55.31182147885694]
We introduce a semi-supervised learning approach based on topological projections in self-organizing maps (SOMs)
Our proposed method first trains SOMs on unlabeled data and then a minimal number of available labeled data points are assigned to key best matching units (BMU)
Our results indicate that the proposed minimally supervised model significantly outperforms traditional regression techniques.
arXiv Detail & Related papers (2024-01-12T22:51:48Z) - On Characterizing the Evolution of Embedding Space of Neural Networks
using Algebraic Topology [9.537910170141467]
We study how the topology of feature embedding space changes as it passes through the layers of a well-trained deep neural network (DNN) through Betti numbers.
We demonstrate that as depth increases, a topologically complicated dataset is transformed into a simple one, resulting in Betti numbers attaining their lowest possible value.
arXiv Detail & Related papers (2023-11-08T10:45:12Z) - Topological Data Analysis Guided Segment Anything Model Prompt
Optimization for Zero-Shot Segmentation in Biological Imaging [5.795215830149858]
We propose topological data analysis guided prompt optimization for the Segment Anything Model (SAM)
Our results show that the TDA optimized point cloud is much better suited for finding small objects and massively reduces computational complexity.
arXiv Detail & Related papers (2023-06-30T05:00:38Z) - Amortized Inference for Causal Structure Learning [72.84105256353801]
Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test.
We train a variational inference model to predict the causal structure from observational/interventional data.
Our models exhibit robust generalization capabilities under substantial distribution shift.
arXiv Detail & Related papers (2022-05-25T17:37:08Z) - TA-Net: Topology-Aware Network for Gland Segmentation [71.52681611057271]
We propose a novel topology-aware network (TA-Net) to accurately separate densely clustered and severely deformed glands.
TA-Net has a multitask learning architecture and enhances the generalization of gland segmentation.
It achieves state-of-the-art performance on the two datasets.
arXiv Detail & Related papers (2021-10-27T17:10:58Z) - Information-Theoretic Generalization Bounds for Iterative
Semi-Supervised Learning [81.1071978288003]
In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles.
Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
arXiv Detail & Related papers (2021-10-03T05:38:49Z) - Learning Neural Causal Models with Active Interventions [83.44636110899742]
We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process.
Our method significantly reduces the required number of interactions compared with random intervention targeting.
We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
arXiv Detail & Related papers (2021-09-06T13:10:37Z) - Topological Similarity Index and Loss Function for Blood Vessel
Segmentation [0.0]
We propose a similarity index which captures the consistency of the predicted segmentations having as reference the ground truth.
We also design a novel loss function based on the morphological closing operator and show how it allows to learn deep neural network models which produce more topologically coherent masks.
arXiv Detail & Related papers (2021-07-30T10:24:47Z) - Topology-Aware Segmentation Using Discrete Morse Theory [38.65353702366932]
We propose a new approach to train deep image segmentation networks for better topological accuracy.
We identify global structures, including 1D skeletons and 2D patches, which are important for topological accuracy.
On diverse datasets, our method achieves superior performance on both the DICE score and topological metrics.
arXiv Detail & Related papers (2021-03-18T02:47:21Z) - Towards Robust Partially Supervised Multi-Structure Medical Image
Segmentation on Small-Scale Data [123.03252888189546]
We propose Vicinal Labels Under Uncertainty (VLUU) to bridge the methodological gaps in partially supervised learning (PSL) under data scarcity.
Motivated by multi-task learning and vicinal risk minimization, VLUU transforms the partially supervised problem into a fully supervised problem by generating vicinal labels.
Our research suggests a new research direction in label-efficient deep learning with partial supervision.
arXiv Detail & Related papers (2020-11-28T16:31:00Z)
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.