Low-Dose Micro-CT Imaging for Vascular Segmentation and Analysis Using Sparse-View Acquisitions

The aim of this study is to investigate whether reliable and accurate 3D geometrical models of the murine aortic arch can be constructed from sparse-view data in vivo micro-CT acquisitions. This would considerably reduce acquisition time and X-ray dose. In vivo contrast-enhanced micro-CT datasets were reconstructed using a conventional filtered back projection algorithm (FDK), the image space reconstruction algorithm (ISRA) and total variation regularized ISRA (ISRA-TV). The reconstructed images were then semi-automatically segmented. Segmentations of high- and low-dose protocols were compared and evaluated based on voxel classification, 3D model diameters and centerline differences. FDK reconstruction does not lead to accurate segmentation in the case of low-view acquisitions. ISRA manages accurate segmentation with 1024 or more projection views. ISRA-TV needs a minimum of 256 views. These results indicate that accurate vascular models can be obtained from micro-CT scans with 8 times less X-ray dose and acquisition time, as long as regularized iterative reconstruction is used.     

Bayesian sparse‐based reconstruction in bioluminescence tomography improves localization accuracy and reduces computational time

Bioluminescence tomography (BLT) provides fundamental insight into biological processes in vivo. To fully realize its potential, it is important to develop image reconstruction algorithms that accurately visualize and quantify the bioluminescence signals taking advantage of limited boundary measurements. In this study, a new 2‐step reconstruction method for BLT is developed by taking advantage of the sparse a priori information of the light emission using multispectral measurements. The first step infers a wavelength‐dependent prior by using all multi‐wavelength measurements. The second step reconstructs the source distribution based on this developed prior. Simulation, phantom and in vivo results were performed to assess and compare the accuracy and the computational efficiency of this algorithm with conventional sparsity‐promoting BLT reconstruction algorithms, and results indicate that the position errors are reduced from a few millimeters down to submillimeter, and reconstruction time is reduced by 3 orders of magnitude in most cases, to just under a few seconds. The recovery of single objects and multiple (2 and 3) small objects is simulated, and the recovery of images of a mouse phantom and an experimental animal with an existing luminescent source in the abdomen is demonstrated. Matlab code is available at https://github.com/jinchaofeng/code/tree/master .      

Towards a biomechanics-based technique for assessing myocardial contractility: an inverse problem approach

This work presents the initial development and implementation of a novel 3D biomechanics-based approach to measure the mechanical activity of myocardial tissue, as a potential non-invasive tool to assess myocardial function. This technique quantifies the myocardial contraction forces developed within the ventricular myofibers in response to electro-physiological stimuli. We provide a 3D finite element formulation of a contraction force reconstruction algorithm, along with its implementation using magnetic resonance (MR) data. Our algorithm is based on an inverse problem solution governed by the fundamental continuum mechanics principle of conservation of linear momentum, under a first-order approximation of elastic and isotropic material conditions. We implemented our technique using a subject-specific ventricle model obtained by extracting the left ventricular anatomical features from a set of high-resolution cardiac MR images acquired throughout the cardiac cycle using prospective electrocardiographic gating. Cardiac motion information was extracted by non-rigid registration of the mid-diastole reference image to the remaining images of a 4D dataset. Using our technique, we reconstructed dynamic maps that show the contraction force distribution superimposed onto the deformed ventricle model at each acquired frame in the cardiac cycle. Our next objective will consist of validating this technique by showing the correlation between the presence of low contraction force patterns and poor myocardial functionality.     

3D Coronary Artery Reconstruction by 2D Motion Compensation Based on Mutual Information

Background

3D reconstruction of the coronary arteries can provide more information in the interventional surgery. Motion compensation is one kind of the 3D reconstruction method.

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.     

A fast reconstruction algorithm for electron microscope tomography

We have implemented a Fast Fourier Summation algorithm for tomographic reconstruction of three-dimensional biological data sets obtained via transmission electron microscopy. We designed the fast algorithm to reproduce results obtained by the direct summation algorithm (also known as filtered or R-weighted backprojection). For two-dimensional images, the new algorithm scales as O(N(theta)M log M)+O(MN log N) operations, where N(theta) is the number of projection angles and M x N is the size of the reconstructed image. Three-dimensional reconstructions are constructed from sequences of two-dimensional reconstructions. We demonstrate the algorithm on real data sets. For typical sizes of data sets, the new algorithm is 1.5-2.5 times faster than using direct summation in the space domain. The speed advantage is even greater as the size of the data sets grows. The new algorithm allows us to use higher order spline interpolation of the data without additional computational cost. The algorithm has been incorporated into a commonly used package for tomographic reconstruction.     

