A Novel Weighted Total Difference Based Image Reconstruction Algorithm for Few-View Computed Tomography

In practical applications of computed tomography (CT) imaging, due to the risk of high radiation dose imposed on the patients, it is desired that high quality CT images can be accurately reconstructed from limited projection data. While with limited projections, the images reconstructed often suffer severe artifacts and the edges of the objects are blurred. In recent years, the compressed sensing based reconstruction algorithm has attracted major attention for CT reconstruction from a limited number of projections. In this paper, to eliminate the streak artifacts and preserve the edge structure information of the object, we present a novel iterative reconstruction algorithm based on weighted total difference (WTD) minimization, and demonstrate the superior performance of this algorithm. The WTD measure enforces both the sparsity and the directional continuity in the gradient domain, while the conventional total difference (TD) measure simply enforces the gradient sparsity horizontally and vertically. To solve our WTD-based few-view CT reconstruction model, we use the soft-threshold filtering approach. Numerical experiments are performed to validate the efficiency and the feasibility of our algorithm. For a typical slice of FORBILD head phantom, using 40 projections in the experiments, our algorithm outperforms the TD-based algorithm with more than 60% gains in terms of the root-mean-square error (RMSE), normalized root mean square distance (NRMSD) and normalized mean absolute distance (NMAD) measures and with more than 10% gains in terms of the peak signal-to-noise ratio (PSNR) measure. While for the experiments of noisy projections, our algorithm outperforms the TD-based algorithm with more than 15% gains in terms of the RMSE, NRMSD and NMAD measures and with more than 4% gains in terms of the PSNR measure. The experimental results indicate that our algorithm achieves better performance in terms of suppressing streak artifacts and preserving the edge structure information of the object.     

Fast Second Degree Total Variation Method for Image Compressive Sensing

This paper presents a computationally efficient algorithm for image compressive sensing reconstruction using a second degree total variation (HDTV2) regularization. Firstly, a preferably equivalent formulation of the HDTV2 functional is derived, which can be formulated as a weighted L ₁-L ₂ mixed norm of second degree image derivatives under the spectral decomposition framework. Secondly, using the equivalent formulation of HDTV2, we introduce an efficient forward-backward splitting (FBS) scheme to solve the HDTV2-based image reconstruction model. Furthermore, from the averaged non-expansive operator point of view, we make a detailed analysis on the convergence of the proposed FBS algorithm. Experiments on medical images demonstrate that the proposed method outperforms several fast algorithms of the TV and HDTV2 reconstruction models in terms of peak signal to noise ratio (PSNR), structural similarity index (SSIM) and convergence speed.     

Few-view CT reconstruction via a novel non-local means algorithm

PurposeNon-local means (NLM) based reconstruction method is a promising algorithm for few-view computed tomography (CT) reconstruction, but often suffers from over-smoothed image edges. To address this problem, an adaptive NLM reconstruction method based on rotational invariance (ART-RIANLM) is proposed.MethodsThe method consists of four steps: 1) Initializing parameters; 2) ART reconstruction using raw data; 3) Positivity constraint of the reconstructed image; 4) Image updating by RIANLM filtering. In RIANLM, two kinds of rotational invariance measures which are average gradient (AG) and region homogeneity (RH) are proposed to calculate the distance between two patches and a novel NLM filter is developed to avoid over-smoothed image. Moreover, the parameter h in RIANLM which controls the decay of the weights is adaptive to avoid over-smoothness, while it is constant in NLM during the whole reconstruction process. The proposed method is validated on two digital phantoms and real projection data.ResultsIn our experiments, the searching neighborhood size is set as 15 × 15 and the similarity window is set as 3 × 3. For the simulated case of Shepp-Logan phantom, ART-RIANLM produces higher SNR (36.23 dB > 24.00 dB) and lower MAE (0.0006 < 0.0024) reconstructed images than ART-NLM. The visual inspection demonstrated that the proposed method could suppress artifacts or noises more effectively and recover image edges better. The result of real data case is also consistent with the simulation result.ConclusionsA RIANLM based reconstruction method for few-view CT is presented. Compared to the traditional ART-NLM method, SNR and MAE from ART-RIANLM increases 51% and decreases 75%, respectively.     

