• Robust Noise Modeling. With explicit noise modeling in the image domain, our presented method demonstrates superior generalization capability across diverse PCD-CT imaging scenarios. This principled statistical approach provides inherent robustness to real-world noise variations, enabling reliable performance under different acquisition conditions. • Flexible Reconstruction Scheme. The reconstruction scheme synergistically combines our novel noise-based regularization with conventional 3DTV constraints, while maintaining the flexibility to incorporate additional image-based regularizations. This modular architecture allows for task-specific optimization without compromising the method’s theoretical foundations. • Improved Real-World Denoising Performance. Comprehensive validation on both phantom and real-world datasets demonstrated the presented method in terms of denoising efficacy and material decomposition accuracy compared to state-of-the-art methods. Model-based image reconstruction methods with regularization terms have been developed to suppress noise in the photon-counting detector CT (PCD-CT) images. Meanwhile, most regularization terms are usually designed based on the image characteristics, but do not account for the real-world noise distribution within the images, which may produce undesired biases in the reconstruction results. In this work, we analyze the noise characteristics of PCD-CT images, i.e., material dependent, spatial location dependent, and energy dependent characteristics, and present a N oise C haracterized M odel-based I terative R econstruction (NCM-IR) method for high-fidelity PCD-CT imaging. Specifically, a three-dimensional total variation (3DTV) is utilized to describe the texture characteristics in the PCD-CT images. Then, the characteristics of noise are modeled in an explicit form with a universal approximator, i.e., Gaussian mixture model (GMM). Moreover, both the GMM and 3DTV are introduced into the presented NCM-IR method. Finally, in the presented NCM-IR, we optimize the parameters of the noise distribution and 3DTV with respect to the reconstruction accuracy by using a designed Expectation Maximization algorithm. The presented NCM-IR method is extensively evaluated in numerical and preclinical studies and we demonstrate the presented NCM-IR method with characterized noise distribution outperforms the competing methods that either utilize only characterized noise distribution or lack it entirely in terms of noise reduction, structure preservation, and material decomposition accuracy. A Search-Based File Recommendation Approach for Infrastructure-as-Code Evolution

Metal implants introduce severe artifacts in CT images, compromising diagnostic reliability. Supervised metal artifact reduction (MAR) models trained on simulated data are effective but often fail due to domain gaps when applied to real clinical data. Unsupervised methods trained on real images avoid such gaps but suffer from weak artifact suppression and training instability. To address these challenges, we propose d-MAR, a novel MAR framework that performs diffusion-driven domain transformations between simulated and real image domains. Specifically, real image domain (RID) data is transformed into the simulated image domain (SID), processed by a MAR model trained on simulation-paired data, and transformed back into RID. We harness diffusion models as a transformation bridge and introduce two targeted conditional sampling techniques-conditional input and sampling enhancement-based on Fourier-extracted low-frequency image components. This enables domain alignment without random generation, ensuring consistent anatomical fidelity. The proposed d-MAR can reduce real metal artifacts originating from different scanning protocols and devices with a MAR model trained with simulated paired data. Evaluations on Clinical Head, Clinical Body, and dental CBCT datasets show that d-MAR consistently outperforms conventional MAR methods in both quantitative metrics and visual quality, demonstrating strong generalization capability.

Although supervised deep learning methods have made significant advances in low-dose computed tomography (LDCT) image denoising, these approaches typically require pairs of low-dose and normal-dose CT images for training, which are often unavailable in clinical settings. Self-supervised deep learning (SSDL) has great potential to cast off the dependence on paired training datasets. However, existing SSDL methods are limited by the neighboring noise independence assumptions, making them ineffective for handling spatially correlated noises in LDCT images. To address this issue, this paper introduces a novel SSDL approach, named, Noise-Aware Blind Spot Network (NA-BSN), for high-quality LDCT imaging, while mitigating the dependence on the assumption of neighboring noise independence. NA-BSN achieves high-quality image reconstruction without referencing clean data through its explicit noise-aware constraint mechanism during the self-supervised learning process. Specifically, it is experimentally observed and theoretical proven that the $l1$ norm value of CT images in a downsampled space follows a certain descend trend with increasing of the radiation dose, which is then used to construct the explicit noise-aware constraint in the architecture of BSN for self-supervised LDCT image denoising. Various clinical datasets are adopted to validate the performance of the presented NA-BSN method. Experimental results reveal that NA-BSN significantly reduces the spatially correlated CT noises and retains crucial image details in various complex scenarios, such as different types of scanning machines, scanning positions, dose-level settings, and reconstruction kernels.

Low light conditions in endoscopic imaging would lead to poor visibility, reduced contrast, and increased noise, which may hinder accurate diagnosis and surgical guidance. Against this low-light endoscopic image enhancement (LLEIE) task, inspired by the remarkable performance of pretrained CLIP in downstream vision tasks, in this paper, we carefully investigate the pretrained priors of CLIP and embed them into a text-modulated semantic-aware discriminator (TMSD). Through the adversarial learning mechanism, the discriminator can be easily integrated into different low-light enhancement baselines for helping them accomplish better visual restoration effects without incurring any extra inference cost. Specifically, to make the foundation model CLIP suitable for the LLEIE task, we initially propose a prompt learning procedure to obtain the text embedding and image semantics corresponding to the normal-light endoscopic imaging scenario. Building upon the acquired text prior and image semantic priors, we devise a text modulator to synergize these two priors, yielding a richer semantic representation. Leveraging the convolutional modulation and cross-attention mechanisms, we blend this semantic guidance information into the discriminator, thereby fostering the fine-grained distribution learning of normal-light endoscopic images in visual semantics and guiding different enhancement baselines achieving higher visual quality. Based on five public benchmark datasets, including three synthetic datasets, one real clinical dataset, and one clinical downstream segmentation dataset, we comprehensively evaluate the effectiveness of our proposed TMSD. Extensive experiments substantiate that the integration of the proposed TMSD enables seven representative baselines to obtain better perceptual quality, especially in the cross-domain clinical generalization scenario. Besides, the downstream segmentation accuracy can be evidently improved, showing the favorable application potential of the proposed TMSD. Moreover, to comprehensively evaluate the generality of our TMSD framework, we successfully apply it to a new and classic metal artifact reduction task. It is worth mentioning that our TMSD does not incur any extra computational cost during inference.

