Sparse-view Computed Tomography Reconstruction Research Articles

Sparse-View Spectral CT Reconstruction Based on Tensor Decomposition and Total Generalized Variation

Spectral computed tomography (CT)-reconstructed images often exhibit severe noise and artifacts, which compromise the practical application of spectral CT imaging technology. Methods that use tensor dictionary learning (TDL) have shown superior performance, but it is difficult to obtain a high-quality pre-trained global tensor dictionary in practice. In order to resolve this problem, this paper develops an algorithm called tensor decomposition with total generalized variation (TGV) for sparse-view spectral CT reconstruction. In the process of constructing tensor volumes, the proposed algorithm utilizes the non-local similarity feature of images to construct fourth-order tensor volumes and uses Canonical Polyadic (CP) tensor decomposition instead of pre-trained tensor dictionaries to further explore the inter-channel correlation of images. Simultaneously, introducing the TGV regularization term to characterize spatial sparsity features, the use of higher-order derivatives can better adapt to different image structures and noise levels. The proposed objective minimization model has been addressed using the split-Bregman algorithm. To assess the performance of the proposed algorithm, several numerical simulations and actual preclinical mice are studied. The final results demonstrate that the proposed algorithm has an enormous improvement in the quality of spectral CT images when compared to several existing competing algorithms.

Hierarchical decomposed dual-domain deep learning for sparse-view CT reconstruction

Objective. X-ray computed tomography employing sparse projection views has emerged as a contemporary technique to mitigate radiation dose. However, due to the inadequate number of projection views, an analytic reconstruction method utilizing filtered backprojection results in severe streaking artifacts. Recently, deep learning (DL) strategies employing image-domain networks have demonstrated remarkable performance in eliminating the streaking artifact caused by analytic reconstruction methods with sparse projection views. Nevertheless, it is difficult to clarify the theoretical justification for applying DL to sparse view computed tomography (CT) reconstruction, and it has been understood as restoration by removing image artifacts, not reconstruction. Approach. By leveraging the theory of deep convolutional framelets (DCF) and the hierarchical decomposition of measurement, this research reveals the constraints of conventional image and projection-domain DL methodologies, subsequently, the research proposes a novel dual-domain DL framework utilizing hierarchical decomposed measurements. Specifically, the research elucidates how the performance of the projection-domain network can be enhanced through a low-rank property of DCF and a bowtie support of hierarchical decomposed measurement in the Fourier domain. Main results. This study demonstrated performance improvement of the proposed framework based on the low-rank property, resulting in superior reconstruction performance compared to conventional analytic and DL methods. Significance. By providing a theoretically justified DL approach for sparse-view CT reconstruction, this study not only offers a superior alternative to existing methods but also opens new avenues for research in medical imaging. It highlights the potential of dual-domain DL frameworks to achieve high-quality reconstructions with lower radiation doses, thereby advancing the field towards safer and more efficient diagnostic techniques. The code is available at https://github.com/hanyoseob/HDD-DL-for-SVCT.

RegFormer: A Local–Nonlocal Regularization-Based Model for Sparse-View CT Reconstruction

Sparse-view computed tomography (CT) is one of the primal means to reduce radiation risk. However, the reconstruction of sparse-view CT with classic analytical method is usually contaminated by severe artifacts. By designing the regularization terms carefully, iterative reconstruction (IR) algorithms can produce promising results. Aided by the powerful deep learning techniques, learned regularization terms with convolution neural network (CNN) have attracted much attention and can further improve performance. In this paper, to further enhance the performance of existing learnable regularization-based networks, we propose a learnable local-nonlocal regularization-based model called RegFormer for sparse-view CT reconstruction. Specifically, we unroll the iterative scheme into a neural network and replace the gradient of handcrafted regularization terms with learnable kernels. The convolution layers are used to learn gradient of local regularization, resulting in excellent denoising performance. In addition, the transformer-based encoders and decoders incorporate the learned nonlocal prior into the model, preserving the structures and details. To enhance the ability to extract deep features, we propose an iteration transmission (IT) module that further improve the efficiency of each iteration. The experimental results show that our proposed RegFormer outperforms several state-of-the-art methods in artifact reduction and detail preservation.

