Sparse-view computed tomography (SVCT) offers the advantages of accelerated scanning and reduced X-ray radiation dose in different clinical applications. However, it faces a challenge due to incomplete data acquisition, resulting in streak artifacts in the analytically reconstructed CT images. Utilizing self-supervised learning, implicit neural representation (INR) recently has shown great promise in addressing inverse problems such as SVCT reconstruction. Nonetheless, given that the input of original INR only contains coordinate information, it is limited to represent one SVCT instance at a time, and its performance significantly declines when performing cross-instance reconstruction. In this study, we propose a novel self-supervised framework named VFMINR, which leverages generalizable representations extracted from the visual foundation models (VFMs) to tackle the cross-instance reconstruction issue of INR. Specifically, VFMINR first utilizes VFMs to effectively capture the spatial and frequency domain representations of sinograms, and then a fusion module is applied to fuse two domain features into complementary representations. This combination maximizes the utilization of local detail information from the spatial domain and the global structural information from the frequency domain. Subsequently, an adaptive cell decoding strategy is designed to map representations into variable resolution hybrid feature grids, which are integrated into the learning of the INR to enhance its generalizability for different SVCT instances. The VFMs and VFMINR are trained by using only SV sinogram data, and extensive results confirm that the proposed method can effectively handle the generalization problem of INR, while achieving superior performance in image fidelity and artifact suppression. The code is available at: https://github.com/nightastars/VFMINR-main.

Sparse-View CT (SVCT) reconstruction improves temporal resolution and reduces radiation dose, yet its clinical use is hindered by artifacts due to view reduction and domain shifts from scanner, protocol, or anatomical variations, leading to performance degradation in out-of-distribution (OOD) scenarios. We propose a Cross-Distribution Diffusion Priors-Driven Iterative Reconstruction (CDPIR) framework to tackle the OOD problem in SVCT. CDPIR integrates cross-distribution diffusion priors, derived from a Scalable Interpolant Transformer (SiT), with model-based iterative reconstruction methods. Specifically, we train a SiT backbone, an extension of the Diffusion Transformer (DiT) architecture, to establish a unified stochastic interpolant framework, leveraging Classifier-Free Guidance (CFG) across multiple datasets. By randomly dropping the conditioning with a null embedding during training, the model learns a more transferable cross-distribution prior that encourages domain-invariant anatomical structures while allowing domain-specific appearance modulation. During sampling, the globally sensitive transformer-based diffusion model exploits the cross-distribution prior within the unified stochastic interpolant framework, enabling flexible and stable control over multi-distribution-to-noise interpolation paths and decoupled sampling strategies, thereby improving adaptation to OOD reconstruction. By alternating between data fidelity and sampling updates, our model achieves state-of-the-art performance with superior detail preservation in SVCT reconstructions. Extensive experimental results demonstrate that CDPIR significantly outperforms existing approaches, particularly under OOD conditions, highlighting its robustness and potential clinical value in challenging imaging scenarios. The code is available at https://github.com/Graeme-Lee/CDPIR.

The latest X-ray photon-counting computed tomography (PCCT) for extremity allows multi-energy high-resolution (HR) imaging for tissue characterization and material decomposition. However, both radiation dose and imaging speed need improvement for contrast-enhanced and other studies. Despite the success of deep learning methods for 2D few-view reconstruction, applying them to HR volumetric reconstruction of extremity scans for clinical diagnosis has been limited due to GPU memory constraints, training data scarcity, and domain gap issues. In this paper, we propose a deep learning-based approach for PCCT image reconstruction at halved dose and doubled speed in a New Zealand clinical trial. Particularly, we present a patch-based volumetric refinement network to alleviate the GPU memory limitation, train network with synthetic data, and use model-based iterative refinement to bridge the gap between synthetic and real-world data. The simulation and phantom experiments demonstrate consistently improved results under different acquisition conditions on both in- and off-domain structures using a fixed network. The image quality of 8 patients from the clinical trial are evaluated by three radiologists in comparison with the standard image reconstruction with a full-view dataset. It is shown that our proposed approach is essentially identical to or better than the clinical benchmark in terms of diagnostic image quality scores. Our approach has a great potential to improve the safety and efficiency of PCCT without compromising image quality.

