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.

Computed tomography (CT) scanners are widely used to obtain detailed internal images in clinical diagnosis. Highly attenuated metallic implants resulting from strong and energy-dependent attenuation cause metal artifacts in CT scanning. However, current supervised deep network-based metal artifact reduction (MAR) methods hardly generalize in clinical diagnosis and treatment because of difficult acquisition for the paired artifact-affected and artifact-free data. In addition, these deep model-based methods cannot ensure the sinogram-domain data consistency for the exact metal trace inpainting. To address the above problems, we propose an UnsuPervised sinoGRam-domAin Data-consistEnt network for MAR, i.e., UPGRADE-Net. First, UPGRADE-Net fully leverages the prior knowledge to guide the generative conditional diffusion model for fine-grained metal trace inpainting. Second, without the artifact-free ground truth, a deep unsupervised MAR framework in the reverse process is constructed to contextually learn the known background data distribution for the unknown metal trace restoration in sinogram-domain. Third, to further maintain the sinogram-domain data consistency, two physics-based consistency constraint loss functions, including conjugate-ray and accumulation-ray consistency loss, are designed for the conjugate point constraint and the accumulation constraint. The proposed UPGRADE-Net is trained and evaluated on a publicly available dataset and a clinical dataset. Extensive experimental results validate that the proposed method outperforms the state-of-the-art competing methods for MAR.

4D cone-beam computed tomography (CBCT) plays a critical role in adaptive radiation therapy for lung cancer. However, extremely sparse sampling projection data will cause severe streak artifacts in 4D CBCT images. Existing deep learning (DL) methods heavily rely on large labeled training datasets which are difficult to obtain in practical scenarios. Restricted by this dilemma, DL models often struggle with simultaneously retaining dynamic motions, removing streak degradations, and recovering fine details. To address the above challenging problem, we introduce a Deep Prior Image Constrained Motion Compensation framework (DPI-MoCo) that decouples the 4D CBCT reconstruction into two sub-tasks including coarse image restoration and structural detail fine-tuning. In the first stage, the proposed DPI-MoCo combines the prior image guidance, generative adversarial network, and contrastive learning to globally suppress the artifacts while maintaining the respiratory movements. After that, to further enhance the local anatomical structures, the motion estimation and compensation technique is adopted. Notably, our framework is performed without the need for paired datasets, ensuring practicality in clinical cases. In the Monte Carlo simulation dataset, the DPI-MoCo achieves competitive quantitative performance compared to the state-of-the-art (SOTA) methods. Furthermore, we test DPI-MoCo in clinical lung cancer datasets, and experiments validate that DPI-MoCo not only restores small anatomical structures and lesions but also preserves motion information.

Cone-beam CT is extensively used in medical diagnosis and treatment. Despite its large longitudinal field of view (FoV), the horizontal FoV of CBCT systems is severely limited due to the detector width. Certain commercial CBCT systems increase the horizontal FoV by employing the offset detector method. However, this method necessitates 360° full circular scanning trajectory which increases the scanning time and is not compatible with specific CBCT system models. In this paper, we investigate the feasibility of large FoV imaging under short scan trajectories with an additional X-ray source. A dual-source CBCT geometry is proposed as well as two corresponding image reconstruction algorithms. The first one is based on cone-parallel rebinning and the subsequent employs a modified Parker weighting scheme. Theoretical calculations demonstrate that the proposed geometry achieves a wider horizontal FoV than the ${90}\%$ detector offset geometry (radius of ${214}.{83}\textit {mm}$ vs. ${198}.{99}\textit {mm}$ ) with a significantly reduced rotation angle (less than 230° vs. 360°). As demonstrated by experiments, the proposed geometry and reconstruction algorithms obtain comparable imaging qualities within the FoV to conventional CBCT imaging techniques. Implementing the proposed geometry is straightforward and does not substantially increase development expenses. It possesses the capacity to expand CBCT applications even further.

In Computed Tomography (CT) imaging, the ring artifacts caused by the inconsistent detector response can significantly degrade the reconstructed images, having negative impacts on the subsequent applications. The new generation of CT systems based on photon-counting detectors are affected by ring artifacts more severely. The flexibility and variety of detector responses make it difficult to build a well-defined model to characterize the ring artifacts. In this context, this study proposes the global dependency-enhanced dual-domain parallel neural network for Ring Artifact Removal (RAR). First, based on the fact that the features of ring artifacts are different in Cartesian and Polar coordinates, the parallel architecture is adopted to construct the deep neural network so that it can extract and exploit the latent features from different domains to improve the performance of ring artifact removal. Besides, the ring artifacts are globally relevant whether in Cartesian or Polar coordinate systems, but convolutional neural networks show inherent shortcomings in modeling long-range dependency. To tackle this problem, this study introduces the novel Mamba mechanism to achieve a global receptive field without incurring high computational complexity. It enables effective capture of the long-range dependency, thereby enhancing the model performance in image restoration and artifact reduction. The experiments on the simulated data validate the effectiveness of the dual-domain parallel neural network and the Mamba mechanism, and the results on two unseen real datasets demonstrate the promising performance of the proposed RAR algorithm in eliminating ring artifacts and recovering image details.