Automatic segmentation of pulmonary embolism (PE) in computed tomography pulmonary angiography (CTPA) facilitates the quantitative assessment of PE severity, which is crucial for accurate and comprehensive diagnosis and reducing the high mortality rate of PE. Recent studies have attempted to reduce segmentation errors by integrating vessel segmentation techniques. However, the PE segmentation performance of these methods is largely limited by inter-tissue similarities and the tiny size of PE, along with variability in the shape and position of PE. To address these issues, we propose a CT diagnostic mode-oriented and cross difficulty-aware network (DMCD-Net) for PE segmentation. Specifically, our DMCD-Net imitates the collaborative diagnostic mode of multi-modal CT to learn intensity differences between PE and surrounding tissues, which can effectively reduce false positive segmentation, especially in cases with tiny size and inter-tissue similarities. Moreover, we introduce a cross difficulty-aware scheme with cross-supervision strategies and a difficulty-aware loss function to enhance focus on difficult segmentation regions arising from the irregular shapes and variable locations of PE. Our DMCD-Net is evaluated on two different hospitals and two public datasets. Extensive experiments demonstrate that DMCD-Net outperforms the state-of-the-art methods and shows better generalizability in PE segmentation.

Multi-contrast magnetic resonance imaging (MC-MRI) plays a crucial role in clinical practice. However, its performance is hindered by long scanning times and the isolation between image acquisition and downstream clinical diagnoses/treatments. Despite the activated research on accelerated MC-MRI, few existing studies prioritize personalized imaging tailored to individual patient characteristics and clinical needs. That is, the current approach often aims to enhance overall image quality, disregarding the specific pathologies or anatomical regions that are of particular interest to clinicians. To tackle this challenge, we propose an anatomy-aware unrolling-based deep network, dubbed as $\text {A}^{{2}}$ MC-MRI, offering promising interpretability and learning capacity for fast MC-MRI catering to downstream clinical needs. The network is unfolded from the iterative algorithm designed for a task-oriented MC-MRI reconstruction model. Specifically, to enhance concurrent MC-MRI of specific targets of interest (TOIs), the model integrates a learnable group sparsity with an anatomy-aware denoising prior. Within the anatomy-aware denoising prior, a segmentation network is involved to provide critical location information for TOI-enhanced denoising. Finally, such an unrolled network is jointly learned with k-space sampling patterns for task-oriented MC-MR reconstruction. Comprehensive evaluations on two public benchmarks as well as an in-house dataset demonstrate that our ${A}^{{2}}$ MC-MRI led to state-of-the-art performance in MC-MRI reconstruction under high acceleration rates, featuring notable enhancements in TOI imaging quality. The code will be available at https://github.com/ladderlab-xjtu/A2MC-MRI.

Against the metal artifact reduction (MAR) task in computed tomography (CT) imaging, most of the existing deep-learning-based approaches generally select a single Hounsfield unit (HU) window followed by a normalization operation to preprocess CT images. However, in practical clinical scenarios, different body tissues and organs are often inspected under varying window settings for good contrast. The methods trained on a fixed single window would lead to insufficient removal of metal artifacts when being transferred to deal with other windows. To alleviate this problem, few works have proposed to reconstruct the CT images under multiple-window configurations. Albeit achieving good reconstruction performance for different windows, they adopt to directly supervise each window learning in an equal weighting way based on the training set. To improve the learning flexibility and model generalizability, in this paper, we propose an adaptive weighting algorithm, called AdaW, for the multiple-window metal artifact reduction, which can be applied to different deep MAR network backbones. Specifically, we first formulate the multiple window learning task as a bi-level optimization problem. Then we derive an adaptive weighting optimization algorithm where the learning process for MAR under each window is automatically weighted via a learning-to-learn paradigm based on the training set and validation set. This rationality is finely substantiated through theoretical analysis. Based on different network backbones, experimental comparisons executed on five datasets with different body sites comprehensively validate the effectiveness of AdaW in helping improve the generalization performance as well as its good applicability. We will release the code at https://github.com/hongwang01/AdaW.

