Investigation of optimization-based reconstruction with an image-total-variation constraint in PET.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhang Z
PROVIDER: S-EPMC5062374 | biostudies-other | 2016 Aug
REPOSITORIES: biostudies-other
Similar Datasets
Project description:PurposePropose a novel decomposition-based model employing the total generalized variation (TGV) and the nuclear norm, which can be used in compressed sensing-based dynamic MR reconstructions.Theory and methodsWe employ the nuclear norm to represent the time-coherent background and the spatiotemporal TGV functional for the sparse dynamic component above. We first design an algorithm using the classical first-order primal-dual method for solving the proposed model and then give the norm estimation for the convergence condition. The proposed model is compared with the state-of-the-art methods on different data sets under different sampling schemes and acceleration factors.ResultsThe proposed model achieves higher SERs and SSIMs than kt-SLR, kt-RPCA, L+S, and ICTGV on cardiac perfusion and breast DCE-MRI data sets under both the pseudoradial and the Cartesian sampling schemes. In addition, the proposed model better suppresses the spatial artifacts and preserves the edges.ConclusionsThe proposed model outperforms the state-of-the-art methods and generates high-quality reconstructions under different sampling schemes and different acceleration factors.
| S-EPMC7047634 | biostudies-literature
Project description:Compressed sensing-based reconstruction algorithms have been proven to be more successful than analytical or iterative methods for sparse computed tomography (CT) imaging by narrowing down the solution set thanks to its ability to seek a sparser solution. Total variation (TV), one of the most popular sparsifiers, exploits spatial continuity of features by restricting variation between two neighboring pixels in each direction as using partial derivatives. When the number of projections is much fewer than the one in conventional CT, which results in much less sampling rate than the minimum required one, TV may not provide satisfactory results. In this study, a new regularizer is proposed which seeks for a sparser solution by reinforcing the gradient of TV and empowering the spatial continuity of features. The experiments are done by using both analitical phantom and real human CT images and the results are compared with conventional, four-directional, and directional TV algorithms by using contrast-to-noise ratio (CNR), signal-to-noise ratio (SNR) and Structural Similarity Index (SSIM) metrics. Both quantitative and visual evaluations show that the proposed method is promising for sparse CT image reconstruction by reducing the background noise while preserving the features and edges.
| S-EPMC10782945 | biostudies-literature
Project description:Recently, deep neural networks have been widely and successfully applied in computer vision tasks and have attracted growing interest in medical imaging. One barrier for the application of deep neural networks to medical imaging is the need for large amounts of prior training pairs, which is not always feasible in clinical practice. This is especially true for medical image reconstruction problems, where raw data are needed. Inspired by the deep image prior framework, in this paper, we proposed a personalized network training method where no prior training pairs are needed, but only the patient's own prior information. The network is updated during the iterative reconstruction process using the patient-specific prior information and measured data. We formulated the maximum-likelihood estimation as a constrained optimization problem and solved it using the alternating direction method of multipliers algorithm. Magnetic resonance imaging guided positron emission tomography reconstruction was employed as an example to demonstrate the effectiveness of the proposed framework. Quantification results based on simulation and real data show that the proposed reconstruction framework can outperform Gaussian post-smoothing and anatomically guided reconstructions using the kernel method or the neural-network penalty.
| S-EPMC6584077 | biostudies-literature
Project description:We propose a hyperparameter learning framework that learnspatient-specifichyperparameters for optimization-based image reconstruction problems for x-ray CT applications. The framework consists of two functional modules: (1) a hyperparameter learning module parameterized by a convolutional neural network, (2) an image reconstruction module that takes as inputs both the noisy sinogram and the hyperparameters from (1) and generates the reconstructed images. As a proof-of-concept study, in this work we focus on a subclass of optimization-based image reconstruction problems with exactly computable solutions so that the whole network can be trained end-to-end in an efficient manner. Unlike existing hyperparameter learning methods, our proposed framework generates patient-specific hyperparameters from the sinogram of the same patient. Numerical studies demonstrate the effectiveness of our proposed approach compared to bi-level optimization.
| S-EPMC8584383 | biostudies-literature
Project description:ObjectivesTo investigate the impact of total variation regularized expectation maximization (TVREM) reconstruction on the image quality of 68Ga-PSMA-11 PET/CT using phantom and patient data.MethodsImages of a phantom with small hot sphere inserts and 20 prostate cancer patients were acquired with a digital PET/CT using list-mode and reconstructed with ordered subset expectation maximization (OSEM) and TVREM with seven penalisation factors between 0.01 and 0.42 for 2 and 3 minutes-per-bed (m/b) acquisition. The contrast recovery (CR) and background variability (BV) of the phantom, image noise of the liver, and SUVmax of the lesions were measured. Qualitative image quality was scored by two radiologists using a 5-point scale (1-poor, 5-excellent).ResultsThe performance of CR, BV, and image noise, and the gain of SUVmax was higher for TVREM 2 m/b groups with the penalization of 0.07 to 0.28 compared to OSEM 3 m/b group (all p < 0.05). The image noise of OSEM 3 m/b group was equivalent to TVREM 2 and 3 m/b groups with a penalization of 0.14 and 0.07, while lesions' SUVmax increased 15 and 20%. The highest qualitative score was attained at the penalization of 0.21 (3.30 ± 0.66) for TVREM 2 m/b groups and the penalization 0.14 (3.80 ± 0.41) for 3 m/b group that equal to or greater than OSEM 3 m/b group (2.90 ± 0.45, p = 0.2 and p < 0.001).ConclusionsTVREM improves lesion contrast and reduces image noise, which allows shorter acquisition with preserved image quality for PSMA PET/CT.Advances in knowledgeTVREM reconstruction with optimized penalization factors can generate higher quality PSMA-PET images for prostate cancer diagnosis.
| S-EPMC8010539 | biostudies-literature
Project description:ObjectiveSimultaneous PET/MRIs vary in their quantitative PET performance due to inherent differences in the physical systems and differences in the image reconstruction implementation. This variability in quantitative accuracy confounds the ability to meaningfully combine and compare data across scanners. In this work, we define image reconstruction parameters that lead to comparable contrast recovery curves across simultaneous PET/MRI systems.MethodThe NEMA NU-2 image quality phantom was imaged on one GE Signa and on one Siemens mMR PET/MRI scanner. The phantom was imaged at 9.7:1 contrast with standard spheres (diameter 10, 13, 17, 22, 28, 37 mm) and with custom spheres (diameter: 8.5, 11.5, 15, 25, 32.5, 44 mm) using a standardized methodology. Analysis was performed on a 30 min listmode data acquisition and on 6 realizations of 5 min from the listmode data. Images were reconstructed with the manufacturer provided iterative image reconstruction algorithms with and without point spread function (PSF) modeling. For both scanners, a post-reconstruction Gaussian filter of 3-7 mm in steps of 1 mm was applied. Attenuation correction was provided from a scaled computed tomography (CT) image of the phantom registered to the MR-based attenuation images and verified to align on the non-attenuation corrected PET images. For each of these image reconstruction parameter sets, contrast recovery coefficients (CRCs) were determined for the SUVmean, SUVmax and SUVpeak for each sphere. A hybrid metric combining the root-mean-squared discrepancy (RMSD) and the absolute CRC values was used to simultaneously optimize for best match in CRC between the two scanners while simultaneously weighting toward higher resolution reconstructions. The image reconstruction parameter set was identified as the best candidate reconstruction for each vendor for harmonized PET image reconstruction.ResultsThe range of clinically relevant image reconstruction parameters demonstrated widely different quantitative performance across cameras. The best match of CRC curves was obtained at the lowest RMSD values with: for CRCmean, 2 iterations-7 mm filter on the GE Signa and 4 iterations-6 mm filter on the Siemens mMR, for CRCmax, 4 iterations-6 mm filter on the GE Signa, 4 iterations-5 mm filter on the Siemens mMR and for CRCpeak, 4 iterations-7 mm filter with PSF on the GE Signa and 4 iterations-7 mm filter on the Siemens mMR. Over all reconstructions, the RMSD between CRCs was 1.8%, 3.6% and 2.9% for CRC mean, max and peak, respectively. The solution of 2 iterations-3 mm on the GE Signa and 4 iterations-3 mm on Siemens mMR, both with PSF, led to simultaneous harmonization and with high CRC and low RMSD for CRC mean, max and peak with RMSD values of 2.8%, 5.8% and 3.2%, respectively.ConclusionsFor two commercially available PET/MRI scanners, user-selectable parameters that control iterative updates, image smoothing and PSF modeling provide a range of contrast recovery curves that allow harmonization in harmonization strategies of optimal match in CRC or high CRC values. This work demonstrates that nearly identical CRC curves can be obtained on different commercially available scanners by selecting appropriate image reconstruction parameters.
| S-EPMC8571452 | biostudies-literature
Project description:Multi-tracer positron emission tomography (PET) has the potential to enhance PET imaging by providing complementary information from different physiological processes. However, one or more of the images may present high levels of noise. Guided image reconstruction methods transfer information from a guide image into the PET image reconstruction to encourage edge-preserving noise reduction. In this work we aim to reduce noise in poorer quality PET datasets via guidance from higher quality ones by using a weighted quadratic penalty approach. In particular, we applied this methodology to [18F]fluorodeoxyglucose (FDG) and [11C]methionine imaging of gliomas. 3D simulation studies showed that guiding the reconstruction of methionine datasets using pre-existing FDG images reduced reconstruction errors across the whole-brain (-8%) and within a tumour (-36%) compared to maximum likelihood expectation-maximisation (MLEM). Furthermore, guided reconstruction outperformed a comparable non-local means filter, indicating that regularising during reconstruction is preferable to post-reconstruction approaches. Hyperparameters selected from the 3D simulation study were applied to real data, where it was observed that the proposed FDG-guided methionine reconstruction allows for better edge preservation and noise reduction than standard MLEM. Overall, the results in this work demonstrate that transferring information between datasets in multi-tracer PET studies improves image quality and quantification performance.
| S-EPMC6130802 | biostudies-other
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:PURPOSE:Numerous image reconstruction methodologies for positron emission tomography (PET) have been developed that incorporate magnetic resonance (MR) imaging structural information, producing reconstructed images with improved suppression of noise and reduced partial volume effects. However, the influence of MR structural information also increases the possibility of suppression or bias of structures present only in the PET data (PET-unique regions). To address this, further developments for MR-informed methods have been proposed, for example, through inclusion of the current reconstructed PET image, alongside the MR image, in the iterative reconstruction process. In this present work, a number of kernel and maximum a posteriori (MAP) methodologies are compared, with the aim of identifying methods that enable a favorable trade-off between the suppression of noise and the retention of unique features present in the PET data. METHODS:The reconstruction methods investigated were: the MR-informed conventional and spatially compact kernel methods, referred to as KEM and KEM largest value sparsification (LVS) respectively; the MR-informed Bowsher and Gaussian MR-guided MAP methods; and the PET-MR-informed hybrid kernel and anato-functional MAP methods. The trade-off between improving the reconstruction of the whole brain region and the PET-unique regions was investigated for all methods in comparison with postsmoothed maximum likelihood expectation maximization (MLEM), evaluated in terms of structural similarity index (SSIM), normalized root mean square error (NRMSE), bias, and standard deviation. Both simulated BrainWeb (10 noise realizations) and real [18 F] fluorodeoxyglucose (FDG) three-dimensional datasets were used. The real [18 F]FDG dataset was augmented with simulated tumors to allow comparison of the reconstruction methodologies for the case of known regions of PET-MR discrepancy and evaluated at full counts (100%) and at a reduced (10%) count level. RESULTS:For the high-count simulated and real data studies, the anato-functional MAP method performed better than the other methods under investigation (MR-informed, PET-MR-informed and postsmoothed MLEM), in terms of achieving the best trade-off for the reconstruction of the whole brain and PET-unique regions, assessed in terms of the SSIM, NRMSE, and bias vs standard deviation. The inclusion of PET information in the anato-functional MAP method enables the reconstruction of PET-unique regions to attain similarly low levels of bias as unsmoothed MLEM, while moderately improving the whole brain image quality for low levels of regularization. However, for low count simulated datasets the anato-functional MAP method performs poorly, due to the inclusion of noisy PET information in the regularization term. For the low counts simulated dataset, KEM LVS and to a lesser extent, HKEM performed better than the other methods under investigation in terms of achieving the best trade-off for the reconstruction of the whole brain and PET-unique regions, assessed in terms of the SSIM, NRMSE, and bias vs standard deviation. CONCLUSION:For the reconstruction of noisy data, multiple MR-informed methods produce favorable whole brain vs PET-unique region trade-off in terms of the image quality metrics of SSIM and NRMSE, comfortably outperforming the whole image denoising of postsmoothed MLEM.
| S-EPMC6899618 | biostudies-literature
Project description:In positron emission tomography (PET) image reconstruction, the Bayesian framework with various regularization terms has been implemented to constrain the radio tracer distribution. Varying the regularizing weight of a maximum a posteriori (MAP) algorithm specifies a lower bound of the tradeoff between variance and spatial resolution measured from the reconstructed images. The purpose of this paper is to build a patch-based image enhancement scheme to reduce the size of the unachievable region below the bound and thus to quantitatively improve the Bayesian PET imaging. We cast the proposed enhancement as a regression problem which models a highly nonlinear and spatial-varying mapping between the reconstructed image patches and an enhanced image patch. An artificial neural network model named multilayer perceptron (MLP) with backpropagation was used to solve this regression problem through learning from examples. Using the BrainWeb phantoms, we simulated brain PET data at different count levels of different subjects with and without lesions. The MLP was trained using the image patches reconstructed with a MAP algorithm of different regularization parameters for one normal subject at a certain count level. To evaluate the performance of the trained MLP, reconstructed images from other simulations and two patient brain PET imaging data sets were processed. In every testing cases, we demonstrate that the MLP enhancement technique improves the noise and bias tradeoff compared with the MAP reconstruction using different regularizing weights thus decreasing the size of the unachievable region defined by the MAP algorithm in the variance/resolution plane.
| S-EPMC6132251 | biostudies-literature