Limited-angle computed tomography (LACT) improves temporal resolution and reduces radiation dose, but suffers from severe artifacts due to missing projections. Clinical workflows record abundant patient- and acquisition-level metadata, yet such information remains underutilized in image reconstruction. To tackle the ill-posed LACT inverse problem, we propose a metadata-guided two-stage diffusion framework that leverages structured clinical contexts as semantic priors for robust reconstruction. In Stage-I, we learn a metadata-to-anatomy generative prior by conditioning a transformer-based diffusion model on clinical metadata (acquisition parameters, patient demographics, and diagnostic impressions), and sampling a coarse anatomical estimate from Gaussian noise. In Stage-II, a second conditional diffusion model performs coarse-to-fine refinement, using the Stage-I estimate as an image prior while re-injecting the same metadata to recover full-resolution anatomy. To preserve anatomical fidelity and suppress hallucinations, projection-domain data consistency is enforced periodically after denoising update via an ADMM-based solver. Experiments on the public multimodal CTRATE dataset demonstrate that the proposed framework outperforms iterative, CNN-based, and diffusion-based baselines, with the greatest gains under severe truncation, e.g., up to 5.23%/11.21% higher SSIM/PSNR than the strongest metadata-free diffusion competitor at 90°. On real clinical cardiac CT, it yields coronary artery calcium scores closer to full-view references, indicating improved clinical utility. Furthermore, the proposed method is generalized to out-of-distribution angular ranges and projection geometries, and ablation results confirm complementary contributions from different metadata types under limited-angle conditions. Our results highlight clinical metadata as actionable semantic priors to synergize with physics-informed constraints to improve both reconstruction fidelity and clinical quantification in LACT.

Cone-beam Computed Tomography (CBCT) provides real-time three-dimensional (3D) imaging support for intraoperative navigation. However, high-attenuation metal implants introduce severe metal artifacts in reconstructed CBCT images. These artifacts compromise image quality and therefore may affect diagnostic accuracy. Current CBCT metal artifact reduction (MAR) algorithms overlook the complementary information available across CBCT views, leading to inaccurate projection-domain interpolation and secondary artifacts in the reconstructed images. To tackle these challenges, we propose a novel Unsupervised Projection-domain Multiview Constraint Learning Network (UPMCL-Net), which directly learns from metal-affected data for CBCT MAR without ground truths. In addition, a transformer-based MultiView Consistency Module (MVCM) is constructed to interpolate the projection-domain metal region for cross-view consistency. Finally, a Hybrid Feature Attention Module (HFAM) is designed to adaptively fuse interview and intraview features. Comprehensive experiments conducted on real clinical datasets confirm the performance of UPMCL-Net, showcasing its potential as an efficient, accurate, and reliable approach for CBCT MAR in clinical intraoperative interventions.

With the advancement of computer graphics techniques, the gaming industry has generated a growing array of computer graphics images (CGIs) featuring complex and various textures that are shown on devices with different resolution capacities. However, some CGIs encounter graphic distortions due to limitations in rendering precision that substantially diminishes user experiences. It is important to evaluate the quality of CGIs in an effective way. Meanwhile, current assessment techniques are not good enough because game pictures have intricate textures and considerable resolution variations. In this paper, a novel blind image quality assessment (IQA) method is proposed, which employs image saliency and resolution information to improve its ability to detect the quality of distorted texture features. Experimental results in game-related IQA datasets demonstrate enhanced prediction accuracy, robustness and generalizability of the proposed method.

This paper introduces ρ-NeRF, a novel approach that integrates attenuation priors into neural radiance fields, setting a new benchmark in novel view synthesis (NVS) and computed tomography (CT) reconstruction. ρ-NeRF models a continuous volumetric radiance field enriched with physics-based attenuation priors, representing a three-dimensional (3D) volume through a fully connected neural network. The model takes a single four-dimensional (4D) coordinate—spatial location (x, y, z) and an initialized attenuation value (ρ)—and outputs the attenuation coefficient at that position. By querying these 4D coordinates along X-ray paths, the classic forward projection technique integrates attenuation data across the 3D space. Matching and refining pre-initialized attenuation values from traditional reconstruction algorithms, like Feldkamp-Davis-Kress algorithm (FDK) or conjugate gradient least squares (CGLS), ρ-NeRF enhances both projection synthesis and image reconstruction with minimal computational overhead. This paper details the optimization of ρ-NeRF for accurate NVS and high-quality CT reconstruction from limited projections, establishing a new standard for sparse-view CT applications.