A non-local total generalized variation regularization reconstruction method for sparse-view x-ray CT

Sparse-view x-ray computed tomography (CT) reconstruction, employing total generalized variation (TGV), effectively mitigates the stepwise artifacts associated with total variation (TV) regularization while preserving structural features within transitional regions of the reconstructed image. Despite TGV surpassing TV in reconstruction quality, it neglects the non-local self-similarity prior, recognized for its efficacy in restoring details during CT reconstruction. This study introduces a non-local TGV (NLTGV) to address the limitation of TGV regularization method. Specifically, we propose an NLTGV-regularized method for sparse-view CT reconstruction, utilizing non-local high-order derivative information to maintain image features and non-local self-similarity for detail recovery. Owing to the non-differentiability of the NLTGV regularized, we employ an alternating direction method of multipliers optimization method, facilitating an efficient solution by decomposing the reconstruction model into sub-problems. The proposed method undergoes evaluation using both simulated and real-world projection data. Simulation and experimental results demonstrate the efficacy of the proposed approach in enhancing the quality of reconstructed images compared to other competitive variational reconstruction methods. In conclusion, the simultaneous incorporation of sparsity priors of high-order TV and non-local similarity proves advantageous for structural detail recovery in sparse-view CT reconstruction.

Reconstruction of Sparse-View X-ray Computed Tomography Based on Adaptive Total Variation Minimization.

Sparse-view reconstruction has garnered significant interest in X-ray computed tomography (CT) imaging owing to its ability to lower radiation doses and enhance detection efficiency. Among current methods for sparse-view CT reconstruction, an algorithm utilizing iterative reconstruction based on full variational regularization demonstrates good performance. The optimized direction and number of computations for the gradient operator of the regularization term play a crucial role in determining not only the reconstructed image quality but also the convergence speed of the iteration process. The conventional TV approach solely accounts for the vertical and horizontal directions of the two-dimensional plane in the gradient direction. When projection data decrease, the edges of the reconstructed image become blurred. Exploring too many gradient directions for TV terms often comes at the expense of more computational costs. To enhance the balance of computational cost and reconstruction quality, this study suggests a novel TV computation model that is founded on a four-direction gradient operator. In addition, selecting appropriate iteration parameters significantly impacts the quality of the reconstructed image. We propose a nonparametric control method utilizing the improved TV approach as a solution to the tedious manual parameter optimization issue. The relaxation parameters of projection onto convex sets (POCS) are determined according to the scanning number and numerical proportion of the projection data; according to the image error before and after iterations, the gradient descent step of the TV item is adaptively adjusted. Compared with several representative iterative reconstruction algorithms, the experimental results show that the algorithm can effectively preserve edges and suppress noise in sparse-view CT reconstruction.

Two-and-a-half order score-based model for solving 3D ill-posed inverse problems

Computed Tomography (CT) and Magnetic Resonance Imaging (MRI) are crucial technologies in the field of medical imaging. Score-based models demonstrated effectiveness in addressing different inverse problems encountered in the field of CT and MRI, such as sparse-view CT and fast MRI reconstruction. However, these models face challenges in achieving accurate three dimensional (3D) volumetric reconstruction. The existing score-based models predominantly concentrate on reconstructing two-dimensional (2D) data distributions, resulting in inconsistencies between adjacent slices in the reconstructed 3D volumetric images. To overcome this limitation, we propose a novel two-and-a-half order score-based model (TOSM). During the training phase, our TOSM learns data distributions in 2D space, simplifying the training process compared to working directly on 3D volumes. However, during the reconstruction phase, the TOSM utilizes complementary scores along three directions (sagittal, coronal, and transaxial) to achieve a more precise reconstruction. The development of TOSM is built on robust theoretical principles, ensuring its reliability and efficacy. Through extensive experimentation on large-scale sparse-view CT and fast MRI datasets, our method achieved state-of-the-art (SOTA) results in solving 3D ill-posed inverse problems, averaging a 1.56 dB peak signal-to-noise ratio (PSNR) improvement over existing sparse-view CT reconstruction methods across 29 views and 0.87 dB PSNR improvement over existing fast MRI reconstruction methods with × 2 acceleration. In summary, TOSM significantly addresses the issue of inconsistency in 3D ill-posed problems by modeling the distribution of 3D data rather than 2D distribution which has achieved remarkable results in both CT and MRI reconstruction tasks.

