Light-weight spatio-temporal graphs for segmentation and ejection fraction prediction in cardiac ultrasound

• URL: http://arxiv.org/abs/2207.02549v1
• Date: Wed, 6 Jul 2022 10:03:44 GMT
• Title: Light-weight spatio-temporal graphs for segmentation and ejection fraction prediction in cardiac ultrasound
• Authors: Sarina Thomas, Andrew Gilbert, and Guy Ben-Yosef
• Abstract summary: We propose an automated method called EchoGraphs for predicting ejection fraction and segmenting the left ventricle. Models for direct coordinate regression based on Graph Conal Networks (GCNs) are used to detect the keypoints. Compared to semantic segmentation, GCNs show accurate segmentation and improvements in robustness and inference runtime.
• Score: 5.597394612661975
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Accurate and consistent predictions of echocardiography parameters are important for cardiovascular diagnosis and treatment. In particular, segmentations of the left ventricle can be used to derive ventricular volume, ejection fraction (EF) and other relevant measurements. In this paper we propose a new automated method called EchoGraphs for predicting ejection fraction and segmenting the left ventricle by detecting anatomical keypoints. Models for direct coordinate regression based on Graph Convolutional Networks (GCNs) are used to detect the keypoints. GCNs can learn to represent the cardiac shape based on local appearance of each keypoint, as well as global spatial and temporal structures of all keypoints combined. We evaluate our EchoGraphs model on the EchoNet benchmark dataset. Compared to semantic segmentation, GCNs show accurate segmentation and improvements in robustness and inference runtime. EF is computed simultaneously to segmentations and our method also obtains state-of-the-art ejection fraction estimation. Source code is available online: https://github.com/guybenyosef/EchoGraphs.

Related papers

• CoReEcho: Continuous Representation Learning for 2D+time Echocardiography Analysis [42.810247034149214]
  We propose CoReEcho, a novel training framework emphasizing continuous representations tailored for direct EF regression. CoReEcho: 1) outperforms the current state-of-the-art (SOTA) on the largest echocardiography dataset (EchoNet-Dynamic) with MAE of 3.90 & R2 of 82.44, and 2) provides robust and generalizable features that transfer more effectively in related downstream tasks.
  arXiv  Detail & Related papers  (2024-03-15T10:18:06Z)
• Semantic-aware Temporal Channel-wise Attention for Cardiac Function Assessment [69.02116920364311]
  Existing video-based methods do not pay much attention to the left ventricular region, nor the left ventricular changes caused by motion. We propose a semi-supervised auxiliary learning paradigm with a left ventricular segmentation task, which contributes to the representation learning for the left ventricular region. Our approach achieves state-of-the-art performance on the Stanford dataset with an improvement of 0.22 MAE, 0.26 RMSE, and 1.9% $R2$.
  arXiv  Detail & Related papers  (2023-10-09T05:57:01Z)
• Towards Robust Cardiac Segmentation using Graph Convolutional Networks [0.9507020058422264]
  We propose a graph architecture that uses two convolutional rings based on cardiac anatomy and show that this eliminates anatomical incorrect multi-structure segmentations. We show this predictor can detect out-of-distribution and unsuitable input images in real-time.
  arXiv  Detail & Related papers  (2023-10-02T13:55:06Z)
• SimLVSeg: Simplifying Left Ventricular Segmentation in 2D+Time Echocardiograms with Self- and Weakly-Supervised Learning [0.8672882547905405]
  We develop SimLVSeg, a video-based network for consistent left ventricular (LV) segmentation from sparsely annotated echocardiogram videos. SimLVSeg consists of self-supervised pre-training with temporal masking, followed by weakly supervised learning tailored for LV segmentation from sparse annotations. We demonstrate how SimLVSeg outperforms the state-of-the-art solutions by achieving a 93.32% dice score on the largest 2D+time echocardiography dataset.
  arXiv  Detail & Related papers  (2023-09-30T18:13:41Z)
• GraphEcho: Graph-Driven Unsupervised Domain Adaptation for Echocardiogram Video Segmentation [15.8851111502473]
  This paper studies the unsupervised domain adaption (UDA) for echocardiogram video segmentation, where the goal is to generalize the model trained on the source domain to other unlabelled target domains. Existing UDA segmentation methods are not suitable for this task because they do not model local information and the cyclical consistency of heartbeat. In this paper, we introduce a newly collected CardiacUDA dataset and a novel GraphEcho method for cardiac structure segmentation.
  arXiv  Detail & Related papers  (2023-09-20T08:44:10Z)
• Interactive Segmentation for COVID-19 Infection Quantification on Longitudinal CT scans [40.721386089781895]
  Consistent segmentation of COVID-19 patient's CT scans across multiple time points is essential to assess disease progression and response to therapy accurately. Existing automatic and interactive segmentation models for medical images only use data from a single time point (static) We propose a new single network model for interactive segmentation that fully utilizes all available past information to refine the segmentation of follow-up scans.
  arXiv  Detail & Related papers  (2021-10-03T08:06:38Z)
• EllipseNet: Anchor-Free Ellipse Detection for Automatic Cardiac Biometrics in Fetal Echocardiography [18.616697103809713]
  We present an anchor-free ellipse detection network, namely EllipseNet. It detects the cardiac and thoracic regions in ellipse and automatically calculates the CTR and cardiac axis for fetal cardiac biometrics in 4-chamber view. We evaluate EllipseNet on clinical echocardiogram dataset with more than 2000 subjects.
  arXiv  Detail & Related papers  (2021-09-26T01:44:56Z)
• 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)
• A Global Benchmark of Algorithms for Segmenting Late Gadolinium-Enhanced Cardiac Magnetic Resonance Imaging [90.29017019187282]
  " 2018 Left Atrium Challenge" using 154 3D LGE-MRIs, currently the world's largest cardiac LGE-MRI dataset. Analyse of the submitted algorithms using technical and biological metrics was performed. Results show the top method achieved a dice score of 93.2% and a mean surface to a surface distance of 0.7 mm.
  arXiv  Detail & Related papers  (2020-04-26T08:49:17Z)
• CondenseUNet: A Memory-Efficient Condensely-Connected Architecture for Bi-ventricular Blood Pool and Myocardium Segmentation [0.0]
  We propose a novel memory-efficient Convolutional Neural Network (CNN) architecture as a modification of both CondenseNet and DenseNet. Our experiments show that the proposed architecture runs on the Automated Cardiac Diagnosis Challenge dataset.
  arXiv  Detail & Related papers  (2020-04-05T16:34:51Z)
• Embedding Graph Auto-Encoder for Graph Clustering [90.8576971748142]
  Graph auto-encoder (GAE) models are based on semi-supervised graph convolution networks (GCN) We design a specific GAE-based model for graph clustering to be consistent with the theory, namely Embedding Graph Auto-Encoder (EGAE) EGAE consists of one encoder and dual decoders.
  arXiv  Detail & Related papers  (2020-02-20T09:53:28Z)

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.