IMIRS: a high-resolution 3D reconstruction package integrated with a relational image database

Recent advances in electron cryomicroscopy instrumentation and single particle reconstruction have created opportunities for high-throughput and high-resolution three-dimensional (3D) structure determination of macromolecular complexes. However, it has become impractical and inefficient to rely on conventional text file data management and command-line programs to organize and process the increasing numbers of image data required in high-resolution studies. Here, we present a distributed relational database for managing complex datasets and its integration into our high-resolution software package IMIRS (Image Management and Icosahedral Reconstruction System). IMIRS consists of a complete set of modular programs for icosahedral reconstruction organized under a graphical user interface and provides options for user-friendly, step-by-step data processing as well as automatic reconstruction. We show that the integration of data management with processing in IMIRS automates the tedious tasks of data management, enables data coherence, and facilitates information sharing in a distributed computer and user environment without significantly increasing the time of program execution. We demonstrate the applicability of IMIRS in icosahedral reconstruction toward high resolution by using it to obtain an 8-A 3D structure of an intermediate-sized dsRNA virus.     

A multiresolution approach to orientation assignment in 3D electron microscopy of single particles

Three-dimensional (3D) electron microscopy (3DEM) aims at the determination of the spatial distribution of the Coulomb potential of macromolecular complexes. The 3D reconstruction of a macromolecule using single-particle techniques involves thousands of 2D projections. One of the key parameters required to perform such a 3D reconstruction is the orientation of each projection image as well as its in-plane orientation. This information is unknown experimentally and must be determined using image-processing techniques. We propose the use of wavelets to match the experimental projections with those obtained from a reference 3D model. The wavelet decomposition of the projection images provides a framework for a multiscale matching algorithm in which speed and robustness to noise are gained. Furthermore, this multiresolution approach is combined with a novel orientation selection strategy. Results obtained from computer simulations as well as experimental data encourage the use of this approach.     

3D reconstruction techniques of human coronary bifurcations for shear stress computations

Background

Heterogeneity in plaque composition in human coronary artery bifurcations is associated with blood flow induced shear stress. Shear stress is generally determined by combing 3D lumen data and computational fluid dynamics (CFD). We investigated two new procedures to generate 3D lumen reconstructions of coronary artery bifurcations for shear stress computations.

Methods

We imaged 10 patients with multislice computer tomography (MSCT) and intravascular ultrasound (IVUS). The 3D reconstruction of the main branch was based on the fusion of MSCT and IVUS. The proximal part of side branch was reconstructed using IVUS data or MSCT data, resulting in two different reconstructions of the bifurcation region. The distal part of the side branch was based on MSCT data alone. The reconstructed lumen was combined with CFD to determine the shear stress. Low and high shear stress regions were defined and shear stress patterns in the bifurcation regions were investigated.

Results

The 3D coronary bifurcations were successfully generated with both reconstruction procedures. The geometrical features of the bifurcation region for the two reconstruction procedures did not reveal appreciable differences. The shear stress maps showed a qualitative agreement, and the low and high shear stress regions were similar in size and average shear stress values were identical. The low and high shear stress regions showed an overlap of approximately 75%.

Conclusion

Reconstruction of the side branch with MSCT data alone is an adequate technique to study shear stress and wall thickness in the bifurcation region. The reconstruction procedure can be applied to further investigate the effect of shear stress on atherosclerosis in coronary bifurcations.     

IVUS Validation of Patient Coronary Artery Lumen Area Obtained from CT Images

Aims

Accurate computed tomography (CT)-based reconstruction of coronary morphometry (diameters, length, bifurcation angles) is important for construction of patient-specific models to aid diagnosis and therapy. The objective of this study is to validate the accuracy of patient coronary artery lumen area obtained from CT images based on intravascular ultrasound (IVUS).

Methods and Results

