اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDirectional-TV Algorithm for Image Reconstruction from Limited-Angular-Range Data
233
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Investigation of image reconstruction from data collected over a limited angular range in X-ray CT remains a topic of active research because it may yield insight into the development of imaging workflow of practical significance. This reconstruction problem is well-known to be challenging, however, because it is highly ill-conditioned. In the work, we investigate optimization-based image reconstruction from data acquired over a limited-angular range that is considerably smaller than the angular range in short-scan CT. We first formulate the reconstruction problem as a convex optimization program with directional total-variation (TV) constraints applied to the image, and then develop an iterative algorithm, referred to as the directional-TV (DTV) algorithm for image reconstruction through solving the optimization program. We use the DTV algorithm to reconstruct images from data collected over a variety of limited-angular ranges for breast and bar phantoms of clinical- and industrial-application relevance. The study demonstrates that the DTV algorithm accurately recovers the phantoms from data generated over a significantly reduced angular range, and that it considerably diminishes artifacts observed otherwise in reconstructions of existing algorithms. We have also obtained empirical conditions on minimal angular ranges sufficient for numerically accurate image reconstruction with the DTV algorithm.
قيم البحث
اقرأ أيضاً
In dual-energy computed tomography (DECT), low- and high- kVp data are collected often over a full-angular range (FAR) of $360^circ$. While there exists strong interest in DECT with low- and high-kVp data acquired over limited-angular ranges (LARs),
there remains little investigation of image reconstruction in DECT with LAR data. Objective: We investigate image reconstruction with minimized LAR artifacts from low- and high-kVp data over LARs of $le 180^circ$ by using a directional-total-variation (DTV) algorithm. Methods: Image reconstruction from LAR data is formulated as a convex optimization problem in which data-$ell_2$ is minimized with constraints on images DTVs along orthogonal axes. We then achieve image reconstruction by applying the DTV algorithm to solve the optimization problem. We conduct numerical studies from data generated over arcs of LARs, ranging from $14^circ$ to $180^circ$, and perform visual inspection and quantitative analysis of images reconstructed. Results: Monochromatic images of interest obtained with the DTV algorithm from LAR data show substantially reduced artifacts that are observed often in images obtained with existing algorithms. The improved image quality also leads to accurate estimation of physical quantities of interest, such as effective atomic number and iodine-contrast concentration. Conclusion: Our study reveals that from LAR data of low- and high-kVp, monochromatic images can be obtained that are visually, and physical quantities can be estimated that are quantitatively, comparable to those obtained in FAR DECT. Significance: As LAR DECT is of high practical application interest, the results acquired in the work may engender insights into the design of DECT with LAR scanning configurations of practical application significance.
This article is intended to supplement our 2015 paper in Medical Physics titled Noise properties of CT images reconstructed by use of constrained total-variation, data-discrepancy minimization, in which ordered subsets methods were employed to perfor
m total-variation constrained data-discrepancy minimization for image reconstruction in X-ray computed tomography. Here we provide details regarding implementation of the ordered subsets algorithms and suggestions for selection of algorithm parameters. Detailed pseudo-code is included for every algorithm implemented in the original manuscript.
The work seeks to develop an algorithm for image reconstruction by directly inverting the non-linear data model in spectral CT. Using the non-linear data model, we formulate the image-reconstruction problem as a non-convex optimization program, and d
evelop a non-convex primal-dual (NCPD) algorithm to solve the program. We devise multiple convergence conditions and perform verification studies numerically to demonstrate that the NCPD algorithm can solve the non-convex optimization program and under appropriate data condition, can invert the non-linear data model. Using the NCPD algorithm, we then reconstruct monochromatic images from simulated and real data of numerical and physical phantoms acquired with a standard, full-scan dual-energy configuration. The result of the reconstruction studies shows that the NCPD algorithm can correct accurately for the non-linear beam-hardening effect. Furthermore, we apply the NCPD algorithm to simulated and real data of the numerical and physical phantoms collected with non-standard, short-scan dual-energy configurations, and obtain monochromatic images comparable to those of the standard, full-scan study, thus revealing the potential of the NCPD algorithm for enabling non-standard scanning configurations in spectral CT, where the existing indirect methods are limited.
In adaptive radiotherapy, deformable image registration is often conducted between the planning CT and treatment CT (or cone beam CT) to generate a deformation vector field (DVF) for dose accumulation and contour propagation. The auto propagated cont
ours on the treatment CT may contain relatively large errors, especially in low contrast regions. A clinician inspection and editing of the propagated contours are frequently needed. The edited contours are able to meet the clinical requirement for adaptive therapy; however, the DVF is still inaccurate and inconsistent with the edited contours. The purpose of this work is to develop a contour-guided deformable image registration (CG-DIR) algorithm to improve the accuracy and consistency of the DVF for adaptive radiotherapy. Incorporation of the edited contours into the registration algorithm is realized by regularizing the objective function of the original demons algorithm with a term of intensity matching between the delineated structures set pairs. The CG-DIR algorithm is implemented on computer graphics processing units (GPUs) by following the original GPU-based demons algorithm computation framework [Gu et al, Phys Med Biol. 55(1): 207-219, 2010]. The performance of CG-DIR is evaluated on five clinical head-and-neck and one pelvic cancer patient data. It is found that compared with the original demons, CG-DIR improves the accuracy and consistency of the DVF, while retaining similar high computational efficiency.
Low counts reconstruction remains a challenge for Positron Emission Tomography (PET) even with the recent progresses in time-of-flight (TOF) resolution. In that setting, the bias between the acquired histogram, composed of low values or zeros, and th
e expected histogram, obtained from the forward projector, is propagated to the image, resulting in a biased reconstruction. This could be exacerbated with finer resolution of the TOF information, which further sparsify the acquired histogram. We propose a new approach to circumvent this limitation of the classical reconstruction model. It consists of extending the parametrization of the reconstruction scheme to also explicitly include the projection domain. This parametrization has greater degrees of freedom than the log-likelihood model, which can not be harnessed in classical circumstances. We hypothesize that with ultra-fast TOF this new approach would not only be viable for low counts reconstruction but also more adequate than the classical reconstruction model. An implementation of this approach is compared to the log-likelihood model by using two-dimensional simulations of a hot spots phantom. The proposed model achieves similar contrast recovery coefficients as MLEM except for the smallest structures where the low counts nature of the simulations makes it difficult to draw conclusions. Also, this new model seems to converge toward a less noisy solution than the MLEM. These results suggest that this new approach has potential for low counts reconstruction with ultra-fast TOF.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