Spectral CT can provide material characterization ability to offer more precise material information for diagnosis purposes. However, the material decomposition process generally leads to amplification of noise which significantly limits the utility of the material basis images. To mitigate such problem, an image domain noise suppression method was proposed in this work. The method performs basis transformation of the material basis images based on a singular value decomposition. The noise variances of the original spectral CT images were incorporated in the matrix to be decomposed to ensure that the transformed basis images are statistically uncorrelated. Due to the difference in noise amplitudes in the transformed basis images, a selective filtering method was proposed with the low-noise transformed basis image as guidance. The method was evaluated using both numerical simulation and real clinical dual-energy CT data. Results demonstrated that compared with existing methods, the proposed method performs better in preserving the spatial resolution and the soft tissue contrast while suppressing the image noise. The proposed method is also computationally efficient and can realize real-time noise suppression for clinical spectral CT images.

Intraoperative Cone-Beam Computed Tomography (CBCT) provides fast multiplanar cross-sectional imaging and three-dimensional reconstructions in clinical scene. However, high-attenuation metallic implants result in the obstruction of low-energy X-rays and further lead to metal artifacts in the reconstructed CT images. Existing metal artifact reduction approaches do not consider automated fine-grained metallic implants segmentation. Imprecise metallic implants segmentation severely limits the clinical practical applicability of MAR approaches. To address the above challenge, in this study, we present a novel DUAL-domain multi-view Weak supervIsed SEgmentation network for Metal Artifact Reduction (DUALWISE-MAR) to coarse-to-fine segment metallic implants without segmentation ground-truth. First, an Iterative Segmentation Refinement Mechanism is constructed to progressively enhance initial coarse label and guide segmentation network close to the ideal metal mask. Second, a Multi-view Consistent Segmentation Network is constructed for data-consistent segmentation to capture the metal shape relationship between adjacent views in projection-domain. Third, a Segmentation Recalibration Module is proposed to calibrate the inaccurate prediction regions in the imagedomain. Extensive experiments have been conducted on the real clinical CBCT dataset and demonstrate that the proposed DUALWISE-MAR framework achieves excellent performance in metal segmentation compared to the state-of-the-art methods.

With the continuous functional enhancement of network services, a service usually presents a directed acyclic graphic (DAG) structure. This paper models the DAG task scheduling problem as a multi-objective optimization problem to balance the task execution efficiency, network traffic, and system load balance in componentized task deployment. To produce an instant decision, we propose the Cloud-edge Collaborative Task Scheduling (CCTS) Algorithm based on hybrid reward architecture deep reinforcement learning (DRL). Specifically, to reduce the redundancy of the state space of the Markov decision process, we use directed graph convolution networks and graph convolution networks (GCN) to embed the directed task graph and undirected network graph, respectively. Simulation results show that the proposed method outperforms the compared convolutional neural networks and GCN-based DRL schemes in reducing the system latency, energy cost, network traffic, and load balance.

With the successful application of deep learning to magnetic resonance (MR) imaging, parallel imaging techniques based on neural networks have attracted wide attention. However, in the absence of high-quality, fully sampled datasets for training, the performance of these methods is limited. And the interpretability of models is not strong enough. To tackle this issue, this paper proposes a Physics-bAsed unsupeRvised Contrastive rEpresentation Learning (PARCEL) method to speed up parallel MR imaging. Specifically, PARCEL has a parallel framework to contrastively learn two branches of model-based unrolling networks from augmented undersampled multi-coil k-space data. A sophisticated co-training loss with three essential components has been designed to guide the two networks in capturing the inherent features and representations for MR images. And the final MR image is reconstructed with the trained contrastive networks. PARCEL was evaluated on two vivo datasets and compared to five state-of-the-art methods. The results show that PARCEL is able to learn essential representations for accurate MR reconstruction without relying on fully sampled datasets. The code will be made available at https://github.com/ternencewu123/PARCEL.

Over the past few years, dictionary learning (DL)-based methods have been successfully used in various image reconstruction problems. However, the traditional DL-based computed tomography (CT) reconstruction methods are patch-based and ignore the consistency of pixels in overlapped patches. In addition, the features learned by these methods always contain shifted versions of the same features. In recent years, convolutional sparse coding (CSC) has been developed to address these problems. In this paper, inspired by several successful applications of CSC in the field of signal processing, we explore the potential of CSC in sparse-view CT reconstruction. By directly working on the whole image, without the necessity of dividing the image into overlapped patches in DL-based methods, the proposed methods can maintain more details and avoid artifacts caused by patch aggregation. With predetermined filters, an alternating scheme is developed to optimize the objective function. Extensive experiments with simulated and real CT data were performed to validate the effectiveness of the proposed methods. The qualitative and quantitative results demonstrate that the proposed methods achieve better performance than the several existing state-of-the-art methods.

Spectral computed tomography (CT) has attracted considerable attention because of its energy-resolving capability in identifying and discriminating materials. The use of a narrow energy bin can improve energy resolution. However, a narrow energy bin has high noise ratio, which degrades the imaging quality of spectral CT. To address this problem, this study exploits the structure correlations of images in the energy domain and proposed two types of united iterative reconstruction (UIR) algorithms. One type uses the well-reconstructed broad-spectrum image, with all available photons, as a constraint, whereas the other type uses a pseudo narrow-energy image, which is estimated with the use of our proposed structure-coupling (SC) method, as a constraint. The SC method utilizes local structures to connect images that are reconstructed with broad-spectrum and narrow-energy CT datasets. Given a broad-spectrum image, the SC method can accurately estimate its corresponding narrow-energy image. Results show that UIR algorithms significantly outperform conventional iterative reconstruction algorithms for narrow-energy image reconstruction in spectral CT. Among the UIR algorithms, SC-UIR yields the best results.