System Matrix Analysis for Computed Tomography Imaging

In practical applications of computed tomography imaging (CT), it is often the case that the set of projection data is incomplete owing to the physical conditions of the data acquisition process. On the other hand, the high radiation dose imposed on patients is also undesired. These issues demand that high quality CT images can be reconstructed from limited projection data. For this reason, iterative methods of image reconstruction have become a topic of increased research interest. Several algorithms have been proposed for few-view CT. We consider that the accurate solution of the reconstruction problem also depends on the system matrix that simulates the scanning process. In this work, we analyze the application of the Siddon method to generate elements of the matrix and we present results based on real projection data.     

3D TOF-PET image reconstruction using total variation regularization

In this paper we introduce a semi-analytic algorithm for 3-dimensional image reconstruction for positron emission tomography (PET). The method consists of the back-projection of the acquired data into the most likely image voxel according to time-of-flight (TOF) information, followed by the filtering step in the image space using an iterative optimization algorithm with a total variation (TV) regularization. TV regularization in image space is more computationally efficient than usual iterative optimization methods for PET reconstruction with full system matrix that use TV regularization. The efficiency comes from the one-time TOF back-projection step that might also be described as a reformatting of the acquired data. An important aspect of our work concerns the evaluation of the filter operator of the linear transform mapping an original radioactive tracer distribution into the TOF back-projected image. We obtain concise, closed-form analytical formula for the filter operator. The proposed method is validated with the Monte Carlo simulations of the NEMA IEC phantom using a one-layer, 50 cm-long cylindrical device called Jagiellonian PET scanner. The results show a better image quality compared with the reference TOF maximum likelihood expectation maximization algorithm.     

Common reducing subspace model and network alternation analysis

Motivated by brain connectivity analysis and many other network data applications, we study the problem of estimating covariance and precision matrices and their differences across multiple populations. We propose a common reducing subspace model that leads to substantial dimension reduction and efficient parameter estimation. We explicitly quantify the efficiency gain through an asymptotic analysis. Our method is built upon and further extends a nascent technique, the envelope model, which adopts a generalized sparsity principle. This distinguishes our proposal from most xisting covariance and precision estimation methods that assume element‐wise sparsity. Moreover, unlike most existing solutions, our method can naturally handle both covariance and precision matrices in a unified way, and work with matrix‐valued data. We demonstrate the efficacy of our method through intensive simulations, and illustrate the method with an autism spectrum disorder data analysis.     

Balanced Sparse Model for Tight Frames in Compressed Sensing Magnetic Resonance Imaging

Compressed sensing has shown to be promising to accelerate magnetic resonance imaging. In this new technology, magnetic resonance images are usually reconstructed by enforcing its sparsity in sparse image reconstruction models, including both synthesis and analysis models. The synthesis model assumes that an image is a sparse combination of atom signals while the analysis model assumes that an image is sparse after the application of an analysis operator. Balanced model is a new sparse model that bridges analysis and synthesis models by introducing a penalty term on the distance of frame coefficients to the range of the analysis operator. In this paper, we study the performance of the balanced model in tight frame based compressed sensing magnetic resonance imaging and propose a new efficient numerical algorithm to solve the optimization problem. By tuning the balancing parameter, the new model achieves solutions of three models. It is found that the balanced model has a comparable performance with the analysis model. Besides, both of them achieve better results than the synthesis model no matter what value the balancing parameter is. Experiment shows that our proposed numerical algorithm constrained split augmented Lagrangian shrinkage algorithm for balanced model (C-SALSA-B) converges faster than previously proposed algorithms accelerated proximal algorithm (APG) and alternating directional method of multipliers for balanced model (ADMM-B).     

A Dictionary Learning Approach with Overlap for the Low Dose Computed Tomography Reconstruction and Its Vectorial Application to Differential Phase Tomography