Template-based CT reconstruction with optimal transport and total generalized variation

x-ray computed tomography (CT) has been widely used in clinical diagnosis as a modality of medical imaging. To decrease the radiation dose patients suffering from, sparse-view CT has gained much attention in medical imaging field. In this paper, we propose to design a variational model based on dynamic optimal transportation and total generalized variation for CT reconstruction. This is a joint task involving inverse problem and template registration. The final state image of the optimal transport problem is unknown and needs to be reconstructed through CT inversion, while the given initial state can be regarded as a template to provide some structural information for the final one. Moreover, the existence and stability of minimizers to our proposed model are shown in continuous space. In discretization with the continuity equation, we utilize the well-known staggered grid in fluid mechanics and develop a first-order algorithm based on primal-dual method for numerically solving the proposed model. Finally, numerical experiments for sparse-view CT reconstruction are exhibited to show the performance of our proposed model in recovering images with high quality and structure preservation.

Sparsier2Sparse: Self-supervised convolutional neural network-based streak artifacts reduction in sparse-view CT images.

Sparse-view computed tomography (CT) has attracted a lot of attention for reducing both scanning time and radiation dose. However, sparsely-sampled projection data generate severe streak artifacts in the reconstructed images. In recent decades, many sparse-view CT reconstruction techniques based on fully-supervised learning have been proposed and have shown promising results. However, it is not feasible to acquire pairs of full-view and sparse-view CT images in real clinical practice. In this study, we propose a novel self-supervised convolutional neural network (CNN) method to reduce streak artifacts in sparse-view CTimages. We generate the training dataset using only sparse-view CT data and train CNN based on self-supervised learning. Since the streak artifacts can be estimated using prior images under the same CT geometry system, we acquire prior images by iteratively applying the trained network to given sparse-view CT images. We then subtract the estimated steak artifacts from given sparse-view CT images to produce the finalresults. We validated the imaging performance of the proposed method using extended cardiac-torso (XCAT) and the 2016 AAPM Low-Dose CT Grand Challenge dataset from Mayo Clinic. From the results of visual inspection and modulation transfer function (MTF), the proposed method preserved the anatomical structures effectively and showed higher image resolution compared to the various streak artifacts reduction methods for all projection views. We propose a new framework for streak artifacts reduction when only the sparse-view CT data are given. Although we do not use any information of full-view CT data for CNN training, the proposed method achieved the highest performance in preserving fine details. By overcoming the limitation of dataset requirements on fully-supervised-based methods, we expect that our framework can be utilized in the medical imagingfield.

MDST: multi-domain sparse-view CT reconstruction based on convolution and swin transformer

Objective.Sparse-view computed tomography (SVCT), which can reduce the radiation doses administered to patients and hasten data acquisition, has become an area of particular interest to researchers. Most existing deep learning-based image reconstruction methods are based on convolutional neural networks (CNNs). Due to the locality of convolution and continuous sampling operations, existing approaches cannot fully model global context feature dependencies, which makes the CNN-based approaches less efficient in modeling the computed tomography (CT) images with various structural information. Approach. To overcome the above challenges, this paper develops a novel multi-domain optimization network based on convolution and swin transformer (MDST). MDST uses swin transformer block as the main building block in both projection (residual) domain and image (residual) domain sub-networks, which models global and local features of the projections and reconstructed images. MDST consists of two modules for initial reconstruction and residual-assisted reconstruction, respectively. The sparse sinogram is first expanded in the initial reconstruction module with a projection domain sub-network. Then, the sparse-view artifacts are effectively suppressed by an image domain sub-network. Finally, the residual assisted reconstruction module to correct the inconsistency of the initial reconstruction, further preserving image details. Main results. Extensive experiments on CT lymph node datasets and real walnut datasets show that MDST can effectively alleviate the loss of fine details caused by information attenuation and improve the reconstruction quality of medical images. Significance. MDST network is robust and can effectively reconstruct images with different noise level projections. Different from the current prevalent CNN-based networks, MDST uses transformer as the main backbone, which proves the potential of transformer in SVCT reconstruction.

