A constrained, total-variation minimization algorithm for low-intensity x-ray CT.
Ontology highlight
ABSTRACT:
SUBMITTER: Sidky EY
PROVIDER: S-EPMC3172126 | biostudies-other | 2011 Jul
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Total generalized variation (TGV)-based computed tomography (CT) image reconstruction, which utilizes high-order image derivatives, is superior to total variation-based methods in terms of the preservation of edge information and the suppression of unfavorable staircase effects. However, conventional TGV regularization employs l1-based form, which is not the most direct method for maximizing sparsity prior. In this study, we propose a total generalized p-variation (TGpV) regularization model to improve the sparsity exploitation of TGV and offer efficient solutions to few-view CT image reconstruction problems. To solve the nonconvex optimization problem of the TGpV minimization model, we then present an efficient iterative algorithm based on the alternating minimization of augmented Lagrangian function. All of the resulting subproblems decoupled by variable splitting admit explicit solutions by applying alternating minimization method and generalized p-shrinkage mapping. In addition, approximate solutions that can be easily performed and quickly calculated through fast Fourier transform are derived using the proximal point method to reduce the cost of inner subproblems. The accuracy and efficiency of the simulated and real data are qualitatively and quantitatively evaluated to validate the efficiency and feasibility of the proposed method. Overall, the proposed method exhibits reasonable performance and outperforms the original TGV-based method when applied to few-view problems.
| S-EPMC4764011 | biostudies-literature
Project description:In recent years, there has been increased interest in low-dose X-ray cone beam computed tomography (CBCT) in many fields, including dentistry, guided radiotherapy and small animal imaging. Despite reducing the radiation dose, low-dose CBCT has not gained widespread acceptance in routine clinical practice. In addition to performing more evaluation studies, developing a fast and high-quality reconstruction algorithm is required. In this work, we propose an iterative reconstruction method that accelerates ordered-subsets (OS) reconstruction using a power factor. Furthermore, we combine it with the total-variation (TV) minimization method. Both simulation and phantom studies were conducted to evaluate the performance of the proposed method. Results show that the proposed method can accelerate conventional OS methods, greatly increase the convergence speed in early iterations. Moreover, applying the TV minimization to the power acceleration scheme can further improve the image quality while preserving the fast convergence rate.
| S-EPMC4830553 | biostudies-literature
Project description:High-speed coherent Raman scattering imaging is opening a new avenue to unveiling the cellular machinery by visualizing the spatio-temporal dynamics of target molecules or intracellular organelles. By extracting signals from the laser at MHz modulation frequency, current stimulated Raman scattering (SRS) microscopy has reached shot noise limited detection sensitivity. The laser-based local oscillator in SRS microscopy not only generates high levels of signal, but also delivers a large shot noise which degrades image quality and spectral fidelity. Here, we demonstrate a denoising algorithm that removes the noise in both spatial and spectral domains by total variation minimization. The signal-to-noise ratio of SRS spectroscopic images was improved by up to 57 times for diluted dimethyl sulfoxide solutions and by 15 times for biological tissues. Weak Raman peaks of target molecules originally buried in the noise were unraveled. Coupling the denoising algorithm with multivariate curve resolution allowed discrimination of fat stores from protein-rich organelles in C. elegans. Together, our method significantly improved detection sensitivity without frame averaging, which can be useful for in vivo spectroscopic imaging.
| S-EPMC4779315 | biostudies-literature
Project description:Grating-based phase-contrast computed tomography (PCCT) is a promising imaging tool on the horizon for pre-clinical and clinical applications. Until now PCCT has been plagued by strong artifacts when dense materials like bones are present. In this paper, we present a new statistical iterative reconstruction algorithm which overcomes this limitation. It makes use of the fact that an X-ray interferometer provides a conventional absorption as well as a dark-field signal in addition to the phase-contrast signal. The method is based on a statistical iterative reconstruction algorithm utilizing maximum-a-posteriori principles and integrating the statistical properties of the raw data as well as information of dense objects gained from the absorption signal. Reconstruction of a pre-clinical mouse scan illustrates that artifacts caused by bones are significantly reduced and image quality is improved when employing our approach. Especially small structures, which are usually lost because of streaks, are recovered in our results. In comparison with the current state-of-the-art algorithms our approach provides significantly improved image quality with respect to quantitative and qualitative results. In summary, we expect that our new statistical iterative reconstruction method to increase the general usability of PCCT imaging for medical diagnosis apart from applications focused solely on soft tissue visualization.
| S-EPMC4464273 | biostudies-other
Project description:Model-based image reconstruction (MBIR) for X-ray computed tomography (CT) offers improved image quality and potential low-dose operation, but has yet to reach ubiquity in the clinic. MBIR methods form an image by solving a large statistically motivated optimization problem, and the long time it takes to numerically solve this problem has hampered MBIR's adoption. We present a new optimization algorithm for X-ray CT MBIR based on duality and group coordinate ascent that may converge even with approximate updates and can handle a wide range of regularizers, including total variation (TV). The algorithm iteratively updates groups of dual variables corresponding to terms in the cost function; these updates are highly parallel and map well onto the GPU. Although the algorithm stores a large number of variables, the "working size" for each of the algorithm's steps is small and can be efficiently streamed to the GPU while other calculations are being performed. The proposed algorithm converges rapidly on both real and simulated data and shows promising parallelization over multiple devices.
| S-EPMC4749040 | biostudies-literature
Project description:Perfusion computed tomography (PCT) is critical in detecting cerebral ischemic lesions. PCT examination with low-dose scans can effectively reduce radiation exposure to patients at the cost of degraded images with severe noise and artifacts. Tensor total variation (TTV) models are powerful tools that can encode the regional continuous structures underlying a PCT object. In a TTV model, the sparsity structures of the contrast-medium concentration (CMC) across PCT frames are assumed to be isotropic with identical and independent distribution. However, this assumption is inconsistent with practical PCT tasks wherein the sparsity has evident variations and correlations. Such modeling deviation hampers the performance of TTV-based PCT reconstructions. To address this issue, we developed a novel contrast-medium anisotropy-aware tensor total variation (CMAA-TTV) model to describe the intrinsic anisotropy sparsity of the CMC in PCT imaging tasks. Instead of directly on the difference matrices, the CMAA-TTV model characterizes sparsity on a low-rank subspace of the difference matrices which are calculated from the input data adaptively, thus naturally encoding the intrinsic variant and correlated anisotropy sparsity structures of the CMC. We further proposed a robust and efficient PCT reconstruction algorithm to improve low-dose PCT reconstruction performance using the CMAA-TTV model. Experimental studies using a digital brain perfusion phantom, patient data with low-dose simulation and clinical patient data were performed to validate the effectiveness of the presented algorithm. The results demonstrate that the CMAA-TTV algorithm can achieve noticeable improvements over state-of-the-art methods in low-dose PCT reconstruction tasks.
| S-EPMC7731921 | biostudies-literature
Project description:PurposeTo investigate the feasibility of ultra-low-dose CT (ULDCT) reconstructed with the artificial intelligence iterative reconstruction (AIIR) algorithm in total-body PET/CT imaging.MethodsThe study included both the phantom and clinical parts. An anthropomorphic phantom underwent CT imaging with ULDCT (10mAs) and standard-dose CT (SDCT) (120mAs), respectively. ULDCT was reconstructed with AIIR and hybrid iterative reconstruction (HIR) (expressed as ULDCT-AIIRphantom and ULDCT-HIRphantom), respectively, and SDCT was reconstructed with HIR (SDCT-HIRphantom) as control. In the clinical part, 52 patients with malignant tumors underwent the total-body PET/CT scan. ULDCT with AIIR (ULDCT-AIIR) and HIR (ULDCT-HIR), respectively, was reconstructed for PET attenuation correction, followed by the SDCT reconstructed with HIR (SDCT-HIR) for anatomical location. PET/CT images' quality was qualitatively assessed by two readers. The CTmean, as well as the CT standard deviation (CTsd), SUVmax, SUVmean, and the SUV standard deviation (SUVsd), was recorded. The signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR) were calculated and compared.ResultsThe image quality of ULDCT-HIRphantom was inferior to the SDCT-HIRphantom, but no significant difference was found between the ULDCT-AIIRphantom and SDCT-HIRphantom. The subjective score of ULDCT-AIIR in the neck, chest and lower limb was equivalent to that of SDCT-HIR. Besides the brain and lower limb, the change rates of CTmean in thyroid, neck muscle, lung, mediastinum, back muscle, liver, lumbar muscle, first lumbar spine and sigmoid colon were -2.15, -1.52, 0.66, 2.97, 0.23, 8.91, 0.06, -4.29 and 8.78%, respectively, while all CTsd of ULDCT-AIIR was lower than that of SDCT-HIR. Except for the brain, the CNR of ULDCT-AIIR was the same as the SDCT-HIR, but the SNR was higher. The change rates of SUVmax, SUVmean and SUVsd were within [Formula: see text] 3% in all ROIs. For the lesions, the SUVmax, SUVsd and TBR showed no significant difference between PET-AIIR and PET-HIR.ConclusionThe SDCT-HIR could not be replaced by the ULDCT-AIIR at date, but the AIIR algorithm decreased the image noise and increased the SNR, which can be implemented under special circumstances in PET/CT examination.
| S-EPMC9807709 | biostudies-literature
Project description:ObjectiveTo examine the safety and efficacy of a high-intensity (HI) progressive rehabilitation protocol beginning 4 days after total knee arthroplasty (TKA) compared to a low-intensity (LI) rehabilitation protocol.MethodsA total of 162 participants (mean?±?SD ages 63?±?7 years; 89 women) were randomized to either the HI group or LI group after TKA. Key components of the HI intervention were the use of progressive resistance exercises and a rapid progression to weight-bearing exercises and activities. Both groups were treated in an outpatient setting 2 to 3 times per week for 11 weeks (26 total sessions). Outcomes included the stair climbing test (SCT; primary outcome), timed-up-and-go (TUG) test, 6-minute walk (6MW) test, the Western Ontario and McMaster Universities Osteoarthritis Index (WOMAC), 12-item Short Form health survey (SF-12), knee range of motion (ROM), quadriceps and hamstring strength, and quadriceps activation. Outcomes were assessed preoperatively and at 1, 2, 3 (primary end point), 6, and 12 months postoperatively.ResultsThere were no significant differences between groups at 3 or 12 months in SCT, TUG, 6MW, WOMAC scores, knee ROM, quadriceps and hamstrings strength, quadriceps activation, or adverse event rates. By 12 months, outcomes on the 6MW, TUG, WOMAC, SF-12, quadriceps and hamstring strength, and quadriceps activation had improved beyond baseline performance in both groups.ConclusionBoth the HI and LI interventions were effective in improving strength and function after TKA. HI progressive rehabilitation is safe for individuals after TKA. However, its effectiveness may be limited by arthrogenic muscular inhibition in the early postoperative period.
| S-EPMC5415445 | biostudies-literature
Project description:Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ?, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online.
| S-EPMC3772096 | biostudies-literature
Project description:In comparison with conventional filtered backprojection (FBP) algorithms for x-ray computed tomography (CT) image reconstruction, statistical algorithms directly incorporate the random nature of the data and do not assume CT data are linear, noiseless functions of the attenuation line integral. Thus, it has been hypothesized that statistical image reconstruction may support a more favorable tradeoff than FBP between image noise and spatial resolution in dose-limited applications. The purpose of this study is to evaluate the noise-resolution tradeoff for the alternating minimization (AM) algorithm regularized using a nonquadratic penalty function.Idealized monoenergetic CT projection data with Poisson noise were simulated for two phantoms with inserts of varying contrast (7%-238%) and distance from the field-of-view (FOV) center (2-6.5 cm). Images were reconstructed for the simulated projection data by the FBP algorithm and two penalty function parameter values of the penalized AM algorithm. Each algorithm was run with a range of smoothing strengths to allow quantification of the noise-resolution tradeoff curve. Image noise is quantified as the standard deviation in the water background around each contrast insert. Modulation transfer functions (MTFs) were calculated from six-parameter model fits to oversampled edge-spread functions defined by the circular contrast-insert edges as a metric of local resolution. The integral of the MTF up to 0.5 1p/mm was adopted as a single-parameter measure of local spatial resolution.The penalized AM algorithm noise-resolution tradeoff curve was always more favorable than that of the FBP algorithm. While resolution and noise are found to vary as a function of distance from the FOV center differently for the two algorithms, the ratio of noises when matching the resolution metric is relatively uniform over the image. The ratio of AM-to-FBP image variances, a predictor of dose-reduction potential, was strongly dependent on the shape of the AM's nonquadratic penalty function and was also strongly influenced by the contrast of the insert for which resolution is quantified. Dose-reduction potential, reported here as the fraction (%) of FBP dose necessary for AM to reconstruct an image with comparable noise and resolution, for one penalty parameter value of the AM algorithm was found to vary from 70% to 50% for low-contrast and high-contrast structures, respectively, and from 70% to 10% for the second AM penalty parameter value. However, the second penalty, AM-700, was found to suffer from poor low-contrast resolution when matching the high-contrast resolution metric with FBP.The results of this simulation study imply that penalized AM has the potential to reconstruct images with similar noise and resolution using a fraction (10%-70%) of the FBP dose. However, this dose-reduction potential depends strongly on the AM penalty parameter and the contrast magnitude of the structures of interest. In addition, the authors' results imply that the advantage of AM can be maximized by optimizing the nonquadratic penalty function to the specific imaging task of interest. Future work will extend the methods used here to quantify noise and resolution in images reconstructed from real CT data.
| S-EPMC3060931 | biostudies-other