Morphometric data of 5 patient CT scans with 11 arteries from IVUS were reconstructed including the lumen cross sectional area (CSA), diameter and length. The volumetric data from CT images were analyzed at sub-pixel accuracy to obtain accurate vessel center lines and CSA. A new center line extraction approach was used where an initial estimated skeleton in discrete value was obtained using a traditional thinning algorithm. The CSA was determined directly without any circular shape assumptions to provide accurate reconstruction of stenosis. The root-mean-square error (RMSE) for CSA and diameter were 16.2% and 9.5% respectively.

Conclusions

The image segmentation and CSA extraction algorithm for reconstruction of coronary arteries proved to be accurate for determination of vessel lumen area. This approach provides fundamental morphometric data for patient-specific models to diagnose and treat coronary artery disease.     

A Novel Iterative CT Reconstruction Approach Based on FBP Algorithm

The Filtered Back-Projection (FBP) algorithm and its modified versions are the most important techniques for CT (Computerized tomography) reconstruction, however, it may produce aliasing degradation in the reconstructed images due to projection discretization. The general iterative reconstruction (IR) algorithms suffer from their heavy calculation burden and other drawbacks. In this paper, an iterative FBP approach is proposed to reduce the aliasing degradation. In the approach, the image reconstructed by FBP algorithm is treated as the intermediate image and projected along the original projection directions to produce the reprojection data. The difference between the original and reprojection data is filtered by a special digital filter, and then is reconstructed by FBP to produce a correction term. The correction term is added to the intermediate image to update it. This procedure can be performed iteratively to improve the reconstruction performance gradually until certain stopping criterion is satisfied. Some simulations and tests on real data show the proposed approach is better than FBP algorithm or some IR algorithms in term of some general image criteria. The calculation burden is several times that of FBP, which is much less than that of general IR algorithms and acceptable in the most situations. Therefore, the proposed algorithm has the potential applications in practical CT systems.     

A Fast Image Alignment Approach for 2D Classification of Cryo-EM Images Using Spectral Clustering

Three-dimensional (3D) reconstruction in single-particle cryo-electron microscopy (cryo-EM) is a significant technique for recovering the 3D structure of proteins or other biological macromolecules from their two-dimensional (2D) noisy projection images taken from unknown random directions. Class averaging in single-particle cryo-EM is an important procedure for producing high-quality initial 3D structures, where image alignment is a fundamental step. In this paper, an efficient image alignment algorithm using 2D interpolation in the frequency domain of images is proposed to improve the estimation accuracy of alignment parameters of rotation angles and translational shifts between the two projection images, which can obtain subpixel and subangle accuracy. The proposed algorithm firstly uses the Fourier transform of two projection images to calculate a discrete cross-correlation matrix and then performs the 2D interpolation around the maximum value in the cross-correlation matrix. The alignment parameters are directly determined according to the position of the maximum value in the cross-correlation matrix after interpolation. Furthermore, the proposed image alignment algorithm and a spectral clustering algorithm are used to compute class averages for single-particle 3D reconstruction. The proposed image alignment algorithm is firstly tested on a Lena image and two cryo-EM datasets. Results show that the proposed image alignment algorithm can estimate the alignment parameters accurately and efficiently. The proposed method is also used to reconstruct preliminary 3D structures from a simulated cryo-EM dataset and a real cryo-EM dataset and to compare them with RELION. Experimental results show that the proposed method can obtain more high-quality class averages than RELION and can obtain higher reconstruction resolution than RELION even without iteration.     

Single particle 3D reconstruction for 2D crystal images of membrane proteins

In cases where ultra-flat cryo-preparations of well-ordered two-dimensional (2D) crystals are available, electron crystallography is a powerful method for the determination of the high-resolution structures of membrane and soluble proteins. However, crystal unbending and Fourier-filtering methods in electron crystallography three-dimensional (3D) image processing are generally limited in their performance for 2D crystals that are badly ordered or non-flat. Here we present a single particle image processing approach, which is implemented as an extension of the 2D crystallographic pipeline realized in the 2dx software package, for the determination of high-resolution 3D structures of membrane proteins. The algorithm presented, addresses the low single-to-noise ratio (SNR) of 2D crystal images by exploiting neighborhood correlation between adjacent proteins in the 2D crystal. Compared with conventional single particle processing for randomly oriented particles, the computational costs are greatly reduced due to the crystal-induced limited search space, which allows a much finer search space compared to classical single particle processing. To reduce the considerable computational costs, our software features a hybrid parallelization scheme for multi-CPU clusters and computer with high-end graphic processing units (GPUs). We successfully apply the new refinement method to the structure of the potassium channel MloK1. The calculated 3D reconstruction shows more structural details and contains less noise than the map obtained by conventional Fourier-filtering based processing of the same 2D crystal images.     