Adaptive-weighted high order TV algorithm for sparse-view CT reconstruction.

With the development of low-dose computed tomography (CT), incomplete data reconstruction has been widely concerned. The total variation (TV) minimization algorithm can accurately reconstruct images from sparse or noisy data. However, the traditional TV algorithm ignores the direction of structures in images, leading to the loss of edge information and block artifacts when the object is not piecewise constant. Since the anisotropic information can facilitate preserving the edge and detail information in images, we aim to improve the TV algorithm in terms of reconstruction accuracy via this approach. In this paper, we propose an adaptive-weighted high order total variation (awHOTV) algorithm. We construct the second order TV-norm using the second order gradient, adapt the anisotropic edge property between neighboring image pixels, adjust the local image-intensity gradient to keep edge information, and design the corresponding Chambolle-Pock (CP) solving algorithm. Implementing the proposed algorithm, comprehensive studies are conducted in the ideal projection data experiment where the Structural similarity (SSIM), Root Mean Square Error (RMSE), Contrast to noise ratio (CNR), and modulation transform function (MTF) curves are utilized to evaluate the quality of reconstructed images in statism, structure, spatial resolution, and contrast, respectively. In the noisy data experiment, we further use the noise power spectrum (NPS) curve to evaluate the reconstructed images and compare it with other three algorithms. We use the 2D slice in the XCAT phantom, 2D slice in TCIA Challenge data and FORBILD phantom as simulation phantoms and use real bird data for real verification. The results show that, compared with the traditional TV and FBP algorithms, the awHOTV has better performance in terms of RMSE, SSIM, and Pearson correlation coefficient (PCC) under the projected data with different sparsity. In addition, the awHOTV algorithm is robust against the noise of different intensities. The proposed awHOTV method can reconstruct the images with high accuracy under sparse or noisy data. The awHOTV solves the strip artifacts caused by sparse data in the FBP method. Compared with the TV method, the awHOTV can effectively suppress block artifacts and has good detail protectionability.

A dual-domain neural network based on sinogram synthesis for sparse-view CT reconstruction

ObjectiveThe dual-domain deep learning-based reconstruction techniques have enjoyed many successful applications in the field of medical image reconstruction. Applying the analytical reconstruction based operator to transfer the data from the projection domain to the image domain, the dual-domain techniques may suffer from the insufficient suppression or removal of streak artifacts in areas with the missing view data, when addressing the sparse-view reconstruction problems. In this work, to overcome this problem, an intelligent sinogram synthesis based back-projection network (iSSBP-Net) was proposed for sparse-view computed tomography (CT) reconstruction. In the iSSBP-Net method, a convolutional neural network (CNN) was involved in the dual-domain method to inpaint the missing view data in the sinogram before CT reconstruction. MethodsThe proposed iSSBP-Net method fused a sinogram synthesis sub-network (SS-Net), a sinogram filter sub-network (SF-Net), a back-projection layer, and a post-CNN into an end-to-end network. Firstly, to inpaint the missing view data, the SS-Net employed a CNN to synthesize the full-view sinogram in the projection domain. Secondly, to improve the visual quality of the sparse-view CT images, the synthesized sinogram was filtered by a CNN. Thirdly, the filtered sinogram was brought into the image domain through the back-projection layer. Finally, to yield images of high visual sensitivity, the post-CNN was applied to restore the desired images from the outputs of the back-projection layer. ResultsThe numerical experiments demonstrate that the proposed iSSBP-Net is superior to all competing algorithms under different scanning condintions for sparse-view CT reconstruction. Compared to the competing algorithms, the proposed iSSBP-Net method improved the peak signal-to-noise ratio of the reconstructed images about 1.21 dB, 0.26 dB, 0.01 dB, and 0.37 dB under the scanning conditions of 360, 180, 90, and 60 views, respectively. ConclusionThe promising reconstruction results indicate that involving the SS-Net in the dual-domain method is could be an effective manner to suppress or remove the streak artifacts in sparse-view CT images. Due to the promising results reconstructed by the iSSBP-Net method, this study is intended to inspire the further development of sparse-view CT reconstruction by involving a SS-Net in the dual-domain method.

