Accelerating electron tomography reconstruction algorithm ICON with GPU.
Ontology highlight
ABSTRACT:
SUBMITTER: Chen Y
PROVIDER: S-EPMC5516007 | biostudies-other | 2017
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Maximum-likelihood (ML) estimation has very desirable properties for reconstructing 3D volumes from noisy cryo-EM images of single macromolecular particles. Current implementations of ML estimation make use of the Expectation-Maximization (EM) algorithm or its variants. However, the EM algorithm is notoriously computation-intensive, as it involves integrals over all orientations and positions for each particle image. We present a strategy to speedup the EM algorithm using domain reduction. Domain reduction uses a coarse grid to evaluate regions in the integration domain that contribute most to the integral. The integral is evaluated with a fine grid in these regions. In the simulations reported in this paper, domain reduction gives speedups which exceed a factor of 10 in early iterations and which exceed a factor of 60 in terminal iterations.
| S-EPMC2967204 | biostudies-literature
Project description:The recent advent of tensor tomography techniques has enabled tomographic investigations of the 3D nanostructure organization of biological and material science samples. These techniques extended the concept of conventional X-ray tomography by reconstructing not only a scalar value such as the attenuation coefficient per voxel, but also a set of parameters that capture the local anisotropy of nanostructures within every voxel of the sample. Tensor tomography data sets are intrinsically large as each pixel of a conventional X-ray projection is substituted by a scattering pattern, and projections have to be recorded at different sample angular orientations with several tilts of the rotation axis with respect to the X-ray propagation direction. Currently available reconstruction approaches for such large data sets are computationally expensive. Here, a novel, fast reconstruction algorithm, named iterative reconstruction tensor tomography (IRTT), is presented to simplify and accelerate tensor tomography reconstructions. IRTT is based on a second-rank tensor model to describe the anisotropy of the nanostructure in every voxel and on an iterative error backpropagation reconstruction algorithm to achieve high convergence speed. The feasibility and accuracy of IRTT are demonstrated by reconstructing the nanostructure anisotropy of three samples: a carbon fiber knot, a human bone trabecula specimen and a fixed mouse brain. Results and reconstruction speed were compared with those obtained by the small-angle scattering tensor tomography (SASTT) reconstruction method introduced by Liebi et al. [Nature (2015), 527, 349-352]. The principal orientation of the nanostructure within each voxel revealed a high level of agreement between the two methods. Yet, for identical data sets and computer hardware used, IRTT was shown to be more than an order of magnitude faster. IRTT was found to yield robust results, it does not require prior knowledge of the sample for initializing parameters, and can be used in cases where simple anisotropy metrics are sufficient, i.e. the tensor approximation adequately captures the level of anisotropy and the dominant orientation within a voxel. In addition, by greatly accelerating the reconstruction, IRTT is particularly suitable for handling large tomographic data sets of samples with internal structure or as a real-time analysis tool during the experiment for online feedback during data acquisition. Alternatively, the IRTT results might be used as an initial guess for models capturing a higher complexity of structural anisotropy such as spherical harmonics based SASTT in Liebi et al. (2015), improving both overall convergence speed and robustness of the reconstruction.
| S-EPMC6396401 | biostudies-literature
Project description:Among all the factors that determine the resolution of a 3D reconstruction by single particle electron cryo-microscopy (cryoEM), the number of particle images used in the dataset plays a major role. More images generally yield better resolution, assuming the imaged protein complex is conformationally and compositionally homogeneous. To facilitate processing of very large datasets, we modified the computer program, FREALIGN, to execute the computationally most intensive procedures on Graphics Processing Units (GPUs). Using the modified program, the execution speed increased between 10 and 240-fold depending on the task performed by FREALIGN. Here we report the steps necessary to parallelize critical FREALIGN subroutines and evaluate its performance on computers with multiple GPUs.
| S-EPMC2964447 | biostudies-literature
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-other
Project description:Cryogenic electron tomography (cryoET) allows visualization of cellular structures in situ. However, anisotropic resolution arising from the intrinsic "missing-wedge" problem has presented major challenges in visualization and interpretation of tomograms. Here, we have developed IsoNet, a deep learning-based software package that iteratively reconstructs the missing-wedge information and increases signal-to-noise ratio, using the knowledge learned from raw tomograms. Without the need for sub-tomogram averaging, IsoNet generates tomograms with significantly reduced resolution anisotropy. Applications of IsoNet to three representative types of cryoET data demonstrate greatly improved structural interpretability: resolving lattice defects in immature HIV particles, establishing architecture of the paraflagellar rod in Eukaryotic flagella, and identifying heptagon-containing clathrin cages inside a neuronal synapse of cultured cells. Therefore, by overcoming two fundamental limitations of cryoET, IsoNet enables functional interpretation of cellular tomograms without sub-tomogram averaging. Its application to high-resolution cellular tomograms should also help identify differently oriented complexes of the same kind for sub-tomogram averaging.
| S-EPMC9617606 | biostudies-literature
Project description:3D image reconstruction with electron tomography holds problems due to the severely limited range of projection angles and low signal to noise ratio of the acquired projection images. The maximum a posteriori (MAP) reconstruction methods have been successful in compensating for the missing information and suppressing noise with their intrinsic regularization techniques. There are two major problems in MAP reconstruction methods: (1) selection of the regularization parameter that controls the balance between the data fidelity and the prior information, and (2) long computation time. One aim of this study is to provide an adaptive solution to the regularization parameter selection problem without having additional knowledge about the imaging environment and the sample. The other aim is to realize the reconstruction using sequences of resolution levels to shorten the computation time. The reconstructions were analyzed in terms of accuracy and computational efficiency using a simulated biological phantom and publically available experimental datasets of electron tomography. The numerical and visual evaluations of the experiments show that the adaptive multiresolution method can provide more accurate results than the weighted back projection (WBP), simultaneous iterative reconstruction technique (SIRT), and sequential MAP expectation maximization (sMAPEM) method. The method is superior to sMAPEM also in terms of computation time and usability since it can reconstruct 3D images significantly faster without requiring any parameter to be set by the user.
| S-EPMC7115799 | biostudies-literature
Project description:Three-dimensional (3D) reconstruction of a single protein molecule is essential for understanding the relationship between the structural dynamics and functions of the protein. Electron tomography (ET) provides a tool for imaging an individual particle of protein from a series of tilted angles. Individual-particle electron tomography (IPET) provides an approach for reconstructing a 3D density map from a single targeted protein particle (without averaging from different particles of this type of protein), in which the target particle was imaged from a series of tilting angles. However, owing to radiation damage limitations, low-dose images (high noise, and low image contrast) are often challenging to be aligned for 3D reconstruction at intermediate resolution (1-3 nm). Here, we propose a computational method to enhance the image contrast, without increasing any experimental dose, for IPET 3D reconstruction. Using an edge-preserving smoothing-based multi-scale image decomposition algorithm, this method can detect the object against a high-noise background and enhance the object image contrast without increasing the noise level or significantly decreasing the image resolution. The method was validated by using both negative staining (NS) ET and cryo-ET images. The successful 3D reconstruction of a small molecule (<100 kDa) indicated that this method can be used as a supporting tool to current ET 3D reconstruction methods for studying protein dynamics via structure determination from each individual particle of the same type of protein.
| S-EPMC6232092 | biostudies-literature
Project description:Optoacoustic tomography (OAT) is inherently a three-dimensional (3D) inverse problem. However, most studies of OAT image reconstruction still employ two-dimensional imaging models. One important reason is because 3D image reconstruction is computationally burdensome. The aim of this work is to accelerate existing image reconstruction algorithms for 3D OAT by use of parallel programming techniques.Parallelization strategies are proposed to accelerate a filtered backprojection (FBP) algorithm and two different pairs of projection/backprojection operations that correspond to two different numerical imaging models. The algorithms are designed to fully exploit the parallel computing power of graphics processing units (GPUs). In order to evaluate the parallelization strategies for the projection/backprojection pairs, an iterative image reconstruction algorithm is implemented. Computer simulation and experimental studies are conducted to investigate the computational efficiency and numerical accuracy of the developed algorithms.The GPU implementations improve the computational efficiency by factors of 1000, 125, and 250 for the FBP algorithm and the two pairs of projection/backprojection operators, respectively. Accurate images are reconstructed by use of the FBP and iterative image reconstruction algorithms from both computer-simulated and experimental data.Parallelization strategies for 3D OAT image reconstruction are proposed for the first time. These GPU-based implementations significantly reduce the computational time for 3D image reconstruction, complementing our earlier work on 3D OAT iterative image reconstruction.
| S-EPMC3581128 | biostudies-other
Project description:Mesoscopic fluorescent molecular tomography (MFMT) enables to image fluorescent molecular probes beyond the typical depth limits of microscopic imaging and with enhanced resolution compared to macroscopic imaging. However, MFMT is a scattering-based inverse problem that is an ill-posed inverse problem and hence, requires relative complex iterative solvers coupled with regularization strategies. Inspired by the potential of deep learning in performing image formation tasks from raw measurements, this work proposes a hybrid approach to solve the MFMT inverse problem. This methodology combines a convolutional symmetric network and a conventional iterative algorithm to accelerate the reconstruction procedure. By the proposed deep neural network, the principal components of the sensitivity matrix are extracted and the accompanying noise in measurements is suppressed, which helps to accelerate the reconstruction and improve the accuracy of results. We apply the proposed method to reconstruct in silico and vascular tree models. The results demonstrate that reconstruction accuracy and speed are highly improved due to the reduction of redundant entries of the sensitivity matrix and noise suppression.
| S-EPMC8650049 | biostudies-literature
Project description:The development of small-angle scattering tensor tomography has enabled the study of anisotropic nanostructures in a volume-resolved manner. It is of great value to have reconstruction methods that can handle many different nanostructural symmetries. For such a method to be employed by researchers from a wide range of backgrounds, it is crucial that its reliance on prior knowledge about the system is minimized, and that it is robust under various conditions. Here, a method is presented that employs band-limited spherical functions to enable the reconstruction of reciprocal-space maps of a wide variety of nanostructures. This method has been thoroughly tested and compared with existing methods in its ability to retrieve known reciprocal-space maps, as well as its robustness to changes in initial conditions, using both simulations and experimental data. It has also been evaluated for its computational performance. The anchoring of this method in a framework of integral geometry and linear algebra highlights its possibilities and limitations.
| S-EPMC10626654 | biostudies-literature