Cardiac computed tomography (CT) has emerged as a major imaging modality for the diagnosis and monitoring of cardiovascular diseases. High temporal resolution is essential to ensure diagnostic accuracy. Limited-angle data acquisition can reduce scan time and improve temporal resolution, but typically leads to severe image degradation and motivates for improved reconstruction techniques. In this paper, we propose a novel physics-informed score-based diffusion model (PSDM) for limited-angle reconstruction of cardiac CT. At the sampling time, we combine a data prior from a diffusion model and a model prior obtained via an iterative algorithm and Fourier fusion to further enhance the image quality. Specifically, our approach integrates the primal-dual hybrid gradient (PDHG) algorithm with score-based diffusion models, thereby enabling us to reconstruct high-quality cardiac CT images from limited-angle data. The numerical simulations and real data experiments confirm the effectiveness of our proposed approach.

A neural network (NN) with the widely-used ReLU activation has been shown to partition the sample space into many convex polytopes for prediction. However, the parametric way a NN and other machine learning models use to partition the space has imperfections, e.g., the compromised interpretability for complex models, the inflexibility in decision boundary construction due to the generic character of the model, and the risk of being trapped into shortcut solutions. In contrast, although the nonparameterized models can adorably avoid or downplay these issues, they are usually insufficiently powerful either due to over-simplification or the failure to accommodate the manifold structures of data. In this context, we first propose a new type of machine learning models referred to as Manifoldron that directly derives decision boundaries from data and partitions the space via manifold structure discovery. Then, we systematically analyze the key characteristics of the Manifoldron such as manifold characterization capability and its link to NNs. The experimental results on four synthetic examples, 20 public benchmark datasets, and one real-world application demonstrate that the proposed Manifoldron performs competitively compared to the mainstream machine learning models. We have shared our code in https://github.com/wdayang/Manifoldron for free download and evaluation.

Limited-angle tomographic reconstruction is one of the typical ill-posed inverse problems, leading to edge divergence with degraded image quality. Recently, deep learning has been introduced into image reconstruction and achieved great results. However, existing deep reconstruction methods have not fully explored data consistency, resulting in poor performance. In addition, deep reconstruction methods are still mathematically inexplicable and unstable. In this work, we propose an iterative residual optimization network (IRON) for limited-angle tomographic reconstruction. First, a new optimization objective function is established to overcome false negative and positive artifacts induced by limited-angle measurements. We integrate neural network priors as a regularizer to explore deep features within residual data. Furthermore, the block-coordinate descent is employed to achieve a novel iterative framework. Second, a convolution assisted transformer is carefully elaborated to capture both local and long-range pixel interactions simultaneously. Regarding the visual transformer, the multi-head attention is further redesigned to reduce computational costs and protect reconstructed image features. Third, based on the relative error convergence property of the convolution assisted transformer, a mathematical convergence analysis is also provided for our IRON. Both numerically simulated and clinically collected real cardiac datasets are employed to validate the effectiveness and advantages of the proposed IRON. The results show that IRON outperforms other state-of-the-art methods.

