A three-dimensional dual-domain deep network for high-pitch and sparse helical CT reconstruction
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a new GPU implementation of the Katsevich algorithm for helical CT reconstruction. Our implementation divides the sinograms and reconstructs the CT images pitch by pitch. By utilizing the periodic properties of the parameters of the Katsevich algorithm, our method only needs to calculate these parameters once for all the pitches and so has lower GPU-memory burdens and is very suitable for deep learning. By embedding our implementation into the network, we propose an end-to-end deep network for the high pitch helical CT reconstruction with sparse detectors. Since our network utilizes the features extracted from both sinograms and CT images, it can simultaneously reduce the streak artifacts caused by the sparsity of sinograms and preserve fine details in the CT images. Experiments show that our network outperforms the related methods both in subjective and objective evaluations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 42 references that are in the map. First posted on arXiv 7 Jan 2022.
Builds on
6 of 42 references.
References · 6
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Deep Convolutional Neural Network for Inverse Problems in Imagingcited by 431
- 2017Low-Dose CT with a Residual Encoder-Decoder Convolutional Neural Network (RED-CNN)cited by 224
- 2019DuDoNet: Dual Domain Network for CT Metal Artifact Reductioncited by 68
- 2019Convolutional Sparse Coding for Compressed Sensing CT Reconstructioncited by 17
Built on by
Not cited yet.