TA-Net: Topology-Aware Network for Gland Segmentation
- URL: http://arxiv.org/abs/2110.14593v1
- Date: Wed, 27 Oct 2021 17:10:58 GMT
- Title: TA-Net: Topology-Aware Network for Gland Segmentation
- Authors: Haotian Wang, Min Xian, Aleksandar Vakanski
- Abstract summary: 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.
- Score: 71.52681611057271
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Gland segmentation is a critical step to quantitatively assess the morphology
of glands in histopathology image analysis. However, it is challenging to
separate densely clustered glands accurately. Existing deep learning-based
approaches attempted to use contour-based techniques to alleviate this issue
but only achieved limited success. To address this challenge, we propose a
novel topology-aware network (TA-Net) to accurately separate densely clustered
and severely deformed glands. The proposed TA-Net has a multitask learning
architecture and enhances the generalization of gland segmentation by learning
shared representation from two tasks: instance segmentation and gland topology
estimation. The proposed topology loss computes gland topology using gland
skeletons and markers. It drives the network to generate segmentation results
that comply with the true gland topology. We validate the proposed approach on
the GlaS and CRAG datasets using three quantitative metrics, F1-score,
object-level Dice coefficient, and object-level Hausdorff distance. Extensive
experiments demonstrate that TA-Net achieves state-of-the-art performance on
the two datasets. TA-Net outperforms other approaches in the presence of
densely clustered glands.
Related papers
- DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland
Instance Segmentation [1.907126872483548]
We propose a displacement-field assisted graph energy transmitter (DFGET) framework to solve these problems.
Specifically, a novel message passing manner based on anisotropic diffusion is developed to update the node features.
With the constraint of DF, a graph cluster module based on diffusion theory is presented to improve the intra-class feature consistency.
arXiv Detail & Related papers (2023-12-11T01:42:10Z) - Interpolation-based Correlation Reduction Network for Semi-Supervised
Graph Learning [49.94816548023729]
We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN)
In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries.
By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
arXiv Detail & Related papers (2022-06-06T14:26:34Z) - Deep Multi-Scale U-Net Architecture and Noise-Robust Training Strategies
for Histopathological Image Segmentation [6.236433671063744]
We propose to explicitly add multi-scale feature maps in each convolutional module of the U-Net encoder to improve segmentation of histology images.
In experiments on a private dataset of breast cancer lymph nodes, we observed substantial improvement over a U-Net baseline based on the two proposed augmentations.
arXiv Detail & Related papers (2022-05-03T21:00:44Z) - Self-Ensembling GAN for Cross-Domain Semantic Segmentation [107.27377745720243]
This paper proposes a self-ensembling generative adversarial network (SE-GAN) exploiting cross-domain data for semantic segmentation.
In SE-GAN, a teacher network and a student network constitute a self-ensembling model for generating semantic segmentation maps, which together with a discriminator, forms a GAN.
Despite its simplicity, we find SE-GAN can significantly boost the performance of adversarial training and enhance the stability of the model.
arXiv Detail & Related papers (2021-12-15T09:50:25Z) - 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) - An Uncertainty-Driven GCN Refinement Strategy for Organ Segmentation [53.425900196763756]
We propose a segmentation refinement method based on uncertainty analysis and graph convolutional networks.
We employ the uncertainty levels of the convolutional network in a particular input volume to formulate a semi-supervised graph learning problem.
We show that our method outperforms the state-of-the-art CRF refinement method by improving the dice score by 1% for the pancreas and 2% for spleen.
arXiv Detail & Related papers (2020-12-06T18:55:07Z) - Pairwise Relation Learning for Semi-supervised Gland Segmentation [90.45303394358493]
We propose a pairwise relation-based semi-supervised (PRS2) model for gland segmentation on histology images.
This model consists of a segmentation network (S-Net) and a pairwise relation network (PR-Net)
We evaluate our model against five recent methods on the GlaS dataset and three recent methods on the CRAG dataset.
arXiv Detail & Related papers (2020-08-06T15:02:38Z) - Boundary-assisted Region Proposal Networks for Nucleus Segmentation [89.69059532088129]
Machine learning models cannot perform well because of large amount of crowded nuclei.
We devise a Boundary-assisted Region Proposal Network (BRP-Net) that achieves robust instance-level nucleus segmentation.
arXiv Detail & Related papers (2020-06-04T08:26:38Z)
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.