ترغب بنشر مسار تعليمي؟ اضغط هنا

Non-convex primal-dual algorithm for image reconstruction in spectral CT

138   0   0.0 ( 0 )
 نشر من قبل Buxin Chen
 تاريخ النشر 2021
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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 develop 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.



قيم البحث

اقرأ أيضاً

This paper investigates accelerating the convergence of distributed optimization algorithms on non-convex problems. We propose a distributed primal-dual stochastic gradient descent~(SGD) equipped with powerball method to accelerate. We show that the proposed algorithm achieves the linear speedup convergence rate $mathcal{O}(1/sqrt{nT})$ for general smooth (possibly non-convex) cost functions. We demonstrate the efficiency of the algorithm through numerical experiments by training two-layer fully connected neural networks and convolutional neural networks on the MNIST dataset to compare with state-of-the-art distributed SGD algorithms and centralized SGD algorithms.
221 - Wei Zhao , Tianye Niu , Lei Xing 2016
Increased noise is a general concern for dual-energy material decomposition. Here, we develop an image-domain material decomposition algorithm for dual-energy CT (DECT) by incorporating an edge-preserving filter into the Local HighlY constrained back PRojection Reconstruction (HYPR-LR) framework. With effective use of the non-local mean, the proposed algorithm, which is referred to as HYPR-NLM, reduces the noise in dual energy decomposition while preserving the accuracy of quantitative measurement and spatial resolution of the material-specific dual energy images. We demonstrate the noise reduction and resolution preservation of the algorithm with iodine concentrate numerical phantom by comparing the HYPR-NLM algorithm to the direct matrix inversion, HYPR-LR and iterative image-domain material decomposition (Iter-DECT). We also show the superior performance of the HYPR-NLM over the existing methods by using two sets of cardiac perfusing imaging data. The reference drawn from the comparison study includes: (1) HYPR-NLM significantly reduces the DECT material decomposition noise while preserving quantitative measurements and high-frequency edge information, and (2) HYPR-NLM is robust with respect to parameter selection.
The susceptibility-based positive contrast MR technique was applied to estimate arbitrary magnetic susceptibility distributions of the metallic devices using a kernel deconvolution algorithm with a regularized L-1 minimization.Previously, the first-o rder primal-dual (PD) algorithm could provide a faster reconstruction time to solve the L-1 minimization, compared with other methods. Here, we propose to accelerate the PD algorithm of the positive contrast image using the multi-core multi-thread feature of graphics processor units (GPUs). The some experimental results showed that the GPU-based PD algorithm could achieve comparable accuracy of the metallic interventional devices in positive contrast imaging with less computational time. And the GPU-based PD approach was 4~15 times faster than the previous CPU-based scheme.
In this work, we introduce ADAPD, $textbf{A}$ $textbf{D}$ecentr$textbf{A}$lized $textbf{P}$rimal-$textbf{D}$ual algorithmic framework for solving non-convex and smooth consensus optimization problems over a network of distributed agents. ADAPD makes use of an inexact ADMM-type update. During each iteration, each agent first inexactly solves a local strongly convex subproblem and then performs a neighbor communication while updating a set of dual variables. Two variations to ADAPD are presented. The variants allow agents to balance the communication and computation workload while they collaboratively solve the consensus optimization problem. The optimal convergence rate for non-convex and smooth consensus optimization problems is established; namely, ADAPD achieves $varepsilon$-stationarity in $mathcal{O}(varepsilon^{-1})$ iterations. Numerical experiments demonstrate the superiority of ADAPD over several existing decentralized methods.
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.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا