Application of Gated Recurrent Units for CT Trajectory Optimization

• URL: http://arxiv.org/abs/2405.09333v1
• Date: Wed, 15 May 2024 13:33:23 GMT
• Title: Application of Gated Recurrent Units for CT Trajectory Optimization
• Authors: Yuedong Yuan, Linda-Sophie Schneider, Andreas Maier,
• Abstract summary: This paper presents a novel approach using Gated Recurrent Units (GRUs) to optimize CT scan trajectories. We focus on cone-beam CT and employ several projection-based metrics, including absorption, pixel intensities, contrast-to-noise ratio, and data completeness. The results show that the GRU-optimized scan trajectories can outperform traditional circular CT trajectories in terms of image quality metrics.
• Score: 3.4916237834391874
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent advances in computed tomography (CT) imaging, especially with dual-robot systems, have introduced new challenges for scan trajectory optimization. This paper presents a novel approach using Gated Recurrent Units (GRUs) to optimize CT scan trajectories. Our approach exploits the flexibility of robotic CT systems to select projections that enhance image quality by improving resolution and contrast while reducing scan time. We focus on cone-beam CT and employ several projection-based metrics, including absorption, pixel intensities, contrast-to-noise ratio, and data completeness. The GRU network aims to minimize data redundancy and maximize completeness with a limited number of projections. We validate our method using simulated data of a test specimen, focusing on a specific voxel of interest. The results show that the GRU-optimized scan trajectories can outperform traditional circular CT trajectories in terms of image quality metrics. For the used specimen, SSIM improves from 0.38 to 0.49 and CNR increases from 6.97 to 9.08. This finding suggests that the application of GRU in CT scan trajectory optimization can lead to more efficient, cost-effective, and high-quality imaging solutions.

Related papers

• DCT-HistoTransformer: Efficient Lightweight Vision Transformer with DCT Integration for histopathological image analysis [0.0]
  We introduce a novel lightweight breast cancer classification approach using Vision Transformers (ViTs) By incorporating parallel processing pathways for Discrete Cosine Transform (DCT) Attention and MobileConv, we convert image data from the spatial domain to the frequency domain to utilize the benefits such as filtering out high frequencies in the image. Our proposed model achieves an accuracy of 96.00% $pm$ 0.48% for binary classification and 87.85% $pm$ 0.93% for multiclass classification, which is comparable to state-of-the-art models.
  arXiv  Detail & Related papers  (2024-10-24T21:16:56Z)
• Learning Efficient and Effective Trajectories for Differential Equation-based Image Restoration [59.744840744491945]
  We reformulate the trajectory optimization of this kind of method, focusing on enhancing both reconstruction quality and efficiency. We propose cost-aware trajectory distillation to streamline complex paths into several manageable steps with adaptable sizes. Experiments showcase the significant superiority of the proposed method, achieving a maximum PSNR improvement of 2.1 dB over state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-10-07T07:46:08Z)
• A Unified Model for Compressed Sensing MRI Across Undersampling Patterns [69.19631302047569]
  Deep neural networks have shown great potential for reconstructing high-fidelity images from undersampled measurements. Our model is based on neural operators, a discretization-agnostic architecture. Our inference speed is also 1,400x faster than diffusion methods.
  arXiv  Detail & Related papers  (2024-10-05T20:03:57Z)
• Deep Few-view High-resolution Photon-counting Extremity CT at Halved Dose for a Clinical Trial [8.393536317952085]
  We propose a deep learning-based approach for PCCT image reconstruction at halved dose and doubled speed in a New Zealand clinical trial. We present a patch-based volumetric refinement network to alleviate the GPU memory limitation, train network with synthetic data, and use model-based iterative refinement to bridge the gap between synthetic and real-world data.
  arXiv  Detail & Related papers  (2024-03-19T00:07:48Z)
• Rotational Augmented Noise2Inverse for Low-dose Computed Tomography Reconstruction [83.73429628413773]
  Supervised deep learning methods have shown the ability to remove noise in images but require accurate ground truth. We propose a novel self-supervised framework for LDCT, in which ground truth is not required for training the convolutional neural network (CNN) Numerical and experimental results show that the reconstruction accuracy of N2I with sparse views is degrading while the proposed rotational augmented Noise2Inverse (RAN2I) method keeps better image quality over a different range of sampling angles.
  arXiv  Detail & Related papers  (2023-12-19T22:40:51Z)
• Deep learning network to correct axial and coronal eye motion in 3D OCT retinal imaging [65.47834983591957]
  We propose deep learning based neural networks to correct axial and coronal motion artifacts in OCT based on a single scan. The experimental result shows that the proposed method can effectively correct motion artifacts and achieve smaller error than other methods.
  arXiv  Detail & Related papers  (2023-05-27T03:55:19Z)
• Geometric Constraints Enable Self-Supervised Sinogram Inpainting in Sparse-View Tomography [7.416898042520079]
  Sparse-angle tomographic scans reduce radiation and accelerate data acquisition, but suffer from image artifacts and noise. Existing image processing algorithms can restore CT reconstruction quality but often require large training data sets or can not be used for truncated objects. This work presents a self-supervised projection inpainting method that allows optimizing missing projective views via gradient-based optimization.
  arXiv  Detail & Related papers  (2023-02-13T15:15:18Z)
• HyperSLICE: HyperBand optimized Spiral for Low-latency Interactive Cardiac Examination [0.0]
  Interactive cardiac resonance imaging is used for fast scan planning and guided interventions. The requirement for real-time and near real-time visualization constrains the achievable MR-resolution. This study aims to improve interactive imaging resolution through optimization of undersampled spiral sampling and leveraging deep learning for low-latency reconstruction.
  arXiv  Detail & Related papers  (2023-02-06T10:41:57Z)
• Enhanced Sharp-GAN For Histopathology Image Synthesis [63.845552349914186]
  Histopathology image synthesis aims to address the data shortage issue in training deep learning approaches for accurate cancer detection. We propose a novel approach that enhances the quality of synthetic images by using nuclei topology and contour regularization. The proposed approach outperforms Sharp-GAN in all four image quality metrics on two datasets.
  arXiv  Detail & Related papers  (2023-01-24T17:54:01Z)
• Multi-Channel Convolutional Analysis Operator Learning for Dual-Energy CT Reconstruction [108.06731611196291]
  We develop a multi-channel convolutional analysis operator learning (MCAOL) method to exploit common spatial features within attenuation images at different energies. We propose an optimization method which jointly reconstructs the attenuation images at low and high energies with a mixed norm regularization on the sparse features.
  arXiv  Detail & Related papers  (2022-03-10T14:22:54Z)
• High-quality Low-dose CT Reconstruction Using Convolutional Neural Networks with Spatial and Channel Squeeze and Excitation [15.05273611411106]
  We present a High-Quality Imaging network (HQINet) for the CT image reconstruction from Low-dose computed tomography (CT) acquisitions. HQINet was a convolutional encoder-decoder architecture, where the encoder was used to extract spatial and temporal information from three contiguous slices.
  arXiv  Detail & Related papers  (2021-04-01T08:15:53Z)

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.