Implementation and clinical application of a deformation method for fast simulation of biological tissue formed by fibers and fluid

Background

The aim of this paper is to provide a general discussion, algorithm, and actual working programs of the deformation method for fast simulation of biological tissue formed by fibers and fluid. In order to demonstrate the benefit of the clinical applications software, we successfully used our computational program to deform a 3D breast image acquired from patients, using a 3D scanner, in a real hospital environment.

Results

The method implements a quasi-static solution for elastic global deformations of objects. Each pair of vertices of the surface is connected and defines an elastic fiber. The set of all the elastic fibers defines a mesh of smaller size than the volumetric meshes, allowing for simulation of complex objects with less computational effort. The behavior similar to the stress tensor is obtained by the volume conservation equation that mixes the 3D coordinates. Step by step, we show the computational implementation of this approach.

Conclusions

As an example, a 2D rectangle formed by only 4 vertices is solved and, for this simple geometry, all intermediate results are shown. On the other hand, actual implementations of these ideas in the form of working computer routines are provided for general 3D objects, including a clinical application.

     

Rapid maximum likelihood ancestral state reconstruction of continuous characters: A rerooting‐free algorithm

Ancestral state reconstruction is a method used to study the evolutionary trajectories of quantitative characters on phylogenies. Although efficient methods for univariate ancestral state reconstruction under a Brownian motion model have been described for at least 25 years, to date no generalization has been described to allow more complex evolutionary models, such as multivariate trait evolution, non‐Brownian models, missing data, and within‐species variation. Furthermore, even for simple univariate Brownian motion models, most phylogenetic comparative R packages compute ancestral states via inefficient tree rerooting and full tree traversals at each tree node, making ancestral state reconstruction extremely time‐consuming for large phylogenies. Here, a computationally efficient method for fast maximum likelihood ancestral state reconstruction of continuous characters is described. The algorithm has linear complexity relative to the number of species and outperforms the fastest existing R implementations by several orders of magnitude. The described algorithm is capable of performing ancestral state reconstruction on a 1,000,000‐species phylogeny in fewer than 2 s using a standard laptop, whereas the next fastest R implementation would take several days to complete. The method is generalizable to more complex evolutionary models, such as phylogenetic regression, within‐species variation, non‐Brownian evolutionary models, and multivariate trait evolution. Because this method enables fast repeated computations on phylogenies of virtually any size, implementation of the described algorithm can drastically alleviate the computational burden of many otherwise prohibitively time‐consuming tasks requiring reconstruction of ancestral states, such as phylogenetic imputation of missing data, bootstrapping procedures, Expectation‐Maximization algorithms, and Bayesian estimation. The described ancestral state reconstruction algorithm is implemented in the Rphylopars functions anc.recon and phylopars.     

基于小波变换的医学图像编码方法

高分辨率的医学图像具有很大的信息量,影响了整个数字化的远程医疗系统的实时性,因此必须在保证不丢失关键诊断信息的前提下,对医学图像进行必要的压缩。本文提出了在给定小波基下,基于二维小波分解和重构的快速压缩方法。该方法使用了向量量化技术并采用LBG算法设计码本。实验结果证明,采用该方法可获得较高的压缩比和符合诊断要求的压缩图像。     

Cone-beam breast computed tomography using ultra-fast image reconstruction with constrained,total-variation minimization for suppression of artifacts