High-attenuation (HA) artifacts may lead to obscured subtle lesions and lesion over-estimation in digital breast tomosynthesis (DBT) imaging. High-attenuation artifact suppression (HAAS) is vital for widespread DBT applications in clinic. The conventional HAAS methods usually rely on the segmentation accuracy of HA objects and manual weighting schemes, without considering the geometry information in DBT reconstruction. And the global weighted strategy designed for HA artifacts may decrease the resolution in low-contrast soft-tissue regions. Moreover, the view-by-view backprojection tensor (VVBP-Tensor) domain has recently developed as a new intermediary domain that contains the lossless information in projection domain and the structural details in image domain. Therefore, we propose a VOI-Based VVBP-Tensor Network (VBVT-Net) for HAAS task in DBT imaging, which learns a local implicit weighted strategy based on the analytical FDK reconstruction mechanism. Specifically, the VBVT-Net method incorporates a volume of interest (VOI) recognition sub-network and a HAAS sub-network. The VOI recognition sub-network automatically extracts all 4D VVBP-Tensor patches containing HA artifacts. The HAAS sub-network reduces HA artifacts in these 4D VVBP-Tensor patches by leveraging the ray-trace backprojection features and extra neighborhood information. All results on four datasets demonstrate that the proposed VBVT-Net method could accurately detect HA regions, effectively reduce HA artifacts and simultaneously preserve structures in soft-tissue background regions. The proposed VBVT-Net method has a good interpretability as a general variant of the weighted FDK algorithm, which is potential to be applied in the next generation DBT prototype system in the future.

Deep learning (DL) algorithms have achieved unprecedented success in low-dose CT (LDCT) imaging and are expected to be a new generation of CT reconstruction technology. However, most DL-based denoising models often lack the ability to generalize to unseen dose data. Moreover, most simulation tools for LDCT typically operate on proprietary projection data, which is generally not accessible without an established collaboration with CT manufacturers. To alleviate these issues, in this work, we propose a dose-agnostic dual-task transfer network, termed DDT-Net, for simultaneous LDCT denoising and simulation. Concretely, the dual-task learning module is constructed to integrate the LDCT denoising and simulation tasks into a unified optimization framework by learning the joint distribution of LDCT and NDCT data. We approximate the joint distribution of continuous dose level data by training DDT-Net with discrete dose data, which can be generalized to denoising and simulation of unseen dose data. In particular, the mixed-dose training strategy adopted by DDT-Net can promote the denoising performance of lower-dose data. The paired dataset simulated by DDT-Net can be used for data augmentation to further restore the tissue texture of LDCT images. Experimental results on synthetic data and clinical data show that the proposed DDT-Net outperforms competing methods in terms of denoising and generalization performance at unseen dose data, and it also provides a simulation tool that can quickly simulate realistic LDCT images at arbitrary dose levels.

Low-dose computed tomography (LDCT) helps to reduce radiation risks in CT scanning while maintaining image quality, which involves a consistent pursuit of lower incident rays and higher reconstruction performance. Although deep learning approaches have achieved encouraging success in LDCT reconstruction, most of them treat the task as a general inverse problem in either the image domain or the dual (sinogram and image) domains. Such frameworks have not considered the original noise generation of the projection data and suffer from limited performance improvement for the LDCT task. In this paper, we propose a novel reconstruction model based on noise-generating and imaging mechanism in full-domain, which fully considers the statistical properties of intrinsic noises in LDCT and prior information in sinogram and image domains. To solve the model, we propose an optimization algorithm based on the proximal gradient technique. Specifically, we derive the approximate solutions of the integer programming problem on the projection data theoretically. Instead of hand-crafting the sinogram and image regularizers, we propose to unroll the optimization algorithm to be a deep network. The network implicitly learns the proximal operators of sinogram and image regularizers with two deep neural networks, providing a more interpretable and effective reconstruction procedure. Numerical results demonstrate our proposed method improvements of > 2.9 dB in peak signal to noise ratio, > 1.4% promotion in structural similarity metric, and > 9 HU decrements in root mean square error over current state-of-the-art LDCT methods.

In flat-panel detector (FPD) based cone-beam computed tomography (CBCT) imaging, the native receptor array is usually binned into a smaller matrix size. By doing so, the signal readout speed could be increased by 4-9 times at the expense of a spatial resolution loss of 50%-67%. Clearly, such manipulation poses a key bottleneck in generating high spatial and high temporal resolution CBCT images at the same time. In addition, the conventional FPD is also difficult in generating dual-energy CBCT images. In this paper, we propose an innovative super resolution dual-energy CBCT imaging method, named as suRi, based on dual-layer FPD (DL-FPD) to overcome these aforementioned difficulties at once. With suRi, specifically, a 1D or 2D sub-pixel (half pixel in this study) shifted binning is applied instead of the conventionally aligned binning to double the spatial sampling rate during the dual-energy data acquisition. As a result, the suRi approach provides a new strategy to enable high spatial resolution CBCT imaging while at high readout speed. Moreover, a penalized likelihood material decomposition algorithm is developed to directly reconstruct the high resolution bases from these dual-energy CBCT projections containing sub-pixel shifts. Numerical and physical experiments are performed to validate this newly developed suRi method with phantoms and biological specimen. Results demonstrate that suRi can significantly improve the spatial resolution of the CBCT image. We believe this developed suRi method would greatly enhance the imaging performance of the DL-FPD based dual-energy CBCT systems in future.

X-ray computed tomography (CT) has been broadly adopted in clinical applications for disease diagnosis and image-guided interventions. However, metals within patients always cause unfavorable artifacts in the recovered CT images. Albeit attaining promising reconstruction results for this metal artifact reduction (MAR) task, most of the existing deep-learning-based approaches have some limitations. The critical issue is that most of these methods have not fully exploited the important prior knowledge underlying this specific MAR task. Therefore, in this paper, we carefully investigate the inherent characteristics of metal artifacts which present rotationally symmetrical streaking patterns. Then we specifically propose an orientation-shared convolution representation mechanism to adapt such physical prior structures and utilize Fourier-series-expansion-based filter parametrization for modelling artifacts, which can finely separate metal artifacts from body tissues. By adopting the classical proximal gradient algorithm to solve the model and then utilizing the deep unfolding technique, we easily build the corresponding orientation-shared convolutional network, termed as OSCNet. Furthermore, considering that different sizes and types of metals would lead to different artifact patterns (e.g., intensity of the artifacts), to better improve the flexibility of artifact learning and fully exploit the reconstructed results at iterative stages for information propagation, we design a simple-yet-effective sub-network for the dynamic convolution representation of artifacts. By easily integrating the sub-network into the proposed OSCNet framework, we further construct a more flexible network structure, called OSCNet+, which improves the generalization performance. Through extensive experiments conducted on synthetic and clinical datasets, we comprehensively substantiate the effectiveness of our proposed methods. Code will be released at https://github.com/hongwang01/OSCNet.