LRR-CED: low-resolution reconstruction-aware convolutional encoder–decoder network for direct sparse-view CT image reconstruction

Objective. Sparse-view computed tomography (CT) reconstruction has been at the forefront of research in medical imaging. Reducing the total x-ray radiation dose to the patient while preserving the reconstruction accuracy is a big challenge. The sparse-view approach is based on reducing the number of rotation angles, which leads to poor quality reconstructed images as it introduces several artifacts. These artifacts are more clearly visible in traditional reconstruction methods like the filtered-backprojection (FBP) algorithm. Approach. Over the years, several model-based iterative and more recently deep learning-based methods have been proposed to improve sparse-view CT reconstruction. Many deep learning-based methods improve FBP-reconstructed images as a post-processing step. In this work, we propose a direct deep learning-based reconstruction that exploits the information from low-dimensional scout images, to learn the projection-to-image mapping. This is done by concatenating FBP scout images at multiple resolutions in the decoder part of a convolutional encoder–decoder (CED). Main results. This approach is investigated on two different networks, based on Dense Blocks and U-Net to show that a direct mapping can be learned from a sinogram to an image. The results are compared to two post-processing deep learning methods (FBP-ConvNet and DD-Net) and an iterative method that uses a total variation (TV) regularization. Significance. This work presents a novel method that uses information from both sinogram and low-resolution scout images for sparse-view CT image reconstruction. We also generalize this idea by demonstrating results with two different neural networks. This work is in the direction of exploring deep learning across the various stages of the image reconstruction pipeline involving data correction, domain transfer and image improvement.

Dual-domain sparse-view CT reconstruction with Transformers

Purpose:Computed Tomography (CT) has been widely used in the medical field. Sparse-view CT is an effective and feasible method to reduce the radiation dose. However, the conventional filtered back projection (FBP) algorithm will suffer from severe artifacts in sparse-view CT. Iterative reconstruction algorithms have been adopted to remove artifacts, but they are time-consuming due to repeated projection and back projection and may cause blocky effects. To overcome the difficulty in sparse-view CT, we proposed a dual-domain sparse-view CT algorithm CT Transformer (CTTR) and paid attention to sinogram information. Methods:CTTR treats sinograms as sentences and enhances reconstructed images with sinogram’s characteristics. We qualitatively evaluate the CTTR, an iterative method TVM-POCS, a convolutional neural network based method FBPConvNet in terms of a reduction in artifacts and a preservation of details. Besides, we also quantitatively evaluate these methods in terms of RMSE, PSNR and SSIM. Results:We evaluate our method on the Lung Image Database Consortium image collection with different numbers of projection views and noise levels. Experiment studies show that, compared with other methods, CTTR can reduce more artifacts and preserve more details on various scenarios. Specifically, CTTR improves the FBPConvNet performance of PSNR by 0.76dB with 30 projections. Conclusions:The performance of our proposed CTTR is better than the method based on CNN in the case of extremely sparse views both on visual results and quantitative evaluation. Our proposed method provides a new idea for the application of Transformers to CT image processing.

Combining convolutional sparse coding with total variation for sparse-view CT reconstruction.

Conventional dictionary-learning-based computed tomography (CT) reconstruction methods extract patches from an original image to train, ignoring the consistency of pixels in overlapping patches. To address the problem, this paper proposes a method combining convolutional sparse coding (CSC) with total variation (TV) for sparse-view CT reconstruction. The proposed method inherits the advantages of CSC by directly processing the whole image without dividing it into overlapping patches, which preserves more details and reduces artifacts caused by patch aggregation. By introducing a TV regularization term to enhance the constraint of the image domain, the noise can be effectively further suppressed. The alternating direction method of multipliers algorithm is employed to solve the objective function. Numerous experiments are conducted to validate the performance of the proposed method in different views. Qualitative and quantitative results show the superiority of the proposed method in terms of noise suppression, artifact reduction, and image details recovery.