X-ray based Phase-Contrast Imaging (PCI) techniques have been demonstrated to enhance the visualization of soft tissues in comparison to conventional imaging methods. Nevertheless the delivered dose as reported in the literature of biomedical PCI applications often equals or exceeds the limits prescribed in clinical diagnostics. The optimization of new computed tomography strategies which include the development and implementation of advanced image reconstruction procedures is thus a key aspect. In this scenario, we implemented a dictionary learning method with a new form of convex functional. This functional contains in addition to the usual sparsity inducing and fidelity terms, a new term which forces similarity between overlapping patches in the superimposed regions. The functional depends on two free regularization parameters: a coefficient multiplying the sparsity-inducing norm of the patch basis functions coefficients, and a coefficient multiplying the norm of the differences between patches in the overlapping regions. The solution is found by applying the iterative proximal gradient descent method with FISTA acceleration. The gradient is computed by calculating projection of the solution and its error backprojection at each iterative step. We study the quality of the solution, as a function of the regularization parameters and noise, on synthetic data for which the solution is a-priori known. We apply the method on experimental data in the case of Differential Phase Tomography. For this case we use an original approach which consists in using vectorial patches, each patch having two components: one per each gradient component. The resulting algorithm, implemented in the European Synchrotron Radiation Facility tomography reconstruction code PyHST, has proven to be efficient and well-adapted to strongly reduce the required dose and the number of projections in medical tomography.     

Enhancement of soft-tissue contrast in cone-beam CT using an anti-scatter grid with a sparse sampling approach

PurposeAnti-scatter grids suppress the scatter substantially thus improving image contrast in radiography. However, its active use in cone-beam CT for the purpose of improving contrast-to-noise ratio (CNR) has not been successful mainly due to the increased noise related to Poisson statistics of photons. This paper proposes a sparse-view scanning approach to address the above issue.MethodCompared to the conventional cone-beam CT imaging framework, the proposed method reduces the number of projections and increases exposure in each projection to enhance image quality without an additional cost of radiation dose to patients. For image reconstruction from sparse-view data, an adaptive-steepest-descent projection-onto-convex-sets (ASD POCS) algorithm regularized by total-variation (TV) minimization was adopted. Contrast and CNR with various scattering conditions were evaluated in projection domain by a simulation study using GATE. Then we evaluated contrast, resolution, and image uniformity in CT image domain with Catphan phantom. A head phantom with soft-tissue structures was also employed for demonstrating a realistic application. A virtual grid-based estimation and reduction of scatter has also been implemented for comparison with the real anti-scatter grid.ResultsIn the projection domain evaluation, contrast and CNR enhancement was observed when using an anti-scatter grid compared to the virtual grid. In the CT image domain, the proposed method produced substantially higher contrast and CNR of the low-contrast structures with much improved image uniformity.ConclusionWe have shown that the proposed method can provide high-quality CBCT images particularly with an increased contrast of soft-tissue at a neutral dose for image-guidance.     

An Efficient Augmented Lagrangian Method for Statistical X-Ray CT Image Reconstruction

Statistical iterative reconstruction (SIR) for X-ray computed tomography (CT) under the penalized weighted least-squares criteria can yield significant gains over conventional analytical reconstruction from the noisy measurement. However, due to the nonlinear expression of the objective function, most exiting algorithms related to the SIR unavoidably suffer from heavy computation load and slow convergence rate, especially when an edge-preserving or sparsity-based penalty or regularization is incorporated. In this work, to address abovementioned issues of the general algorithms related to the SIR, we propose an adaptive nonmonotone alternating direction algorithm in the framework of augmented Lagrangian multiplier method, which is termed as “ALM-ANAD”. The algorithm effectively combines an alternating direction technique with an adaptive nonmonotone line search to minimize the augmented Lagrangian function at each iteration. To evaluate the present ALM-ANAD algorithm, both qualitative and quantitative studies were conducted by using digital and physical phantoms. Experimental results show that the present ALM-ANAD algorithm can achieve noticeable gains over the classical nonlinear conjugate gradient algorithm and state-of-the-art split Bregman algorithm in terms of noise reduction, contrast-to-noise ratio, convergence rate, and universal quality index metrics.     