The superiority of magnetic resonance (MR)-only radiotherapy treatment planning (RTP) has been well demonstrated, benefiting from the synthesis of computed tomography (CT) images which supplements electron density and eliminates the errors of multi-modal images registration. An increasing number of methods has been proposed for MR-to-CT synthesis. However, synthesizing CT images of different anatomical regions from MR images with different sequences using a single model is challenging due to the large differences between these regions and the limitations of convolutional neural networks in capturing global context information. In this paper, we propose a multi-scale tokens-aware Transformer network (MTT-Net) for multi-region and multi-sequence MR-to-CT synthesis in a single model. Specifically, we develop a multi-scale image tokens Transformer to capture multi-scale global spatial information between different anatomical structures in different regions. Besides, to address the limited attention areas of tokens in Transformer, we introduce a multi-shape window self-attention into Transformer to enlarge the receptive fields for learning the multi-directional spatial representations. Moreover, we adopt a domain classifier in generator to introduce the domain knowledge for distinguishing the MR images of different regions and sequences. The proposed MTT-Net is evaluated on a multi-center dataset and an unseen region, and remarkable performance was achieved with MAE of 69.33 ± 10.39 HU, SSIM of 0.778 ± 0.028, and PSNR of 29.04 ± 1.32 dB in head & neck region, and MAE of 62.80 ± 7.65 HU, SSIM of 0.617 ± 0.058 and PSNR of 25.94 ± 1.02 dB in abdomen region. The proposed MTT-Net outperforms state-of-the-art methods in both accuracy and visual quality.

Supervised deep-learning techniques with paired training datasets have been widely studied for low-dose computed tomography (LDCT) imaging with excellent performance. However, the paired training datasets are usually difficult to obtain in clinical routine, which restricts the wide adoption of supervised deep-learning techniques in clinical practices. To address this issue, a general idea is to construct a pseudo paired training dataset based on the widely available unpaired data, after which, supervised deep-learning techniques can be adopted for improving the LDCT imaging performance by training on the pseudo paired training dataset. However, due to the complexity of noise properties in CT imaging, the LDCT data are difficult to generate in order to construct the pseudo paired training dataset. In this article, we propose a simple yet effective cross-domain unpaired learning framework for pseudo LDCT data generation and LDCT image reconstruction, which is denoted as CrossDuL. Specifically, a dedicated pseudo LDCT sinogram generative module is constructed based on a data-dependent noise model in the sinogram domain, and then instead of in the sinogram domain, a pseudo paired dataset is constructed in the image domain to train an LDCT image restoration module. To validate the effectiveness of the proposed framework, clinical datasets are adopted. Experimental results demonstrate that the CrossDuL framework can obtain promising LDCT imaging performance in both quantitative and qualitative measurements.

Deep learning (DL)-based methods show great potential in computed tomography (CT) imaging field. The DL-based reconstruction methods are usually evaluated on the training and testing datasets which are obtained from the same distribution, i.e., the same CT scan protocol (i.e., the region setting, kVp, mAs, etc.). In this work, we focus on analyzing the robustness of the DL-based methods against protocol-specific distribution shifts (i.e., the training and testing datasets are from different region settings, different kVp settings, or different mAs settings, respectively). The results show that the DL-based reconstruction methods are sensitive to the protocol-specific perturbations which can be attributed to the noise distribution shift between the training and testing datasets. Based on these findings, we presented a low-dose CT reconstruction method using an unsupervised strategy with the consideration of noise distribution to address the issue of protocol-specific perturbations. Specifically, unpaired sinogram data is enrolled into the network training, which represents unique information for specific imaging protocol, and a Gaussian mixture model (GMM) is introduced to characterize the noise distribution in CT images. It can be termed as GMM based unsupervised CT reconstruction network (GMM-unNet) method. Moreover, an expectation-maximization algorithm is designed to optimize the presented GMM-unNet method. Extensive experiments are performed on three datasets from different scan protocols, which demonstrate that the presented GMM-unNet method outperforms the competing methods both qualitatively and quantitatively.

X-ray computed tomography (CT) is widely used clinically to diagnose a variety of diseases by reconstructing the tomographic images of a living subject using penetrating X-rays. For accurate CT image reconstruction, a precise imaging geometric model for the radiation attenuation process is usually required to solve the inversion problem of CT scanning, which encodes the subject into a set of intermediate representations in different angular positions. Here, we show that accurate CT image reconstruction can be subsequently achieved by downsampled imaging geometric modeling via deep-learning techniques. Specifically, we first propose a downsampled imaging geometric modeling approach for the data acquisition process and then incorporate it into a hierarchical neural network, which simultaneously combines both geometric modeling knowledge of the CT imaging system and prior knowledge gained from a data-driven training process for accurate CT image reconstruction. The proposed neural network is denoted as DSigNet, i.e., downsampled-imaging-geometry-based network for CT image reconstruction. We demonstrate the feasibility of the proposed DSigNet for accurate CT image reconstruction with clinical patient data. In addition to improving the CT image quality, the proposed DSigNet might help reduce the computational complexity and accelerate the reconstruction speed for modern CT imaging systems.