PARS-NET: a novel deep learning framework using parallel residual conventional neural networks for sparse-view CT reconstruction

Sparse-view computed tomography (CT) is recently proposed as a promising method to speed up data acquisition and alleviate the issue of CT high dose delivery to the patients. However, traditional reconstruction algorithms are time-consuming and suffer from image degradation when faced with sparse-view data. To address this problem, we propose a new framework based on deep learning (DL) that can quickly produce high-quality CT images from sparsely sampled projections and is able for clinical use. Our DL-based proposed model is based on the convolution, and residual neural networks in a parallel manner, named the parallel residual neural network (PARS-Net). Besides, our proposed PARS-Net model benefits from a loss based on the geodesic distance to effectively reflect image structures. Experiments have been performed on the combination of two large-scale CT datasets consisting of CT images of whole-body patients for different sparse projection views including 120, 60, and 30 views. Our experimental results show that PARS-Net is 4–5 times faster than the state-of-the-art DL-based models, with fewer memory requirements, better performance in other objective quality evaluations, and improved visual quality. Results showed that our PARS-Net model was superior to the latest methods, demonstrating the feasibility of using this model for high-quality CT image reconstruction from sparsely sampled projections.

DuDoDR-Net: Dual-domain data consistent recurrent network for simultaneous sparse view and metal artifact reduction in computed tomography.

Sparse-view computed tomography (SVCT) aims to reconstruct a cross-sectional image using a reduced number of x-ray projections. While SVCT can efficiently reduce the radiation dose, the reconstruction suffers from severe streak artifacts, and the artifacts are further amplified with the presence of metallic implants, which could adversely impact the medical diagnosis and other downstream applications. Previous methods have extensively explored either SVCT reconstruction without metallic implants, or full-view CT metal artifact reduction (MAR). The issue of simultaneous sparse-view and metal artifact reduction (SVMAR) remains under-explored, and it is infeasible to directly apply previous SVCT and MAR methods to SVMAR which may yield non-ideal reconstruction quality. In this work, we propose a dual-domain data consistent recurrent network, called DuDoDR-Net, for SVMAR. Our DuDoDR-Net aims to reconstruct an artifact-free image by recurrent image domain and sinogram domain restorations. To ensure the metal-free part of acquired projection data is preserved, we also develop the image data consistent layer (iDCL) and sinogram data consistent layer (sDCL) that are interleaved in our recurrent framework. Our experimental results demonstrate that our DuDoDR-Net is able to produce superior artifact-reduced results while preserving the anatomical structures, that outperforming previous SVCT and SVMAR methods, under different sparse-view acquisition settings.

Helical CT Reconstruction from Sparse-view Data through Exploiting the 3D Anatomical Structure Sparsity

Sparse-view scanning has great potential for realizing ultra-low-dose computed tomography (CT) examination. However, noise and artifacts in reconstructed images are big obstacles, which must be handled to maintain the diagnosis accuracy. Existing sparse-view CT reconstruction algorithms were usually designed for circular imaging geometry, whereas the helical imaging geometry is commonly adopted in the clinic. In this paper, we show that the sparse-view helical CT (SHCT) images contain not only noise and artifacts but also severe anatomical distortions. These troubles reduce the applicability of existing sparse-view CT reconstruction algorithms. To deal with this problem, we analyzed the three-dimensional (3D) anatomical structure sparsity in SHCT images. Based on the analyses, we proposed a tensor decomposition and anisotropic total variation regularization model (TDATV) for SHCT reconstruction. Specifically, the tensor decomposition works on nonlocal cube groups to exploit the anatomical structure redundancy; the anisotropic total variation works on the whole volume to exploit the structural piecewise-smooth. Finally, an alternating direction method of multipliers is developed to solve the TDATV model. To our knowledge, the paper presents the first work investigating the reconstruction of sparse-view helical CT. The TDATV model was validated through digital phantom, physical phantom, and clinical patient studies. The results reveal that SHCT could serve as a potential solution for reducing HCT radiation dose to ultra-low level by using the proposed TDATV model.

