Priorimask guided image reconstruction (p-MGIR) for ultra-low dose cone-beam computed tomography

A high-resolution cone beam computed tomography (HRCBCT) reconstruction framework for CBCT-guided online adaptive therapy

BACKGROUND

Kilo-voltage cone-beam computed tomography (CBCT) is a prevalent modality used for adaptive radiotherapy (ART) due to its compatibility with linear accelerators and ability to provide online imaging. However, the widely-used Feldkamp-Davis-Kress (FDK) reconstruction algorithm has several limitations, including potential streak aliasing artifacts and elevated noise levels. Iterative reconstruction (IR) techniques, such as total variation (TV) minimization, dictionary-based methods, and prior information-based methods, have emerged as viable solutions to address these limitations and improve the quality and applicability of CBCT in ART.

PURPOSE

One of the primary challenges in IR-based techniques is finding the right balance between minimizing image noise and preserving image resolution. To overcome this challenge, we have developed a new reconstruction technique called high-resolution CBCT (HRCBCT) that specifically focuses on improving image resolution while reducing noise levels.

METHODS

The HRCBCT reconstruction technique builds upon the conventional IR approach, incorporating three components: the data fidelity term, the resolution preservation term, and the regularization term. The data fidelity term ensures alignment between reconstructed values and measured projection data, while the resolution preservation term exploits the high resolution of the initial Feldkamp-Davis-Kress (FDK) algorithm. The regularization term mitigates noise during the IR process. To enhance convergence and resolution at each iterative stage, we applied Iterative Filtered Backprojection (IFBP) to the data fidelity minimization process.

RESULTS

We evaluated the performance of the proposed HRCBCT algorithm using data from two physical phantoms and one head and neck patient. The HRCBCT algorithm outperformed all four different algorithms; FDK, Iterative Filtered Back Projection (IFBP), Compressed Sensing based Iterative Reconstruction (CSIR), and Prior Image Constrained Compressed Sensing (PICCS) methods in terms of resolution and noise reduction for all data sets. Line profiles across three line pairs of resolution revealed that the HRCBCT algorithm delivered the highest distinguishable line pairs compared to the other algorithms. Similarly, the Modulation Transfer Function (MTF) measurements, obtained from the tungsten wire insert on the CatPhan 600 physical phantom, showed a significant improvement with HRCBCT over traditional algorithms.

CONCLUSION

The proposed HRCBCT algorithm offers a promising solution for enhancing CBCT image quality in adaptive radiotherapy settings. By addressing the challenges inherent in traditional IR methods, the algorithm delivers high-definition CBCT images with improved resolution and reduced noise throughout each iterative step. Implementing the HR CBCT algorithm could significantly impact the accuracy of treatment planning during online adaptive therapy.

Recent Advances in Cone-beam CT in Oral Medicine

BACKGROUND

The cone-beam computed tomography (CBCT) technology has continuously evolved since its appearance in oral medicine in the early 2000s.

OBJECTIVES

To present recent advances in CBCT in oral medicine: i) selection of recent and consensual evidence-based sources, ii) structured summary of the information based on an iterative framework and iii) compliance with ethical, public health and patient-centered concerns.

MAIN FINDINGS

We will focus on technological advances, such as sensors and reconstruction algorithms used to improve the constant quality of the image and dosimetry. CBCT examination is now performed in almost all disciplines of oral medicine: currently, the main clinical disciplines that use CBCT acquisitions are endodontics and oral surgery, with clearly defined indications. Periodontology and ear, nose and throat medicine are more recent fields of application. For a given application and indication, the smallest possible field of view must be used. One of the major challenges in contemporary healthcare is ensuring that technological developments do not take precedence over admitted standards of care. The entire volume should be reviewed in full, with a systematic approach. All findings are noted in the patient's record and explained to the patient, including incidental findings. This presupposes the person reviewing the images is sufficiently trained to interpret such images, inform the patient and organize the clinical pathway, with referrals to other medical or oral medicine specialties as needed.

CONCLUSION

A close collaboration between dentists, medical physicists, radiologists, radiographers and engineers is critical for all aspects of CBCT technology.

Data-specific mask-guided image reconstruction for diffuse optical tomography