Deep learning (DL) is bringing a big movement in the field of computed tomography (CT) imaging. In general, DL for CT imaging can be applied by processing the projection or the image data with trained deep neural networks (DNNs), unrolling the iterative reconstruction as a DNN for training, or training a well-designed DNN to directly reconstruct the image from the projection. In all of these applications, the whole or part of the DNNs work in the projection or image domain alone or in combination. In this study, instead of focusing on the projection or image, we train DNNs to reconstruct CT images from the view-by-view backprojection tensor (VVBP-Tensor). The VVBP-Tensor is the 3D data before summation in backprojection. It contains structures of the scanned object after applying a sorting operation. Unlike the image or projection that provides compressed information due to the integration/summation step in forward or back projection, the VVBP-Tensor provides lossless information for processing, allowing the trained DNNs to preserve fine details of the image. We develop a learning strategy by inputting slices of the VVBP-Tensor as feature maps and outputting the image. Such strategy can be viewed as a generalization of the summation step in conventional filtered backprojection reconstruction. Numerous experiments reveal that the proposed VVBP-Tensor domain learning framework obtains significant improvement over the image, projection, and hybrid projection-image domain learning frameworks. We hope the VVBP-Tensor domain learning framework could inspire algorithm development for DL-based CT imaging.

To characterize intra-tumor heterogeneity comprehensively, we propose a multi-level fusion strategy to combine PET and CT information at the image-, matrix-and feature-levels towards improved prognosis. Specifically, we developed fusion radiomics in the context of 3 prognostic outcomes in a multi-center setting (4 centers) involving 296 head & neck cancer patients. Eight clinical parameters were first utilized to build a (1) clinical model. We also built models by extracting 127 radiomics features from (2) PET images alone; (3-8) PET and CT images fused via wavelet-based fusion (WF) using CT-weights of 0.2, 0.4, 0.6 and 0.8, gradient transfer fusion (GTF), and guided filtering-based fusion (GFF); (9) fused matrices (sumMat); (10-11) fused features constructed via feature averaging (avgFea) and feature concatenation (conFea); and finally, (12) CT images alone; above models were also expanded to include both clinical and radiomics features. Seven variations of training and testing partitions were investigated. Highest performance in 5, 6 and 5 partitions was achieved by image-level fusion strategies for RFS, MFS and OS prediction, respectively. Among all partitions, WF0.6 and WF0.8 showed significantly higher performance than CT model for RFS (C-index: 0.60 ± 0.04 vs. 0.56 ± 0.03, p-value: 0.015) and MFS (C-index: 0.71 ± 0.13 vs. 0.62 ± 0.08, p-value: 0.020) predictions, respectively. In partition CER 23 vs. 14, WF0.6 significantly outperformed Clinical model for RFS prediction (C-index: 0.67 vs. 0.53, p-value: 0.003); both avgFea and WF0.6 showed C-index of 0.64 and significantly higher than that of PET only (C-index: 0.51, p-value: 0.018 and 0.031, respectively) for OS prediction. Fusion radiomics modeling showed varying improvements compared to single modality models for different outcome predictions in different partitions, highlighting the importance of generalizing radiomics models. Image-level fusion holds potential to capture more useful characteristics.

The Radon transform is widely used in physical and life sciences, and one of its major applications is in medical X-ray computed tomography (CT), which is significantly important in disease screening and diagnosis. In this paper, we propose a novel reconstruction framework for Radon inversion with deep learning (DL) techniques. For simplicity, the proposed framework is denoted as iRadonMAP, i.e., inverse Radon transform approximation. Specifically, we construct an interpretable neural network that contains three dedicated components. The first component is a fully connected filtering (FCF) layer along the rotation angle direction in the sinogram domain, and the second one is a sinusoidal back-projection (SBP) layer, which back-projects the filtered sinogram data into the spatial domain. Next, a common network structure is added to further improve the overall performance. iRadonMAP is first pretrained on a large number of generic images from the ImageNet database and then fine-tuned with clinical patient data. The experimental results demonstrate the feasibility of the proposed iRadonMAP framework for Radon inversion.

Photon counting computed tomography (PCCT) has the ability to identify individual photons, resulting in quantitative material identification. Meanwhile, several technical challenges still exist in current PCCT imaging systems, including increased noise and suboptimal bin selection. These nonideal effects can substantially degrade the reconstruction performance and material estimation accuracy. To address these issues, in this work, we present a novel system for high-performance spectral PCCT imaging, which is a combination of multiple dynamic modulations, interpolation-based measurements processing strategy and advanced reconstruction method. For simplicity, this new PCCT imaging system is referred to as "MDM-PCCT". Specifically, the multiple dynamic modulations consist of dynamic kVp modulation, dynamic spectrum modulation and dynamic energy threshold modulation. In the dynamic kVp modulation, three kVp values, i.e., 80, 110 and 140, are included, and the tube voltage waveform follows a sinusoidal curve which is more practical than the rectangular curve in the fast kV switching mode. In the dynamic spectrum modulation, the X-ray spectra are processed by selective spatial-spectral filters to balance the X-ray fluxes and increase the spectral separation. In the dynamic energy threshold modulation, the energy threshold is adaptively changed to determine the optimal bin selection. Furthermore, we propose an energy threshold determination method and interpolation-based measurements processing strategy to address the issue of non-uniform and sparse-view PCCT measurements, respectively. In addition, by considering the intrinsic characteristics of the MDM-PCCT images, we utilize an enhanced total variation regularized model for images reconstruction. Finally, numerical and preclinical studies demonstrate that the presented MDM-PCCT imaging system is capable of yielding uniform and high-fidelity PCCT measurements with noise consistency, and the presented reconstruction method further improves the image quality and material decomposition accuracy.