Low-dose computed tomography (LDCT) offers reduced X-ray radiation exposure but at the cost of compromised image quality, characterized by increased noise and artifacts. Recently, transformer models emerged as a promising avenue to enhance LDCT image quality. However, the success of such models relies on a large amount of paired noisy and clean images, which are often scarce in clinical settings. In computer vision and natural language processing, masked autoencoders (MAE) have been recognized as a powerful self-pretraining method for transformers, due to their exceptional capability to extract representative features. However, the original pretraining and fine-tuning design fails to work in low-level vision tasks like denoising. In response to this challenge, we redesign the classical encoder-decoder learning model and facilitate a simple yet effective streamlined low-level vision MAE, referred to as LoMAE, tailored to address the LDCT denoising problem. Moreover, we introduce an MAE-GradCAM method to shed light on the latent learning mechanisms of the MAE/LoMAE. Additionally, we explore the LoMAE's robustness and generability across a variety of noise levels. Experimental findings show that the proposed LoMAE enhances the denoising capabilities of the transformer and substantially reduce their dependency on high-quality, ground-truth data. It also demonstrates remarkable robustness and generalizability over a spectrum of noise levels. In summary, the proposed LoMAE provides promising solutions to the major issues in LDCT including interpretability, ground truth data dependency, and model robustness/generalizability.

The prevailing understanding in the field of machine learning and deep learning (ML/DL) is that, given a highquality dataset, one can effectively learn data-related priors through supervised learning. However, in medical imaging, this assumption faces two critical challenges: 1) high-quality training data are often scarce and 2) data are highly heterogeneous, stemming from different imaging scanners, protocols, or populations at various institutions. This diversity makes it impractical to represent the data with a single, universal prior using traditional methods, leading to limited generalizability in medical imaging tasks.

Metal artifact reduction (MAR) is important for clinical diagnosis with CT images. The existing state-of-the-art deep learning methods usually suppress metal artifacts in sinogram or image domains or both. However, their performance is limited by the inherent characteristics of the two domains, i.e., the errors introduced by local manipulations in the sinogram domain would propagate throughout the whole image during backprojection and lead to serious secondary artifacts, while it is difficult to distinguish artifacts from actual image features in the image domain. To alleviate these limitations, this study analyzes the desirable properties of wavelet transform in-depth and proposes to perform MAR in the wavelet domain. First, wavelet transform yields components that possess spatial correspondence with the image, thereby preventing the spread of local errors to avoid secondary artifacts. Second, using wavelet transform could facilitate identification of artifacts from image since metal artifacts are mainly high-frequency signals. Taking these advantages of the wavelet transform, this paper decomposes an image into multiple wavelet components and introduces multi-perspective regularizations into the proposed MAR model. To improve the transparency and validity of the model, all the modules in the proposed MAR model are designed to reflect their mathematical meanings. In addition, an adaptive wavelet module is also utilized to enhance the flexibility of the model. To optimize the model, an iterative algorithm is developed. The evaluation on both synthetic and real clinical datasets consistently confirms the superior performance of the proposed method over the competing methods.

Improving the detection accuracy of pulmonary nodules plays an important role in the diagnosis and early treatment of lung cancer. In this paper, a multiscale aggregation network (MSANet), which integrates spatial and channel information, is proposed for 3D pulmonary nodule detection. MSANet is designed to improve the network's ability to extract information and realize multiscale information fusion. First, multiscale aggregation interaction strategies are used to extract multilevel features and avoid feature fusion interference caused by large resolution differences. These strategies can effectively integrate the contextual information of adjacent resolutions and help to detect different sized nodules. Second, the feature extraction module is designed for efficient channel attention and self-calibrated convolutions (ECA-SC) to enhance the interchannel and local spatial information. ECA-SC also recalibrates the features in the feature extraction process, which can realize adaptive learning of feature weights and enhance the information extraction ability of features. Third, the distribution ranking (DR) loss is introduced as the classification loss function to solve the problem of imbalanced data between positive and negative samples. The proposed MSANet is comprehensively compared with other pulmonary nodule detection networks on the LUNA16 dataset, and a CPM score of 0.920 is obtained. The results show that the sensitivity for detecting pulmonary nodules is improved and that the average number of false-positives is effectively reduced. The proposed method has advantages in pulmonary nodule detection and can effectively assist radiologists in pulmonary nodule detection.