Sparse-view CT reconstruction based on multi-level wavelet convolution neural network.

Sparse-view computed tomography (CT) is a recent approach to reducing the radiation dose in patients and speeding up the data acquisition. Consequently, sparse-view CT has been of particular interest among researchers within the CT community. Advanced reconstruction algorithms for sparse-view CT, such as iterative algorithms with total-variation (TV), have been studied along with the problem of increasing computational burden and the blurring of artifacts in the reconstructed images. Studies on deep-learning-based approaches applying U-NET have recently achieved remarkable outcomes in various domains including low-dose CT. In this study, we propose a new method for sparse-view CT reconstruction based on a multi-level wavelet convolutional neural network (MWCNN). First, a filtered backprojection (FBP) was used to reconstruct a sparsely sampled sinogram from 60, 120, and 180 projections. Subsequently, the sparse-view data obtained from FBP were fed to a deep-learning network, i.e., the MWCNN. Our network architecture combines a wavelet transform and modified U-NET without pooling. By replacing the pooling function with the wavelet transform, the receptive field is enlarged to improve the performance. We qualitatively and quantitatively evaluated the interpolation, iterative TV method, and standard U-NET in terms of a reduction in the streaking artifacts and a preservation of the anatomical structures. When compared with other methods, the proposed method showed the highest performance based on various evaluation parameters such as the structural similarity, root mean square error, and resolution. These results indicate that the MWCNN possesses a powerful potential for achieving a sparse-view CT reconstruction.

Novel FBP based sparse-view CT reconstruction scheme using self-shaping spatial filter based morphological operations and scaled reprojections

Computed tomography (CT) has been a major contributor in revolutionizing and commercializing the medical imaging industry. However, most of the commonly used CT reconstruction algorithms need sufficiently dense angular sampling views or a substantial dose of hazardous X-ray radiations. Reducing the radiation dose causes degradation in the quality of the reconstructed image, due to additional artifacts. The paper presents a novel algorithm for efficient CT reconstruction from under-sampled projections; which leads to radiation dose reduction with quality image reconstruction. The Sparse-View projection data is enhanced using a series of post-processing algorithms and computer based reprojection. The process involves enhancement through self-shaping/amoeba based morphological spatial filtering. The use of self-shaping spatial filter kernel in the area of under-sampled CT reconstruction is a novel contribution. The scheme is supported by computer simulations using fan-beam projections of clinically reconstructed and simulated head CT phantoms. The proposed scheme is compared with classical reconstruction techniques for reconstruction image quality, accuracy, speed, and robustness in the presence of noise. Promising results indicate the efficacy of proposed scheme. An efficient scheme for image enhancement of Sparse-View CT is presented. The results demonstrate that the proposed scheme is visually and statistically better than classical CT reconstruction techniques, as evaluated using various image quality matrices. The presented scheme is more robust to noise in CT projections and effective for enhancing few-views reconstruction.

Moreau-envelope-enhanced nonlocal shearlet transform and total variation for sparse-view CT reconstruction

Iterative computed tomography (CT) image reconstruction with sparse regularization can substantially reduce the amount of projection data. However, when the sparse-view sampled projection data are noisy, it is challenging to achieve satisfactory reconstruction with local prior-based sparsity regularization such as total variation. This is because employing local prior information, it is difficult to distinguish structural details from noise. In this work, to address the problem, a nonlocal 3D shearlet sparse regularization based on image patch matching and a patch-based shearlet transform is proposed for sparse-view CT image reconstruction, which can effectively utilize nonlocal self-similar prior information to restore the structural details of CT images with sparse-view noisy projection data. As the shearlet transform belongs to a multi-scale directional sensitive transform, it can better preserve the anisotropic features of the image compared with a traditional wavelet transform. Moreover, we incorporate the proposed nonlocal shearlet regularization as an L 1 regularization term into the TV-L 1 model to further help preserve the edge of the reconstructed image. In addition, the Moreau-envelope-enhanced L 1 norm is also employed to enhance the performance of the reconstruction. The simulation and practical data study show that the proposed method can effectively suppress noise and protect the fine structures, leading to an overall improvement in the quality of the reconstructed image.