For decades, commercial X-ray computed tomography (CT) scanners have been using the filtered backprojection (FBP) algorithm for image reconstruction. However, the desire for lower radiation doses has pushed the FBP algorithm to its limit. Previous studies have made significant efforts to improve the results of FBP through preprocessing the sinogram, modifying the ramp filter, or postprocessing the reconstructed images. In this paper, we focus on analyzing and processing the stacked view-by-view backprojections (named VVBP-Tensor) in the FBP algorithm. A key challenge for our analysis lies in the radial structures in each backprojection slice. To overcome this difficulty, a sorting operation was introduced to the VVBP-Tensor in its z direction (the direction of the projection views). The results show that, after sorting, the tensor contains structures that are similar to those of the object, and structures in different slices of the tensor are correlated. We then analyzed the properties of the VVBP-Tensor, including structural self-similarity, tensor sparsity, and noise statistics. Considering these properties, we have developed an algorithm using the tensor singular value decomposition (named VVBP-tSVD) to denoise the VVBP-Tensor for low-mAs CT imaging. Experiments were conducted using a physical phantom and clinical patient data with different mAs levels. The results demonstrate that the VVBP-tSVD is superior to all competing methods under different reconstruction schemes, including sinogram preprocessing, image postprocessing, and iterative reconstruction. We conclude that the VVBP-Tensor is a suitable processing target for improving the quality of FBP reconstruction, and the proposed VVBP-tSVD is an effective algorithm for noise reduction in low-mAs CT imaging. This preliminary work might provide a heuristic perspective for reviewing and rethinking the FBP algorithm.

Energy-resolved computed tomography (ErCT) with a photon counting detector concurrently produces multiple CT images corresponding to different photon energy ranges. It has the potential to generate energy-dependent images with improved contrast-to-noise ratio and sufficient material-specific information. Since the number of detected photons in one energy bin in ErCT is smaller than that in conventional energy-integrating CT (EiCT), ErCT images are inherently more noisy than EiCT images, which leads to increased noise and bias in the subsequent material estimation. In this work, we first deeply analyze the intrinsic tensor properties of two-dimensional (2D) ErCT images acquired in different energy bins and then present a F ull- S pectrum-knowledge-aware Tensor analysis and processing (FSTensor) method for ErCT reconstruction to suppress noise-induced artifacts to obtain high-quality ErCT images and high-accuracy material images. The presented method is based on three considerations: (1) 2D ErCT images obtained in different energy bins can be treated as a 3-order tensor with three modes, i.e., width, height and energy bin, and a rich global correlation exists among the three modes, which can be characterized by tensor decomposition. (2) There is a locally piecewise smooth property in the 3-order ErCT images, and it can be captured by a tensor total variation regularization. (3) The images from the full spectrum are much better than the ErCT images with respect to noise variance and structural details and serve as external information to improve the reconstruction performance. We then develop an alternating direction method of multipliers algorithm to numerically solve the presented FSTensor method. We further utilize a genetic algorithm to tackle the parameter selection in ErCT reconstruction, instead of manually determining parameters. Simulation, preclinical and synthesized clinical ErCT results demonstrate that the presented FSTensor method leads to significant improvements over the filtered back-projection, robust principal component analysis, tensor-based dictionary learning and low-rank tensor decomposition with spatial-temporal total variation methods.

Markov random field (MRF) has been widely used to incorporate a priori knowledge as penalty or regularizer to preserve edge sharpness while smoothing the region enclosed by the edge for pieces-wise smooth image reconstruction. In our earlier study, we proposed a type of MRF reconstruction method for low-dose CT (LdCT) scans using tissue-specific textures extracted from the same patient's previous full-dose CT (FdCT) scans as prior knowledge. It showed advantages in clinical applications. This paper aims to remove the constraint of using previous data of the same patient. We investigated the feasibility of extracting the tissue-specific MRF textures from an FdCT database to reconstruct a LdCT image of another patient. This feasibility study was carried out by experiments designed as follows. We constructed a tissue-specific MRF-texture database from 3990 FdCT scan slices of 133 patients who were scheduled for lung nodule biopsy. Each patient had one FdCT scan (120 kVp/100 mAs) and one LdCT scan (120 kVp/20 mAs) prior to biopsy procedure. When reconstructing the LdCT image of one patient among the 133 patients, we ranked the closeness of the MRF-textures from the other 132 patients saved in the database and used them as the a prior knowledge. Then, we evaluated the reconstructed image quality using Haralick texture measures. For any patient within our database, we found more than eighteen patients' FdCT MRF texures can be used without noticeably changing the Haralick texture measures on the lung nodules (to be biopsied). These experimental outcomes indicate it is promising that a sizable FdCT texture database could be used to enhance Bayesian reconstructions of any incoming LdCT scans.