Deep learning has attracted rapidly increasing attention in the field of tomographic image reconstruction, especially for CT, MRI, PET/SPECT, ultrasound and optical imaging. Among various topics, sparse-view CT remains a challenge which targets a decent image reconstruction from very few projections. To address this challenge, in this article we propose a Dual-domain Residual-based Optimization NEtwork (DRONE). DRONE consists of three modules respectively for embedding, refinement, and awareness. In the embedding module, a sparse sinogram is first extended. Then, sparse-view artifacts are effectively suppressed in the image domain. After that, the refinement module recovers image details in the residual data and image domains synergistically. Finally, the results from the embedding and refinement modules in the data and image domains are regularized for optimized image quality in the awareness module, which ensures the consistency between measurements and images with the kernel awareness of compressed sensing. The DRONE network is trained, validated, and tested on preclinical and clinical datasets, demonstrating its merits in edge preservation, feature recovery, and reconstruction accuracy.

X-ray computed tomography (CT) is of great clinical significance in medical practice because it can provide anatomical information about the human body without invasion, while its radiation risk has continued to attract public concerns. Reducing the radiation dose may induce noise and artifacts to the reconstructed images, which will interfere with the judgments of radiologists. Previous studies have confirmed that deep learning (DL) is promising for improving low-dose CT imaging. However, almost all the DL-based methods suffer from subtle structure degeneration and blurring effect after aggressive denoising, which has become the general challenging issue. This paper develops the Comprehensive Learning Enabled Adversarial Reconstruction (CLEAR) method to tackle the above problems. CLEAR achieves subtle structure enhanced low-dose CT imaging through a progressive improvement strategy. First, the generator established on the comprehensive domain can extract more features than the one built on degraded CT images and directly map raw projections to high-quality CT images, which is significantly different from the routine GAN practice. Second, a multi-level loss is assigned to the generator to push all the network components to be updated towards high-quality reconstruction, preserving the consistency between generated images and gold-standard images. Finally, following the WGAN-GP modality, CLEAR can migrate the real statistical properties to the generated images to alleviate over-smoothing. Qualitative and quantitative analyses have demonstrated the competitive performance of CLEAR in terms of noise suppression, structural fidelity and visual perception improvement.

X-ray Computed Tomography (CT) is widely used in clinical applications such as diagnosis and image-guided interventions. In this paper, we propose a new deep learning based model for CT image reconstruction with the backbone network architecture built by unrolling an iterative algorithm. However, unlike the existing strategy to include as many data-adaptive components in the unrolled dynamics model as possible, we find that it is enough to only learn the parts where traditional designs mostly rely on intuitions and experience. More specifically, we propose to learn an initializer for the conjugate gradient (CG) algorithm that involved in one of the subproblems of the backbone model. Other components, such as image priors and hyperparameters, are kept as the original design. Since a hypernetwork is introduced to inference on the initialization of the CG module, it makes the proposed model a certain meta-learning model. Therefore, we shall call the proposed model the meta-inversion network (MetaInv-Net). The proposed MetaInv-Net can be designed with much less trainable parameters while still preserves its superior image reconstruction performance than some state-of-the-art deep models in CT imaging. In simulated and real data experiments, MetaInv-Net performs very well and can be generalized beyond the training setting, i.e., to other scanning settings, noise levels, and data sets.

Latent Dirichlet Allocation (LDA) is a statistical approach for topic modeling with a wide range of applications. In spite of the significance, we observe very few attempts from system track to improve LDA, let alone the algorithm and system codesigned efforts. To this end, we propose eLDA with an algorithm-system codesigned optimization. Particularly, we introduce a novel three-branch sampling mechanism to taking advantage of the convergence heterogeneity of various tokens in order to reduce redundant sampling task. Our evaluation shows that eLDA outperforms the state-of-the-arts.

X-ray spectrum plays a very important role in dual energy computed tomography (DECT) reconstruction. Because it is difficult to measure x-ray spectrum directly in practice, efforts have been devoted into spectrum estimation by using transmission measurements. These measurement methods are independent of the image reconstruction, which bring extra cost and are time consuming. Furthermore, the estimated spectrum mismatch would degrade the quality of the reconstructed images. In this paper, we propose a spectrum estimation-guided iterative reconstruction algorithm for DECT which aims to simultaneously recover the spectrum and reconstruct the image. The proposed algorithm is formulated as an optimization framework combining spectrum estimation based on model spectra representation, image reconstruction, and regularization for noise suppression. To resolve the multi-variable optimization problem of simultaneously obtaining the spectra and images, we introduce the block coordinate descent (BCD) method into the optimization iteration. Both the numerical simulations and physical phantom experiments are performed to verify and evaluate the proposed method. The experimental results validate the accuracy of the estimated spectra and reconstructed images under different noise levels. The proposed method obtains a better image quality compared with the reconstructed images from the known exact spectra and is robust in noisy data applications.