Conventional approaches in diffuse optical tomography (DOT) image reconstruction often address the ill-posed inverse problem via regularization with a constant penalty parameter, which uniformly smooths out the solution. In this study, we present a data-specific mask-guided scheme that incorporates a prior mask constraint into the image reconstruction framework. The prior mask was created from the DOT data itself by exploiting the multi-measurement vector formulation. We accordingly propose two methods to integrate the prior mask into the reconstruction process. First, as a soft prior by exploiting a spatially varying regularization. Second, as a hard prior by imposing a region-of-interest-limited reconstruction. Furthermore, the latter method iterates between discrete and continuous steps to update the mask and optical parameters, respectively. The proposed methods showed enhanced optical contrast accuracy, improved spatial resolution, and reduced noise level in DOT reconstructed images compared with the conventional approaches such as the modified Levenberg-Marquardt approach and the l₁-regularization based sparse recovery approach.

Analytical Low-Dose CBCT Reconstruction Using Non-local Total Variation Regularization for Image Guided Radiation Therapy

Purpose: Conventional iterative low-dose CBCT reconstruction techniques are slow and tend to over-smooth edges through uniform weighting of the image penalty gradient. In this study, we present a non-iterative analytical low-dose CBCT reconstruction technique by restoring the noisy low-dose CBCT projection with the non-local total variation (NLTV) method. Methods: We modeled the low-dose CBCT reconstruction as recovering high quality, high-dose CBCT x-ray projections (100 kVp, 1.6 mAs) from low-dose, noisy CBCT x-ray projections (100 kVp, 0.1 mAs). The restoration of CBCT projections was performed using the NLTV regularization method. In NLTV, the x-ray image is optimized by minimizing an energy function that penalizes gray-level difference between pair of pixels between noisy x-ray projection and denoising x-ray projection. After the noisy projection is restored by NLTV regularization, the standard FDK method was applied to generate the final reconstruction output. Results: Significant noise reduction was achieved comparing to original, noisy inputs while maintaining the image quality comparable to the high-dose CBCT projections. The experimental validations show the proposed NLTV algorithm can robustly restore the noise level of x-ray projection images while significantly improving the overall image quality. The improvement in normalized mean square error (NMSE) and peak signal-to-noise ratio (PSNR) measured from the non-local total variation-gradient projection (NLTV-GPSR) algorithm is noticeable compared to that of uncorrected low-dose CBCT images. Moreover, the difference of CNRs from the gains from the proposed algorithm is noticeable and comparable to high-dose CBCT. Conclusion: The proposed method successfully restores noise degraded, low-dose CBCT projections to high-dose projection quality. Such an outcome is a considerable improvement to the reconstruction result compared to the FDK-based method. In addition, a significant reduction in reconstruction time makes the proposed algorithm more attractive. This demonstrates the potential use of the proposed algorithm for clinical practice in radiotherapy.

A review of GPU-based medical image reconstruction

Tomographic image reconstruction is a computationally demanding task, even more so when advanced models are used to describe a more complete and accurate picture of the image formation process. Such advanced modeling and reconstruction algorithms can lead to better images, often with less dose, but at the price of long calculation times that are hardly compatible with clinical workflows. Fortunately, reconstruction tasks can often be executed advantageously on Graphics Processing Units (GPUs), which are exploited as massively parallel computational engines. This review paper focuses on recent developments made in GPU-based medical image reconstruction, from a CT, PET, SPECT, MRI and US perspective. Strategies and approaches to get the most out of GPUs in image reconstruction are presented as well as innovative applications arising from an increased computing capacity. The future of GPU-based image reconstruction is also envisioned, based on current trends in high-performance computing.

An efficient iterative CBCT reconstruction approach using gradient projection sparse reconstruction algorithm

The purpose of this study is to develop a fast and convergence proofed CBCT reconstruction framework based on the compressed sensing theory which not only lowers the imaging dose but also is computationally practicable in the busy clinic. We simplified the original mathematical formulation of gradient projection for sparse reconstruction (GPSR) to minimize the number of forward and backward projections for line search processes at each iteration. GPSR based algorithms generally showed improved image quality over the FDK algorithm especially when only a small number of projection data were available. When there were only 40 projections from 360 degree fan beam geometry, the quality of GPSR based algorithms surpassed FDK algorithm within 10 iterations in terms of the mean squared relative error. Our proposed GPSR algorithm converged as fast as the conventional GPSR with a reasonably low computational complexity. The outcomes demonstrate that the proposed GPSR algorithm is attractive for use in real time applications such as on-line IGRT.