Reducing the exposure to X-ray radiation while maintaining a clinically acceptable image quality is desirable in various CT applications. To realize low-dose CT (LdCT) imaging, model-based iterative reconstruction (MBIR) algorithms are widely adopted, but they require proper prior knowledge assumptions in the sinogram and/or image domains and involve tedious manual optimization of multiple parameters. In this paper, we propose a deep learning (DL)-based strategy for MBIR to simultaneously address prior knowledge design and MBIR parameter selection in one optimization framework. Specifically, a parameterized plug-and-play alternating direction method of multipliers (3pADMM) is proposed for the general penalized weighted least-squares model, and then, by adopting the basic idea of DL, the parameterized plug-and-play (3p) prior and the related parameters are optimized simultaneously in a single framework using a large number of training data. The main contribution of this paper is that the 3p prior and the related parameters in the proposed 3pADMM framework can be supervised and optimized simultaneously to achieve robust LdCT reconstruction performance. Experimental results obtained on clinical patient datasets demonstrate that the proposed method can achieve promising gains over existing algorithms for LdCT image reconstruction in terms of noise-induced artifact suppression and edge detail preservation.

Cerebrovascular diseases, i.e., acute stroke, are a common cause of serious long-term disability. Cerebral perfusion computed tomography (CPCT) can provide rapid, high-resolution, quantitative hemodynamic maps to assess and stratify perfusion in patients with acute stroke symptoms. However, CPCT imaging typically involves a substantial radiation dose due to its repeated scanning protocol. Therefore, in this paper, we present a low-dose CPCT image reconstruction method to yield high-quality CPCT images and high-precision hemodynamic maps by utilizing the great similarity information among the repeated scanned CPCT images. Specifically, a newly developed low-rank tensor decomposition with spatial-temporal total variation (LRTD-STTV) regularization is incorporated into the reconstruction model. In the LRTD-STTV regularization, the tensor Tucker decomposition is used to describe global spatial-temporal correlations hidden in the sequential CPCT images, and it is superior to the matricization model (i.e., low-rank model) that fails to fully investigate the prior knowledge of the intrinsic structures of the CPCT images after vectorizing the CPCT images. Moreover, the spatial-temporal TV regularization is used to characterize the local piecewise smooth structure in the spatial domain and the pixels' similarity with the adjacent frames in the temporal domain, because the intensity at each pixel in CPCT images is similar to its neighbors. Therefore, the presented LRTD-STTV model can efficiently deliver faithful underlying information of the CPCT images and preserve the spatial structures. An efficient alternating direction method of multipliers algorithm is also developed to solve the presented LRTD-STTV model. Extensive experimental results on numerical phantom and patient data are clearly demonstrated that the presented model can significantly improve the quality of CPCT images and provide accurate diagnostic features in hemodynamic maps for low-dose cases compared with the existing popular algorithms.

In low dose computed tomography (LDCT) imaging, the data inconsistency of measured noisy projections can significantly deteriorate reconstruction images. To deal with this problem, we propose here a new sinogram restoration approach, the sinogram- discriminative feature representation (S-DFR) method. Different from other sinogram restoration methods, the proposed method works through a 3-D representation-based feature decomposition of the projected attenuation component and the noise component using a well-designed composite dictionary containing atoms with discriminative features. This method can be easily implemented with good robustness in parameter setting. Its comparison to other competing methods through experiments on simulated and real data demonstrated that the S-DFR method offers a sound alternative in LDCT.

Computed tomography (CT) image recovery from low-mAs acquisitions without adequate treatment is always severely degraded due to a number of physical factors. In this paper, we formulate the low-dose CT sinogram preprocessing as a standard maximum a posteriori (MAP) estimation, which takes full consideration of the statistical properties of the two intrinsic noise sources in low-dose CT, i.e., the X-ray photon statistics and the electronic noise background. In addition, instead of using a general image prior as found in the traditional sinogram recovery models, we design a new prior formulation to more rationally encode the piecewise-linear configurations underlying a sinogram than previously used ones, like the TV prior term. As compared with the previous methods, especially the MAP-based ones, both the likelihood/loss and prior/regularization terms in the proposed model are ameliorated in a more accurate manner and better comply with the statistical essence of the generation mechanism of a practical sinogram. We further construct an efficient alternating direction method of multipliers algorithm to solve the proposed MAP framework. Experiments on simulated and real low-dose CT data demonstrate the superiority of the proposed method according to both visual inspection and comprehensive quantitative performance evaluation.

Dynamic cerebral perfusion computed tomography (DCPCT) has the ability to evaluate the hemodynamic information throughout the brain. However, due to multiple 3-D image volume acquisitions protocol, DCPCT scanning imposes high radiation dose on the patients with growing concerns. To address this issue, in this paper, based on the robust principal component analysis (RPCA, or equivalently the low-rank and sparsity decomposition) model and the DCPCT imaging procedure, we propose a new DCPCT image reconstruction algorithm to improve low-dose DCPCT and perfusion maps quality via using a powerful measure, called Kronecker-basis-representation tensor sparsity regularization, for measuring low-rankness extent of a tensor. For simplicity, the first proposed model is termed tensor-based RPCA (T-RPCA). Specifically, the T-RPCA model views the DCPCT sequential images as a mixture of low-rank, sparse, and noise components to describe the maximum temporal coherence of spatial structure among phases in a tensor framework intrinsically. Moreover, the low-rank component corresponds to the "background" part with spatial-temporal correlations, e.g., static anatomical contribution, which is stationary over time about structure, and the sparse component represents the time-varying component with spatial-temporal continuity, e.g., dynamic perfusion enhanced information, which is approximately sparse over time. Furthermore, an improved nonlocal patch-based T-RPCA (NL-T-RPCA) model which describes the 3-D block groups of the "background" in a tensor is also proposed. The NL-T-RPCA model utilizes the intrinsic characteristics underlying the DCPCT images, i.e., nonlocal self-similarity and global correlation. Two efficient algorithms using alternating direction method of multipliers are developed to solve the proposed T-RPCA and NL-T-RPCA models, respectively. Extensive experiments with a digital brain perfusion phantom, preclinical monkey data, and clinical patient data clearly demonstrate that the two proposed models can achieve more gains than the existing popular algorithms in terms of both quantitative and visual quality evaluations from low-dose acquisitions, especially as low as 20 mAs.