Spectral computed tomography (CT) reconstructs material-dependent attenuation images from the projections of multiple narrow energy windows, which is meaningful for material identification and decomposition. Unfortunately, the multi-energy projection datasets usually have lower signal-noise ratios (SNR). Very recently, a spatial-spectral cube matching frame (SSCMF) was proposed to explore the non-local spatial-spectral similarities for spectral CT. This method constructs a group by clustering up a series of non-local spatial-spectral cubes. The small size of spatial patches for such a group makes the SSCMF fail to fully encode the sparsity and low-rank properties. The hard-thresholding and collaboration filtering in the SSCMF also cause difficulty in recovering the image features and spatial edges. While all the steps are operated on 4-D group, the huge computational cost and memory load might not be affordable in practice. To avoid the above limitations and further improve the image quality, we first formulate a non-local cube-based tensor instead of group to encode the sparsity and low-rank properties. Then, as a new regularizer, the Kronecker-basis-representation tensor factorization is employed into a basic spectral CT reconstruction model to enhance the capability of image feature extraction and spatial edge preservation, generating a non-local low-rank cube-based tensor factorization (NLCTF) method. Finally, the split-Bregman method is adopted to solve the NLCTF model. Both numerical simulations and preclinical mouse studies are performed to validate and evaluate the NLCTF algorithm. The results show that the NLCTF method outperforms the other state-of-the-art competing algorithms.

The continuous development and extensive use of computed tomography (CT) in medical practice has raised a public concern over the associated radiation dose to the patient. Reducing the radiation dose may lead to increased noise and artifacts, which can adversely affect the radiologists' judgment and confidence. Hence, advanced image reconstruction from low-dose CT data is needed to improve the diagnostic performance, which is a challenging problem due to its ill-posed nature. Over the past years, various low-dose CT methods have produced impressive results. However, most of the algorithms developed for this application, including the recently popularized deep learning techniques, aim for minimizing the mean-squared error (MSE) between a denoised CT image and the ground truth under generic penalties. Although the peak signal-to-noise ratio is improved, MSE- or weighted-MSE-based methods can compromise the visibility of important structural details after aggressive denoising. This paper introduces a new CT image denoising method based on the generative adversarial network (GAN) with Wasserstein distance and perceptual similarity. The Wasserstein distance is a key concept of the optimal transport theory and promises to improve the performance of GAN. The perceptual loss suppresses noise by comparing the perceptual features of a denoised output against those of the ground truth in an established feature space, while the GAN focuses more on migrating the data noise distribution from strong to weak statistically. Therefore, our proposed method transfers our knowledge of visual perception to the image denoising task and is capable of not only reducing the image noise level but also trying to keep the critical information at the same time. Promising results have been obtained in our experiments with clinical CT images.

In the presence of metal implants, metal artifacts are introduced to x-ray computed tomography CT images. Although a large number of metal artifact reduction (MAR) methods have been proposed in the past decades, MAR is still one of the major problems in clinical x-ray CT. In this paper, we develop a convolutional neural network (CNN)-based open MAR framework, which fuses the information from the original and corrected images to suppress artifacts. The proposed approach consists of two phases. In the CNN training phase, we build a database consisting of metal-free, metal-inserted and pre-corrected CT images, and image patches are extracted and used for CNN training. In the MAR phase, the uncorrected and pre-corrected images are used as the input of the trained CNN to generate a CNN image with reduced artifacts. To further reduce the remaining artifacts, water equivalent tissues in a CNN image are set to a uniform value to yield a CNN prior, whose forward projections are used to replace the metal-affected projections, followed by the FBP reconstruction. The effectiveness of the proposed method is validated on both simulated and real data. Experimental results demonstrate the superior MAR capability of the proposed method to its competitors in terms of artifact suppression and preservation of anatomical structures in the vicinity of metal implants.