Optimization-based region-of-interest reconstruction for X-ray computed tomography based on total variation and data derivative

Region-of-interest (ROI) and interior reconstructions for computed tomography (CT) have drawn much attention and can be of practical value for potential applications in reducing radiation dose and hardware cost. The conventional wisdom is that the exact reconstruction of an interior ROI is very difficult to be obtained by only using data associated with lines through the ROI. In this study, we propose and investigate optimization-based methods for ROI and interior reconstructions based on total variation (TV) and data derivative. Objective functions are built by the image TV term plus the data finite difference term. Different data terms in the forms of L1-norm, L2-norm, and Kullback–Leibler divergence are incorporated and investigated in the optimizations. Efficient algorithms are developed using the proximal alternating direction method of multipliers (ADMM) for each program. All sub-problems of ADMM are solved by using closed-form solutions with high efficiency. The customized optimizations and algorithms based on the TV and derivative-based data terms can serve as a powerful tool for interior reconstructions. Simulations and real-data experiments indicate that the proposed methods can be of practical value for CT imaging applications.     

Artificial intelligence in image reconstruction: The change is here

Innovations in CT have been impressive among imaging and medical technologies in both the hardware and software domain. The range and speed of CT scanning improved from the introduction of multidetector-row CT scanners with wide-array detectors and faster gantry rotation speeds. To tackle concerns over rising radiation doses from its increasing use and to improve image quality, CT reconstruction techniques evolved from filtered back projection to commercial release of iterative reconstruction techniques, and recently, of deep learning (DL)-based image reconstruction. These newer reconstruction techniques enable improved or retained image quality versus filtered back projection at lower radiation doses. DL can aid in image reconstruction with training data without total reliance on the physical model of the imaging process, unique artifacts of PCD-CT due to charge sharing, K-escape, fluorescence x-ray emission, and pulse pileups can be handled in the data-driven fashion. With sufficiently reconstructed images, a well-designed network can be trained to upgrade image quality over a practical/clinical threshold or define new/killer applications. Besides, the much smaller detector pixel for PCD-CT can lead to huge computational costs with traditional model-based iterative reconstruction methods whereas deep networks can be much faster with training and validation. In this review, we present techniques, applications, uses, and limitations of deep learning-based image reconstruction methods in CT.     

Numerical Solution to Generalized Burgers'-Fisher Equation Using Exp-Function Method Hybridized with Heuristic Computation

In this paper, a new heuristic scheme for the approximate solution of the generalized Burgers''-Fisher equation is proposed. The scheme is based on the hybridization of Exp-function method with nature inspired algorithm. The given nonlinear partial differential equation (NPDE) through substitution is converted into a nonlinear ordinary differential equation (NODE). The travelling wave solution is approximated by the Exp-function method with unknown parameters. The unknown parameters are estimated by transforming the NODE into an equivalent global error minimization problem by using a fitness function. The popular genetic algorithm (GA) is used to solve the minimization problem, and to achieve the unknown parameters. The proposed scheme is successfully implemented to solve the generalized Burgers''-Fisher equation. The comparison of numerical results with the exact solutions, and the solutions obtained using some traditional methods, including adomian decomposition method (ADM), homotopy perturbation method (HPM), and optimal homotopy asymptotic method (OHAM), show that the suggested scheme is fairly accurate and viable for solving such problems.     

Iterative Image Reconstruction for Sparse-View CT Using Normal-Dose Image Induced Total Variation Prior

