Performance of sparse-view CT reconstruction with multi-directional gradient operators.
Ontology highlight
ABSTRACT:
SUBMITTER: Hsieh CJ
PROVIDER: S-EPMC6322781 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Sparse-view CT reconstruction is a fundamental task in computed tomography to overcome undesired artifacts and recover the details of textual structure in degraded CT images. Recently, many deep learning-based networks have achieved desirable performances compared to iterative reconstruction algorithms. However, the performance of these methods may severely deteriorate when the degradation strength of the test image is not consistent with that of the training dataset. In addition, these methods do not pay enough attention to the characteristics of different degradation levels, so solely extending the training dataset with multiple degraded images is also not effective. Although training plentiful models in terms of each degradation level can mitigate this problem, extensive parameter storage is involved. Accordingly, in this paper, we focused on sparse-view CT reconstruction for multiple degradation levels. We propose a single degradation-aware deep learning framework to predict clear CT images by understanding the disparity of degradation in both the frequency domain and image domain. The dual-domain procedure can perform particular operations at different degradation levels in frequency component recovery and spatial details reconstruction. The peak signal-to-noise ratio (PSNR), structural similarity (SSIM) and visual results demonstrate that our method outperformed the classical deep learning-based reconstruction methods in terms of effectiveness and scalability.
| S-EPMC8704775 | biostudies-literature
Project description:PURPOSE:Currently, four-dimensional (4D) cone-beam computed tomography (CBCT) requires a 3-4 min full-fan scan to ensure usable image quality. Recent advancements in sparse-view 4D-CBCT reconstruction have opened the possibility to reduce scan time and dose. The aim of this study is to provide a common framework for systematically evaluating algorithms for 4D-CBCT reconstruction from a 1-min scan. Using this framework, the AAPM-sponsored SPARE Challenge was conducted in 2018 to identify and compare state-of-the-art algorithms. METHODS:A clinically realistic CBCT dataset was simulated using patient CT volumes from the 4D-Lung database. The selected patients had multiple 4D-CT sessions, where the first 4D-CT was used as the prior CT, and the rest were used as the ground truth volumes for simulating CBCT projections. A GPU-based Monte Carlo tool was used to simulate the primary, scatter, and quantum noise signals. A total of 32 CBCT scans of nine patients were generated. Additional qualitative analysis was performed on a clinical Varian and clinical Elekta dataset to validate the simulation study. Participants were blinded from the ground truth, and were given 3 months to apply their reconstruction algorithms to the projection data. The submitted reconstructions were analyzed in terms of root-mean-squared-error (RMSE) and structural similarity index (SSIM) with the ground truth within four different region-of-interests (ROI) - patient body, lungs, planning target volume (PTV), and bony anatomy. Geometric accuracy was quantified as the alignment error of the PTV. RESULTS:Twenty teams participated in the challenge, with five teams completing the challenge. Techniques involved in the five methods included iterative optimization, motion-compensation, and deformation of the prior 4D-CT. All five methods rendered significant reduction in noise and streaking artifacts when compared to the conventional Feldkamp-Davis-Kress (FDK) algorithm. The RMS of the three-dimensional (3D) target registration error of the five methods ranged from 1.79 to 3.00 mm. Qualitative observations from the Varian and Elekta datasets mostly concur with those from the simulation dataset. Each of the methods was found to have its own strengths and weaknesses. Overall, the MA-ROOSTER method, which utilizes a 4D-CT motion model for temporal regularization, had the best and most consistent image quality and accuracy. CONCLUSION:The SPARE Challenge represents the first framework for systematically evaluating state-of-the-art algorithms for 4D-CBCT reconstruction from a 1-min scan. Results suggest the potential for reducing scan time and dose for 4D-CBCT. The challenge dataset and analysis framework are publicly available for benchmarking future reconstruction algorithms.
| S-EPMC6739166 | biostudies-literature
Project description:ObjectiveStimulated Raman projection tomography (SRPT), a recently developed label-free volumetric chemical imaging technology, has been reported to quantitatively reconstruct the distribution of chemicals in a three-dimensional (3D) complex system. The current image reconstruction scheme used in SRPT is based on a filtered back projection (FBP) algorithm that requires at least 180 angular-dependent projections to rebuild a reasonable SRPT image, resulting in a long total acquisition time. This is a big limitation for longitudinal studies on live systems.MethodsWe present a sparse-view data-based sparse reconstruction scheme, in which sparsely sampled projections at 180 degrees were used to reconstruct the volumetric information. In the scheme, the simultaneous algebra reconstruction technique (SART), combined with total variation regularization, was used for iterative reconstruction. To better describe the projection process, a pixel vertex driven model (PVDM) was developed to act as projectors, whose performance was compared with those of the distance driven model (DDM).ResultsWe evaluated our scheme with numerical simulations and validated it for SRPT by mapping lipid contents in adipose cells. Simulation results showed that the PVDM performed better than the DDM in the case of using sparse-view data. Our scheme could maintain the quality of the reconstructed images even when the projection number was reduced to 15. The cell-based experimental results demonstrated that the proposed scheme can improve the imaging speed of the current FBP-based SRPT scheme by a factor of 9-12 without sacrificing discernible imaging details.ConclusionOur proposed scheme significantly reduces the total acquisition time required for SRPT at a speed of one order of magnitude faster than the currently used scheme. This significant improvement in imaging speed would potentially promote the applicability of SRPT for imaging living organisms.
| S-EPMC7329365 | biostudies-literature
Project description:To develop and investigate a deep learning approach that uses sparse-view acquisition in dedicated breast computed tomography for radiation dose reduction, we propose a framework that combines 3D sparse-view cone-beam acquisition with a multi-slice residual dense network (MS-RDN) reconstruction. Projection datasets (300 views, full-scan) from 34 women were reconstructed using the FDK algorithm and served as reference. Sparse-view (100 views, full-scan) projection data were reconstructed using the FDK algorithm. The proposed MS-RDN uses the sparse-view and reference FDK reconstructions as input and label, respectively. Our MS-RDN evaluated with respect to fully sampled FDK reference yields superior performance, quantitatively and visually, compared to conventional compressed sensing methods and state-of-the-art deep learning based methods. The proposed deep learning driven framework can potentially enable low dose breast CT imaging.
| S-EPMC7713379 | biostudies-literature
Project description:Compressive sensing (CS) has proved effective for tomographic reconstruction from sparsely collected data or under-sampled measurements, which are practically important for few-view computed tomography (CT), tomosynthesis, interior tomography, and so on. To perform sparse-data CT, the iterative reconstruction commonly uses regularizers in the CS framework. Currently, how to choose the parameters adaptively for regularization is a major open problem. In this paper, inspired by the idea of machine learning especially deep learning, we unfold the state-of-the-art "fields of experts"-based iterative reconstruction scheme up to a number of iterations for data-driven training, construct a learned experts' assessment-based reconstruction network (LEARN) for sparse-data CT, and demonstrate the feasibility and merits of our LEARN network. The experimental results with our proposed LEARN network produces a superior performance with the well-known Mayo Clinic low-dose challenge data set relative to the several state-of-the-art methods, in terms of artifact reduction, feature preservation, and computational speed. This is consistent to our insight that because all the regularization terms and parameters used in the iterative reconstruction are now learned from the training data, our LEARN network utilizes application-oriented knowledge more effectively and recovers underlying images more favorably than competing algorithms. Also, the number of layers in the LEARN network is only 50, reducing the computational complexity of typical iterative algorithms by orders of magnitude.
| S-EPMC6019143 | biostudies-literature
Project description:Multi-view data have been routinely collected in various fields of science and engineering. A general problem is to study the predictive association between multivariate responses and multi-view predictor sets, all of which can be of high dimensionality. It is likely that only a few views are relevant to prediction, and the predictors within each relevant view contribute to the prediction collectively rather than sparsely. We cast this new problem under the familiar multivariate regression framework and propose an integrative reduced-rank regression (iRRR), where each view has its own low-rank coefficient matrix. As such, latent features are extracted from each view in a supervised fashion. For model estimation, we develop a convex composite nuclear norm penalization approach, which admits an efficient algorithm via alternating direction method of multipliers. Extensions to non-Gaussian and incomplete data are discussed. Theoretically, we derive non-asymptotic oracle bounds of iRRR under a restricted eigenvalue condition. Our results recover oracle bounds of several special cases of iRRR including Lasso, group Lasso, and nuclear norm penalized regression. Therefore, iRRR seamlessly bridges group-sparse and low-rank methods and can achieve substantially faster convergence rate under realistic settings of multi-view learning. Simulation studies and an application in the Longitudinal Studies of Aging further showcase the efficacy of the proposed methods.
| S-EPMC6849205 | biostudies-literature
Project description:The task of gene regulatory network reconstruction from high-throughput data is receiving increasing attention in recent years. As a consequence, many inference methods for solving this task have been proposed in the literature. It has been recently observed, however, that no single inference method performs optimally across all datasets. It has also been shown that the integration of predictions from multiple inference methods is more robust and shows high performance across diverse datasets. Inspired by this research, in this paper, we propose a machine learning solution which learns to combine predictions from multiple inference methods. While this approach adds additional complexity to the inference process, we expect it would also carry substantial benefits. These would come from the automatic adaptation to patterns on the outputs of individual inference methods, so that it is possible to identify regulatory interactions more reliably when these patterns occur. This article demonstrates the benefits (in terms of accuracy of the reconstructed networks) of the proposed method, which exploits an iterative, semi-supervised ensemble-based algorithm. The algorithm learns to combine the interactions predicted by many different inference methods in the multi-view learning setting. The empirical evaluation of the proposed algorithm on a prokaryotic model organism (E. coli) and on a eukaryotic model organism (S. cerevisiae) clearly shows improved performance over the state of the art methods. The results indicate that gene regulatory network reconstruction for the real datasets is more difficult for S. cerevisiae than for E. coli. The software, all the datasets used in the experiments and all the results are available for download at the following link: http://figshare.com/articles/Semi_supervised_Multi_View_Learning_for_Gene_Network_Reconstruction/1604827.
| S-EPMC4671612 | biostudies-literature
Project description:This paper presents a novel approach to recover true fine surface detail of deforming meshes reconstructed from multi-view video. Template-based methods for performance capture usually produce a coarse-to-medium scale detail 4D surface reconstruction which does not contain the real high-frequency geometric detail present in the original video footage. Fine scale deformation is often incorporated in a second pass by using stereo constraints, features, or shading-based refinement. In this paper, we propose an alternative solution to this second stage by formulating dense dynamic surface reconstruction as a global optimization problem of the densely deforming surface. Our main contribution is an implicit representation of a deformable mesh that uses a set of Gaussian functions on the surface to represent the initial coarse mesh, and a set of Gaussians for the images to represent the original captured multi-view images. We effectively find the fine scale deformations for all mesh vertices, which maximize photo-temporal-consistency, by densely optimizing our model-to-image consistency energy on all vertex positions. Our formulation yields a smooth closed form energy with implicit occlusion handling and analytic derivatives. Furthermore, it does not require error-prone correspondence finding or discrete sampling of surface displacement values. We demonstrate our approach on a variety of datasets of human subjects wearing loose clothing and performing different motions. We qualitatively and quantitatively demonstrate that our technique successfully reproduces finer detail than the input baseline geometry.
| S-EPMC6979538 | biostudies-literature
Project description:Spectral computed tomography (CT) provides information on material characterization and quantification because of its ability to separate different basis materials. Dual-energy (DE) CT provides two sets of measurements at two different source energies. In principle, two materials can be accurately decomposed from DECT measurements. However, many clinical and industrial applications require three or more material images. For triple-material decomposition, a third constraint, such as volume conservation, mass conservation or both, is required to solve three sets of unknowns from two sets of measurements. The recently proposed flexible image-domain (ID) multi-material decomposition) method assumes each pixel contains at most three materials out of several possible materials and decomposes a mixture pixel by pixel. We propose a penalized-likelihood (PL) method with edge-preserving regularizers for each material to reconstruct multi-material images using a similar constraint from sinogram data. We develop an optimization transfer method with a series of pixel-wise separable quadratic surrogate (PWSQS) functions to monotonically decrease the complicated PL cost function. The PWSQS algorithm separates pixels to allow simultaneous update of all pixels, but keeps the basis materials coupled to allow faster convergence rate than our previous proposed material- and pixel-wise SQS algorithms. Comparing with the ID method using 2-D fan-beam simulations, the PL method greatly reduced noise, streak and cross-talk artifacts in the reconstructed basis component images, and achieved much smaller root mean square errors.
| S-EPMC4125500 | biostudies-literature
Project description:While the recent advancements of computed tomography (CT) technology have contributed in reducing radiation dose and image noise, an objective evaluation of image quality in patient scans has not yet been established. In this study, we present a patient-specific CT image quality evaluation method that includes fully automated measurements of noise level, structure sharpness, and alteration of structure. This study used the CT images of 120 patients from four different CT scanners reconstructed with three types of algorithm: filtered back projection (FBP), vendor-specific iterative reconstruction (IR), and a vendor-agnostic deep learning model (DLM, ClariCT.AI, ClariPi Inc.). The structure coherence feature (SCF) was used to divide an image into the homogeneous (RH) and structure edge (RS) regions, which in turn were used to localize the regions of interests (ROIs) for subsequent analysis of image quality indices. The noise level was calculated by averaging the standard deviations from five randomly selected ROIs on RH, and the mean SCFs on RS was used to estimate the structure sharpness. The structure alteration was defined by the standard deviation ratio between RS and RH on the subtraction image between FBP and IR or DLM, in which lower structure alterations indicate successful noise reduction without degradation of structure details. The estimated structure sharpness showed a high correlation of 0.793 with manually measured edge slopes. Compared to FBP, IR and DLM showed 34.38% and 51.30% noise reduction, 2.87% and 0.59% lower structure sharpness, and 2.20% and -12.03% structure alteration, respectively, on an average. DLM showed statistically superior performance to IR in all three image quality metrics. This study is expected to contribute to enhance the CT protocol optimization process by allowing a high throughput and quantitative image quality evaluation during the introduction or adjustment of lower-dose CT protocol into routine practice.
| S-EPMC9299323 | biostudies-literature