Spectral computed tomography (CT) produces an energy-discriminative attenuation map of an object, extending a conventional image volume with a spectral dimension. In spectral CT, an image can be sparsely represented in each of multiple energy channels, and are highly correlated among energy channels. According to this characteristics, we propose a tensor-based dictionary learning method for spectral CT reconstruction. In our method, tensor patches are extracted from an image tensor, which is reconstructed using the filtered backprojection (FBP), to form a training dataset. With the Candecomp/Parafac decomposition, a tensor-based dictionary is trained, in which each atom is a rank-one tensor. Then, the trained dictionary is used to sparsely represent image tensor patches during an iterative reconstruction process, and the alternating minimization scheme is adapted for optimization. The effectiveness of our proposed method is validated with both numerically simulated and real preclinical mouse datasets. The results demonstrate that the proposed tensor-based method generally produces superior image quality, and leads to more accurate material decomposition than the currently popular popular methods.

It is well known that ℓ1 minimization can be used to recover sufficiently sparse unknown signals in the compressive sensing field. The ℓp regularization method, a generalized version between the well-known ℓ1 regularization and the ℓ0 regularization, has been proposed for a sparser solution. In this paper, we derive several quasi-analytic thresholding representations for the ℓp(0 < p < 1) regularization. The derived representations are exact matches for the well-known soft-threshold filtering for the ℓ1 regularization and the hard-threshold filtering for the ℓ0 regularization. The error bounds of the approximate general formulas are analyzed. The general-threshold representation formulas are incorporated into an iterative thresholding framework for a fast solution of an ℓp regularized computed tomography (CT) reconstruction. A series of simulated and realistic data experiments are conducted to evaluate the performance of the proposed general-threshold filtering algorithm for CT reconstruction, and it is also compared with the well-known re-weighted approach. Compared with the re-weighted algorithm, the proposed general-threshold filtering algorithm can substantially reduce the necessary view number for an accurate reconstruction of the Shepp-Logan phantom. In addition, the proposed general-threshold filtering algorithm performs well in terms of image quality, reconstruction accuracy, convergence speed, and sensitivity to parameters.

This special issue serves as a forum of high visibility and synergy to promote the momentum of spectral CT. Through a rigorous peer-review process, 14 high-quality papers1 have been included from leading groups around the world. These papers give a panorama of the state of the art, addressing challenges in detector and source technologies, image reconstruction, material decomposition, performance evaluation, biomedical, and other applications.

The long-standing interior problem has important mathematical and practical implications. The recently developed interior tomography methods have produced encouraging results. A particular scenario for theoretically exact interior reconstruction from truncated projections is that there is a known sub-region in the ROI. In this paper, we improve a novel continuous singular value decomposition (SVD) method for interior reconstruction assuming a known sub-region. First, two sets of orthogonal eigen-functions are calculated for the Hilbert and image spaces respectively. Then, after the interior Hilbert data are calculated from projection data through the ROI, they are projected onto the eigen-functions in the Hilbert space, and an interior image is recovered by a linear combination of the eigen-functions with the resulting coefficients. Finally, the interior image is compensated for the ambiguity due to the null space utilizing the prior sub-region knowledge. Experiments with simulated and real data demonstrate the advantages of our approach relative to the POCS type interior reconstructions.

Although diagnostic medical imaging provides enormous benefits in the early detection and accuracy diagnosis of various diseases, there are growing concerns on the potential side effect of radiation induced genetic, cancerous and other diseases. How to reduce radiation dose while maintaining the diagnostic performance is a major challenge in the computed tomography (CT) field. Inspired by the compressive sensing theory, the sparse constraint in terms of total variation (TV) minimization has already led to promising results for low-dose CT reconstruction. Compared to the discrete gradient transform used in the TV method, dictionary learning is proven to be an effective way for sparse representation. On the other hand, it is important to consider the statistical property of projection data in the low-dose CT case. Recently, we have developed a dictionary learning based approach for low-dose X-ray CT. In this paper, we present this method in detail and evaluate it in experiments. In our method, the sparse constraint in terms of a redundant dictionary is incorporated into an objective function in a statistical iterative reconstruction framework. The dictionary can be either predetermined before an image reconstruction task or adaptively defined during the reconstruction process. An alternating minimization scheme is developed to minimize the objective function. Our approach is evaluated with low-dose X-ray projections collected in animal and human CT studies, and the improvement associated with dictionary learning is quantified relative to filtered backprojection and TV-based reconstructions. The results show that the proposed approach might produce better images with lower noise and more detailed structural features in our selected cases. However, there is no proof that this is true for all kinds of structures.