X-ray computed tomography (CT) iterative image reconstruction from sparse-view projection data has been an important research topic for radiation reduction in clinic. In this paper, to relieve the requirement of misalignment reduction operation of the prior image constrained compressed sensing (PICCS) approach introduced by Chen et al, we present an iterative image reconstruction approach for sparse-view CT using a normal-dose image induced total variation (ndiTV) prior. The associative objective function of the present approach is constructed under the penalized weighed least-square (PWLS) criteria, which contains two terms, i.e., the weighted least-square (WLS) fidelity and the ndiTV prior, and is referred to as “PWLS-ndiTV”. Specifically, the WLS fidelity term is built based on an accurate relationship between the variance and mean of projection data in the presence of electronic background noise. The ndiTV prior term is designed to reduce the influence of the misalignment between the desired- and prior- image by using a normal-dose image induced non-local means (ndiNLM) filter. Subsequently, a modified steepest descent algorithm is adopted to minimize the associative objective function. Experimental results on two different digital phantoms and an anthropomorphic torso phantom show that the present PWLS-ndiTV approach for sparse-view CT image reconstruction can achieve noticeable gains over the existing similar approaches in terms of noise reduction, resolution-noise tradeoff, and low-contrast object detection.     

Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging

In dynamic Positron Emission Tomography (PET), an estimate of the radio activity concentration is obtained from a series of frames of sinogram data taken at ranging in duration from 10 seconds to minutes under some criteria. So far, all the well-known reconstruction algorithms require known data statistical properties. It limits the speed of data acquisition, besides, it is unable to afford the separated information about the structure and the variation of shape and rate of metabolism which play a major role in improving the visualization of contrast for some requirement of the diagnosing in application. This paper presents a novel low rank-based activity map reconstruction scheme from emission sinograms of dynamic PET, termed as SLCR representing Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging. In this method, the stationary background is formulated as a low rank component while variations between successive frames are abstracted to the sparse. The resulting nuclear norm and l ₁ norm related minimization problem can also be efficiently solved by many recently developed numerical methods. In this paper, the linearized alternating direction method is applied. The effectiveness of the proposed scheme is illustrated on three data sets.     

Structural similarity regularized and sparse coding based super-resolution for medical images

Recently the single image super-resolution reconstruction (SISR) via sparse coding has attracted increasing interests. Considering that there are obviously repetitive image structures in medical images, in this study we propose a regularized SISR method via sparse coding and structural similarity. The pixel based recovery is incorporated as a regularization term to exploit the non-local structural similarities of medical images, which is very helpful in further improving the quality of recovered medical images. An alternative variables optimization algorithm is proposed and some medical images including CT, MRI and ultrasound images are used to investigate the performance of our proposed method. The results show the superiority of our method to its counterparts.     

Sparse Support Vector Machines with L_{p} Penalty for Biomarker Identification

The development of high-throughput technology has generated a massive amount of high-dimensional data, and many of them are of discrete type. Robust and efficient learning algorithms such as LASSO [1] are required for feature selection and overfitting control. However, most feature selection algorithms are only applicable to the continuous data type. In this paper, we propose a novel method for sparse support vector machines (SVMs) with L_{p} (p ≪ 1) regularization. Efficient algorithms (LpSVM) are developed for learning the classifier that is applicable to high-dimensional data sets with both discrete and continuous data types. The regularization parameters are estimated through maximizing the area under the ROC curve (AUC) of the cross-validation data. Experimental results on protein sequence and SNP data attest to the accuracy, sparsity, and efficiency of the proposed algorithm. Biomarkers identified with our methods are compared with those from other methods in the literature. The software package in Matlab is available upon request.     

Effect of DA-9701 on Gastric Motor Function Assessed by Magnetic Resonance Imaging in Healthy Volunteers: A Randomized,Double-Blind,Placebo-Controlled Trial

Background

Improving gastric accommodation and gastric emptying is an attractive physiological treatment target in patients with functional dyspepsia (FD). We evaluated the effect of DA-9701, a new drug for FD, on gastric motor function after a meal in healthy volunteers using magnetic resonance imaging (MRI).

Methods