Markov random field (MRF) model has been widely employed in edge-preserving regional noise smoothing penalty to reconstruct piece-wise smooth images in the presence of noise, such as in low-dose computed tomography (LdCT). While it preserves edge sharpness, its regional smoothing may sacrifice tissue image textures, which have been recognized as useful imaging biomarkers, and thus it may compromise clinical tasks such as differentiating malignant vs. benign lesions, e.g., lung nodules or colon polyps. This study aims to shift the edge-preserving regional noise smoothing paradigm to texture-preserving framework for LdCT image reconstruction while retaining the advantage of MRF's neighborhood system on edge preservation. Specifically, we adapted the MRF model to incorporate the image textures of muscle, fat, bone, lung, etc. from previous full-dose CT (FdCT) scan as a priori knowledge for texture-preserving Bayesian reconstruction of current LdCT images. To show the feasibility of the proposed reconstruction framework, experiments using clinical patient scans were conducted. The experimental outcomes showed a dramatic gain by the a priori knowledge for LdCT image reconstruction using the commonly-used Haralick texture measures. Thus, it is conjectured that the texture-preserving LdCT reconstruction has advantages over the edge-preserving regional smoothing paradigm for texture-specific clinical applications.

In the above paper (IEEE Trans. on Medical Imaging, vol. 35, no. 6, Mar. 2016, pp. 860-870), the first footnote should have noted the following information. Hao Zhang, Hao Han contributed equally to this work. Zhengrong Liang is the corresponding author.

Previous studies have shown that by minimizing the total variation (TV) of the to-be-estimated image with some data and/or other constraints, a piecewise-smooth X-ray computed tomography image can be reconstructed from sparse-view projection data. However, due to the piecewise constant assumption for the TV model, the reconstructed images are frequently reported to suffer from the blocky or patchy artifacts. To eliminate this drawback, we present a total variation-stokes-projection onto convex sets (TVS-POCS) reconstruction method in this paper. The TVS model is derived by introducing isophote directions for the purpose of recovering possible missing information in the sparse-view data situation. Thus the desired consistencies along both the normal and the tangent directions are preserved in the resulting images. Compared to the previous TV-based image reconstruction algorithms, the preserved consistencies by the TVS-POCS method are expected to generate noticeable gains in terms of eliminating the patchy artifacts and preserving subtle structures. To evaluate the presented TVS-POCS method, both qualitative and quantitative studies were performed using digital phantom, physical phantom and clinical data experiments. The results reveal that the presented method can yield images with several noticeable gains, measured by the universal quality index and the full-width-at-half-maximum merit, as compared to its corresponding TV-based algorithms. In addition, the results further indicate that the TVS-POCS method approaches to the gold standard result of the filtered back-projection reconstruction in the full-view data case as theoretically expected, while most previous iterative methods may fail in the full-view case because of their artificial textures in the results.

In the above-named article [ibid., vol. 33, no. 3, pp. 749-763, Mar. 2014], Y. Liu was incorrectly listed as the corresponding author. Z. Liang should have been indicated as the corresponding author.

Because the medical CT scanner is rapidly evolving from fan-beam to cone-beam geometry, we motivate to take advantages of Noo's formula for cone-beam reconstruction with higher temporal resolution. Feldkampetal.proposed a practical cone-beam reconstruction algorithm for full scan data collected on a circular locus in 1984. It is known that the Feldkamp-type reconstruction framework is compatible with any fan-beam reconstruction formula. Therefore, the Noo's formula can be generalized into Feldkamp-type algorithm for the satisfactory reconstruction of a volume of interest (VOI). Our method is the first attempt to combines the pseudo-lambda tomography (PLT) and Feldkamp-type algorithm together. Simulation using the 3D differentiable Shepp-Logan phantom is performed demonstrate the utility of this technique.

We propose an improved super-short-scan reconstruction algorithm for fan-beam computed tomography based on pi-lines in this paper. Within the framework of the classic FBP algorithm, this new algorithm can achieve exact reconstruction of the region of interest (ROI), if and only if all lines passing through the ROI intersect the source trajectory. The new reconstruction formula successfully avoids the direct derivative of projection data and is expressed as the combination of Hilbert filter and Ramp filter rather than weighted Hilbert filter. This helps increase the numerical stability and improves the quality of reconstructed images, as the real data reconstruction involves discrete data. A preliminary computer simulation study has been done, and a comparison with other classic super-short-scan reconstruction algorithms proves the validation of this new algorithm.

Since the ionizing radiation may induce cancers and genetic damages in the patient, it is highly desirable to minimize the X-ray dose during a CT scan. As one of the local imaging techniques, the Lambda imaging reduces the X-ray dose and imaging time. But the existence of the singular values results in the low quality of the image. The broad applications of the Pi-lines proof that it can deal with the truncated projections effectively. In this work, we propose a new exact Lambda imaging algorithm based on Wang G's local imaging method and Pi-lines segment to reconstruct an image with utilizing a Gaussian kernel function convoluting the projection data. We also analyze how to choose the parameters of the Gaussian kernel function. Numerical simulations support our new reconstruction algorithm with high quality reconstruction image.