This paper presents a statistical interior tomography (SIT) approach making use of compressed sensing (CS) theory. With the projection data modeled by the Poisson distribution, an objective function with a total variation (TV) regularization term is formulated in the maximization of a posteriori (MAP) framework to solve the interior problem. An alternating minimization method is used to optimize the objective function with an initial image from the direct inversion of the truncated Hilbert transform. The proposed SIT approach is extensively evaluated with both numerical and real datasets. The results demonstrate that SIT is robust with respect to data noise and down-sampling, and has better resolution and less bias than its deterministic counterpart in the case of low count data.

Cardiac computed tomography (CT) has been improved over past years, but it still needs improvement for higher temporal resolution in the cases of high or irregular cardiac rates. Given successful applications of dual-source cardiac CT scanners, triple-source cone-beam CT seems a promising mode for cardiac CT. In this paper, we propose two filtered-backprojection algorithms for triple-source helical cone-beam CT. The first algorithm utilizes two families of filtering lines. These lines are parallel to the tangent of the scanning trajectory and the so-called L lines. The second algorithm utilizes two families of filtering lines tangent to the boundaries of the Zhao window and L lines, respectively, but it eliminates the filtering paths along the tangent of the scanning trajectory, thus reducing the required detector size greatly. The first algorithm is theoretically exact for r < 0.265R and quasi-exact for 0.265R <or= r < 0.495R, and the second algorithm is quasi-exact for r < 0.495R , where r and R denote the object radius and the trajectory radius, respectively. Both algorithms are computationally efficient. Numerical results are presented to verify and showcase the proposed algorithms.

It is well known that a rigid in-plane motion can be decomposed into a translation and a rotation around an origin. Based on our previous work, we first extend the Helgason-Ludwig consistency condition (HLCC) to cover a general rigid motion in fan-beam geometry. Then, we model the general motion by several parameters, and develop an iterative scheme for estimation of the in-plane motion parameters. This scheme determines the motion parameters by numerically minimizing an objective function constructed based on the HLCC. After the motion parameters are estimated, image reconstruction can be performed to compensate for the motion effects. Finally, we implement the algorithm and evaluate its performance in numerical simulations.

Using the group theory, we formulate integral invariants of projection data in fan-beam and cone-beam computed tomography (CT), which can be applied to sense an object motion and detect a contrast bolus arrival

A basic assumption in the classic computed tomography (CT) theory is that an object remains stationary in an entire scan. In biomedical CT/micro-CT, this assumption is often violated. To produce high-resolution images, such as for our recently proposed clinical micro-CT (CMCT) prototype, it is desirable to develop a precise motion estimation and image reconstruction scheme. In this paper, we first extend the Helgason-Ludwig consistency condition (HLCC) from parallel-beam to fan-beam geometry when an object is subject to a translation. Then, we propose a novel method to estimate the motion parameters only from sinograms based on the HLCC. To reconstruct the moving object, we formulate two generalized fan-beam reconstruction methods, which are in filtered backprojection and backprojection filtering formats, respectively. Furthermore, we present numerical simulation results to show that our approach is accurate and robust.

In this paper, we prove a generalized backprojection-filtration formula for exact cone-beam image reconstruction with an arbitrary scanning locus. Our proof is independent of the shape of the scanning locus, as long as the object is contained in a region where there is a chord through any interior point. As special cases, this generalized formula can be applied with cone-beam scanning along nonstandard spiral and saddle curves, as well as in an n-PI window setting. The algorithmic implementation and numerical results are described to support the correctness of our general claim.