Compressed sensing based iterative reconstruction algorithms for computed tomography such as adaptive steepest descent-projection on convex sets (ASD-POCS) are attractive due to their applicability in incomplete datasets such as sparse-view data and can reduce radiation dose to the patients while preserving image quality. Although IR algorithms reduce image noise compared to analytical Feldkamp-Davis-Kress (FDK) algorithm, they may generate artifacts, particularly along the periphery of the object. One popular solution is to use finer image-grid followed by down-sampling. This approach is computationally intensive but may be compensated by reducing the field of view. Our proposed solution is to replace the algebraic reconstruction technique within the original ASD-POCS by ordered subsets-simultaneous algebraic reconstruction technique (OS-SART) and with initialization using FDK image. We refer to this method as Fast, Iterative, TV-Regularized, Statistical reconstruction Technique (FIRST). In this study, we investigate FIRST for cone-beam dedicated breast CT with large image matrix. The signal-difference to noise ratio (SDNR), the difference of the mean value and the variance of adipose and fibroglandular tissues for both FDK and FIRST reconstructions were determined. With FDK serving as the reference, the root-mean-square error (RMSE), bias, and the full-width at half-maximum (FWHM) of microcalcifications in two orthogonal directions were also computed. Our results suggest that FIRST is competitive to the finer image-grid method with shorter reconstruction time. Images reconstructed using the FIRST do not exhibit artifacts and outperformed FDK in terms of image noise. This suggests the potential of this approach for radiation dose reduction in cone-beam breast CT.     

Reconstruction for 3D PET Based on Total Variation Constrained Direct Fourier Method

This paper presents a total variation (TV) regularized reconstruction algorithm for 3D positron emission tomography (PET). The proposed method first employs the Fourier rebinning algorithm (FORE), rebinning the 3D data into a stack of ordinary 2D data sets as sinogram data. Then, the resulted 2D sinogram are ready to be reconstructed by conventional 2D reconstruction algorithms. Given the locally piece-wise constant nature of PET images, we introduce the total variation (TV) based reconstruction schemes. More specifically, we formulate the 2D PET reconstruction problem as an optimization problem, whose objective function consists of TV norm of the reconstructed image and the data fidelity term measuring the consistency between the reconstructed image and sinogram. To solve the resulting minimization problem, we apply an efficient methods called the Bregman operator splitting algorithm with variable step size (BOSVS). Experiments based on Monte Carlo simulated data and real data are conducted as validations. The experiment results show that the proposed method produces higher accuracy than conventional direct Fourier (DF) (bias in BOSVS is 70% of ones in DF, variance of BOSVS is 80% of ones in DF).     

基于Renyi熵滤波的光声图像重建算法设计与实现

针对光声图像重建过程中存在的原始光声信号信噪比差、重建图像对比度低、分辨率不足等问题,提出了基于Renyi熵的光声图像重建滤波算法.该算法首先根据原始光声信号的Renyi熵分布情况,确定分割阈值,并滤除杂波信号;再利用滤波后的光声数据进行延时叠加光声图像重建.利用该滤波算法分别处理铅笔芯横截面(零维)、头发丝(一维)以及小鼠大脑皮层血管(二维)等不同维度样本的光声信号,实验结果表明:相比Renyi熵处理之前,重建图像对比度平均增强了32.45%,分辨率平均提高了30.78%,信噪比提高了47.66%,均方误差降低了35.01%;相比典型的滤波处理算法(模极大值法和阈值去噪法),本研究中图像的对比度、分辨率和信噪比分别提高了25.94%/10.60%、27.90%/19.48%、35.21%/10.60%,均方误差减小了28.57%/16.66%.因此,选择利用Renyi熵滤波算法处理光声信号,从而使光声图像重建质量得到大幅改善.     

Fast rotational matching of single-particle images

The presence of noise and absence of contrast in electron micrographs lead to a reduced resolution of the final 3D reconstruction, due to the inherent limitations of single-particle image alignment. The fast rotational matching (FRM) algorithm was introduced recently for an accurate alignment of 2D images under such challenging conditions. Here, we implemented this algorithm for the first time in a standard 3D reconstruction package used in electron microscopy. This allowed us to carry out exhaustive tests of the robustness and reliability in iterative orientation determination, classification, and 3D reconstruction on simulated and experimental image data. A classification test on GroEL chaperonin images demonstrates that FRM assigns up to 13% more images to their correct reference orientation, compared to the classical self-correlation function method. Moreover, at sub-nanometer resolution, GroEL and rice dwarf virus reconstructions exhibit a remarkable resolution gain of 10-20% that is attributed to the novel image alignment kernel.