Forty healthy volunteers were randomly allocated to receive either DA-9701 or placebo. After 5 days of treatment, subjects underwent gastric MRI (60 min before and 15, 30, 45, 60, 90, and 120 min after a liquid test meal). Gastric volume was measured through 3-dimensional reconstruction from MRI data. We analyzed 4 outcome variables including changes in total gastric volume (TGV), proximal TGV, and proximal to distal TGV ratio after a meal and gastric emptying rates after adjusting values at the pre-test meal.

Results

Changes in TGV and proximal TGV after a meal did not differ between the DA-9701 and placebo groups (difference between groups -25.9 mL, 95% confidence interval [CI] -54.0 to 2.3 mL, P = 0.070 and -2.9 mL, 95% CI -30.3 to 24.5 mL, P = 0.832, respectively). However, pre-treatment with DA-9701 increased postprandial proximal to distal TGV ratio more than placebo (difference between groups 0.93, 95% CI 0.08 to 1.79, P = 0.034). In addition, pre-treatment with DA-9701 significantly increased gastric emptying as compared with placebo (mean difference between groups 3.41%, 95% CI 0.54% to 6.29%, P = 0.021, by mixed model for repeated measures).

Conclusion

Our results suggested that DA-9701 enhances gastric emptying and does not significantly affect gastric accommodation in healthy volunteers. Further studies to confirm whether DA-9701 enhances these gastric motor functions in patients with FD are warranted.

Trial Registration

ClinicalTrials.gov NCT02091635     

Assessment of the variation in CT scanner performance (image quality and Hounsfield units) with scan parameters,for image optimisation in radiotherapy treatment planning

PurposeTo define a method and investigate how the adjustment of scan parameters affected the image quality and Hounsfield units (HUs) on a CT scanner used for radiotherapy treatment planning. A lack of similar investigations in the literature may be a contributing factor in the apparent reluctance to optimise radiotherapy CT protocols.MethodA Catphan phantom was used to assess how image quality on a Toshiba Aquilion LB scanner changed with scan parameters. Acquisition and reconstruction field-of-view (FOV), collimation, image slice thickness, effective mAs per rotation and reconstruction algorithm were varied. Changes were assessed for HUs of different materials, high contrast spatial resolution (HCSR), contrast-noise ratio (CNR), HU uniformity, scan direction low contrast and CT dose-index.ResultsCNR and HCSR varied most with reconstruction algorithm, reconstruction FOV and effective mAs. Collimation, but not image slice width, had a significant effect on CT dose-index with narrower collimation giving higher doses. Dose increased with effective mAs. Highest HU differences were seen when changing reconstruction algorithm: 56 HU for densities close to water and 117 HU for bone-like materials. Acquisition FOV affected the HUs but reconstruction FOV and effective mAs did not.ConclusionsAll the scan parameters investigated affected the image quality metrics. Reconstruction algorithm, reconstruction FOV, collimation and effective mAs were most important. Reconstruction algorithm and acquisition FOV had significant effect on HU. The methodology is applicable to radiotherapy CT scanners when investigating image quality optimisation, prior to assessing the impact of scan protocol changes on clinical CT images and treatment plans.     

Adaptive local regularization methods for the inverse ECG problem

One of the fundamental problems in theoretical electrocardiography can be characterized by an inverse problem. We present new methods for achieving better estimates of heart surface potential distributions in terms of torso potentials through an inverse procedure. First, we outline an automatic adaptive refinement algorithm that minimizes the spatial discretization error in the transfer matrix, increasing the accuracy of the inverse solution. Second, we introduce a new local regularization procedure, which works by partitioning the global transfer matrix into sub-matrices, allowing for varying amounts of smoothing. Each submatrix represents a region within the underlying geometric model in which regularization can be specifically ‘tuned’ using an a priori scheme based on the L-curve method. This local regularization method can provide a substantial increase in accuracy compared to global regularization schemes. Within this context of local regularization, we show that a generalized version of the singular value decomposition (GSVD) can further improve the accuracy of ECG inverse solutions compared to standard SVD and Tikhonov approaches. We conclude with specific examples of these techniques using geometric models of the human thorax derived from MRI data.