Search

Fatigue resistance is crucial for the engineering application of metals. Polycrystalline metals with highly oriented nanotwins have been shown to exhibit a history-independent, stable, and symmetric cyclic response [Pan et al., 2017, Nature 551, pp. 214-217]. However, a constitutive model that incorporates the cyclic deformation mechanism of highly oriented nanotwinned metals is currently lacking. This study aims to develop a physically based model to describe the plastic deformation of highly oriented nanotwinned metals under cyclic loading parallel to the twin boundaries. The theoretical analysis is conducted based on non-uniform distribution of twin boundary spacing measured by experiments. During cyclic plasticity, each twin lamella is discretely regarded as a perfect elastoplastic element with a yielding strength depending on its thickness. The interaction between adjacent nanotwins is not taken into consideration according to the cyclic plasticity mechanism of highly oriented nanotwins. The modeling results are well consistent with the experiments, including the loading-history independence, Masing behavior, and back stress evolution. Moreover, the dissipation energy during cyclic deformation can be evaluated from a thermodynamics perspective, which offers an approach for the prediction of the fatigue life of highly oriented nanotwins. The cyclic plasticity modeling and fatigue life prediction are unified without additional fatigue damage parameters. Overall, our work lays down a physics-informed framework that is critical for the precise prediction of the unique cyclic behaviors of highly oriented nanotwins. [ABSTRACT FROM AUTHOR]

The article presents a study which showed that the astrocytic calcium-deficient mice, inositol 1,4,5-trisphosphate-type-2 receptor knockout mice (Itpr2-/- mice), display abnormal resting-state functional magnetic resonance imaging (rsfMRI) functional connectivity (rsFC) in depression-related networks. Topics include characteristically consistent rsFC changes in major depressive disorder (MDD) patients and Itpr2-/- mice and data acquisition of resting-state fMRI and optogenetic fMRI experiments.

BCKGROUND: Accurate statistical model of the measured projection data is essential for computed tomography (CT) image reconstruction. The transmission data can be described by a compound Poisson distribution upon an electronic noise background. However, such a statistical distribution is numerically intractable for image reconstruction. OBJECTIVE: Although the sinogram data is easily manipulated, it lacks a statistical description for image reconstruction. To address this problem, we present an alpha-divergence constrained total generalized variation (AD-TGV) method for sparse-view X-ray CT image reconstruction. METHODS: The AD-TGV method is formulated as an optimization problem, which balances the alpha-divergence (AD) fidelity and total generalized variation (TGV) regularization in one framework. The alpha-divergence is used to measure the discrepancy between the measured and estimated projection data. The TGV regularization can effectively eliminate the staircase and patchy artifacts which is often observed in total variation (TV) regularization. A modified proximal forwardbackward splitting algorithm was proposed to minimize the associated objective function. RESULTS: Qualitative and quantitative evaluations were carried out on both phantom and patient data. Compared with the original TV-based method, the evaluations clearly demonstrate that the AD-TGV method achieves higher accuracy and lower noise, while preserving structural details. CONCLUSIONS: The experimental results show that the presented AD-TGV method can achieve more gains over the AD-TV method in preserving structural details and suppressing image noise and undesired patchy artifacts. The authors can draw the conclusion that the presented AD-TGV method is potential for radiation dose reduction by lowering the milliampere-seconds (mAs) and/or reducing the number of projection views. [ABSTRACT FROM AUTHOR]

BACKGROUND: Dynamic positron emission tomography (PET) is a powerful tool that provides useful quantitative information on physiological and biochemical processes. However, the low signal-to-noise ratio (SNR) in short dynamic frames is a challenge. OBJECTIVE: To get high SNR in the dynamic PET and to achieve high-quality PET parametric image are the objective of this study. METHODS: Low-rank (LR) modeling and edge-preserving prior are incorporated in this study with a unified mathematical framework to improve the SNR of a dynamic PET image series. The proposed algorithm is designed to reduce noise in homogeneous areas while preserving the edges of regions of interest. RESULTS: The performance of the proposed method (LRH) is compared both visually and quantitatively by using the classic Gaussian filter and an LR expression filter on a digital brain phantom and in vivo rat study. Experimental results demonstrate that the proposed filter can achieve superior visual and quantitative performance without sacrificing spatial resolution. CONCLUSIONS: The proposed LRH is considerably effective and exhibits great potential in processing dynamic PET data with high noise levels. [ABSTRACT FROM AUTHOR]

BACKGROUND: The traditional Bayesian priors for maximum a posteriori (MAP) reconstruction methods usually incorporate local neighborhood interactions that penalize large deviations in parameter estimates for adjacent pixels; therefore, only local pixel differences are utilized. This limits their abilities of penalizing the image roughness. OBJECTIVE: To achieve high-quality PET image reconstruction, this study investigates a MAP reconstruction strategy by incorporating a nonlocal means induced (NLMi) prior (NLMi-MAP) which enables utilizing global similarity information of image. METHODS: The present NLMi prior approximates the derivative of Gibbs energy function by an NLM filtering process. Specially, the NLMi prior is obtained by subtracting the current image estimation from its NLM filtered version and feeding the residual error back to the reconstruction filter to yield the new image estimation. RESULTS:We tested the present NLMi-MAP method with simulated and real PET datasets. Comparison studies with conventional filtered backprojection (FBP) and a few iterative reconstruction methods clearly demonstrate that the present NLMi-MAP method performs better in lowering noise, preserving image edge and in higher signal to noise ratio (SNR). CONCLUSIONS: Extensive experimental results show that the NLMi-MAP method outperforms the existing methods in terms of cross profile, noise reduction, SNR, root mean square error (RMSE) and correlation coefficient (CORR). [ABSTRACT FROM AUTHOR]

Myocardial perfusion computed tomography (MPCT) imaging is commonly used to detect myocardial ischemia quantitatively. A limitation in MPCT is that an additional radiation dose is required compared to unenhanced CT due to its repeated dynamic data acquisition. Meanwhile, noise and streak artifacts in low-dose cases are the main factors that degrade the accuracy of quantifying myocardial ischemia and hamper the diagnostic utility of the filtered backprojection reconstructed MPCT images. Moreover, it is noted that the MPCT images are composed of a series of 2/3D images, which can be naturally regarded as a 3/4-order tensor, and the MPCT images are globally correlated along time and are sparse across space. To obtain higher fidelity ischemia from low-dose MPCT acquisitions quantitatively, we propose a robust statistical iterative MPCT image reconstruction algorithm by incorporating tensor total generalized variation (TTGV) regularization into a penalized weighted least-squares framework. Specifically, the TTGV regularization fuses the spatial correlation of the myocardial structure and the temporal continuation of the contrast agent intake during the perfusion. Then, an efficient iterative strategy is developed for the objective function optimization. Comprehensive evaluations have been conducted on a digital XCAT phantom and a preclinical porcine dataset regarding the accuracy of the reconstructed MPCT images, the quantitative differentiation of ischemia and the algorithm's robustness and efficiency. [ABSTRACT FROM AUTHOR]

Lung 4D computed tomography (4D-CT), which is a time-resolved CT data acquisition, performs an important role in explicitly including respiratory motion in treatment planning and delivery. However, the radiation dose is usually reduced at the expense of inter-slice spatial resolution to minimize radiation-related health risk. Therefore, resolution enhancement along the superior–inferior direction is necessary. In this paper, a super-resolution (SR) reconstruction method based on a patch low-rank matrix reconstruction is proposed to improve the resolution of lung 4D-CT images. Specifically, a low-rank matrix related to every patch is constructed by using a patch searching strategy. Thereafter, the singular value shrinkage is employed to recover the high-resolution patch under the constraints of the image degradation model. The output high-resolution patches are finally assembled to output the entire image. This method is extensively evaluated using two public data sets. Quantitative analysis shows that the proposed algorithm decreases the root mean square error by 9.7%–33.4% and the edge width by 11.4%–24.3%, relative to linear interpolation, back projection (BP) and Zhang et al’s algorithm. A new algorithm has been developed to improve the resolution of 4D-CT. In all experiments, the proposed method outperforms various interpolation methods, as well as BP and Zhang et al’s method, thus indicating the effectivity and competitiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Reducing radiation dose in dual energy computed tomography (DECT) is highly desirable but it may lead to excessive noise in the filtered backprojection (FBP) reconstructed DECT images, which can inevitably increase the diagnostic uncertainty. To obtain clinically acceptable DECT images from low-mAs acquisitions, in this work we develop a novel scheme based on measurement of DECT data. In this scheme, inspired by the success of edge-preserving non-local means (NLM) filtering in CT imaging and the intrinsic characteristics underlying DECT images, i.e. global correlation and non-local similarity, an averaged image induced NLM-based (aviNLM) regularization is incorporated into the penalized weighted least-squares (PWLS) framework. Specifically, the presented NLM-based regularization is designed by averaging the acquired DECT images, which takes the image similarity within the two energies into consideration. In addition, the weighted least-squares term takes into account DECT data-dependent variance. For simplicity, the presented scheme was termed as ‘PWLS-aviNLM’. The performance of the presented PWLS-aviNLM algorithm was validated and evaluated on digital phantom, physical phantom and patient data. The extensive experiments validated that the presented PWLS-aviNLM algorithm outperforms the FBP, PWLS-TV and PWLS-NLM algorithms quantitatively. More importantly, it delivers the best qualitative results with the finest details and the fewest noise-induced artifacts, due to the aviNLM regularization learned from DECT images. This study demonstrated the feasibility and efficacy of the presented PWLS-aviNLM algorithm to improve the DECT reconstruction and resulting material decomposition. [ABSTRACT FROM AUTHOR]

Four dimensional cone-beam computed tomography (4D-CBCT) has great potential clinical value because of its ability to describe tumor and organ motion. But the challenge in 4D-CBCT reconstruction is the limited number of projections at each phase, which result in a reconstruction full of noise and streak artifacts with the conventional analytical algorithms. To address this problem, in this paper, we propose a motion compensated total variation regularization approach which tries to fully explore the temporal coherence of the spatial structures among the 4D-CBCT phases. In this work, we additionally conduct motion estimation/motion compensation (ME/MC) on the 4D-CBCT volume by using inter-phase deformation vector fields (DVFs). The motion compensated 4D-CBCT volume is then viewed as a pseudo-static sequence, of which the regularization function was imposed on. The regularization used in this work is the 3D spatial total variation minimization combined with 1D temporal total variation minimization. We subsequently construct a cost function for a reconstruction pass, and minimize this cost function using a variable splitting algorithm. Simulation and real patient data were used to evaluate the proposed algorithm. Results show that the introduction of additional temporal correlation along the phase direction can improve the 4D-CBCT image quality. [ABSTRACT FROM AUTHOR]

Dynamic myocardial perfusion computed tomography (MPCT) is a promising technique for quick diagnosis and risk stratification of coronary artery disease. However, one major drawback of dynamic MPCT imaging is the heavy radiation dose to patients due to its dynamic image acquisition protocol. In this work, to address this issue, we present a robust dynamic MPCT deconvolution algorithm via adaptive-weighted tensor total variation (AwTTV) regularization for accurate residue function estimation with low-mA s data acquisitions. For simplicity, the presented method is termed ‘MPD-AwTTV’. More specifically, the gains of the AwTTV regularization over the original tensor total variation regularization are from the anisotropic edge property of the sequential MPCT images. To minimize the associative objective function we propose an efficient iterative optimization strategy with fast convergence rate in the framework of an iterative shrinkage/thresholding algorithm. We validate and evaluate the presented algorithm using both digital XCAT phantom and preclinical porcine data. The preliminary experimental results have demonstrated that the presented MPD-AwTTV deconvolution algorithm can achieve remarkable gains in noise-induced artifact suppression, edge detail preservation, and accurate flow-scaled residue function and MPHM estimation as compared with the other existing deconvolution algorithms in digital phantom studies, and similar gains can be obtained in the porcine data experiment. [ABSTRACT FROM AUTHOR]

Image enhancement of lung four-dimensional computed tomography (4D-CT) data is highly important because image resolution remains a crucial point in lung cancer radiotherapy. In this paper, we proposed a method for lung 4D-CT super resolution (SR) by using an adaptive-patch-based projection onto convex sets (POCS) approach, which is in contrast with the global POCS SR algorithm, to recover fine details with lesser artifacts in images. The main contribution of this patch-based approach is that the interfering local structure from other phases can be rejected by employing a similar patch adaptive selection strategy. The effectiveness of our approach is demonstrated through experiments on simulated images and real lung 4D-CT datasets. A comparison with previously published SR reconstruction methods highlights the favorable characteristics of the proposed method. [ABSTRACT FROM AUTHOR]

Image reconstruction from undersampled k-space data accelerates magnetic resonance imaging (MRI) by exploiting image sparseness in certain transform domains. Employing image patch representation over a learned dictionary has the advantage of being adaptive to local image structures and thus can better sparsify images than using fixed transforms (e.g. wavelets and total variations). Dictionary learning methods have recently been introduced to MRI reconstruction, and these methods demonstrate significantly reduced reconstruction errors compared to sparse MRI reconstruction using fixed transforms. However, the synthesis sparse coding problem in dictionary learning is NP-hard and computationally expensive. In this paper, we present a novel sparsity-promoting orthogonal dictionary updating method for efficient image reconstruction from highly undersampled MRI data. The orthogonality imposed on the learned dictionary enables the minimization problem in the reconstruction to be solved by an efficient optimization algorithm which alternately updates representation coefficients, orthogonal dictionary, and missing k-space data. Moreover, both sparsity level and sparse representation contribution using updated dictionaries gradually increase during iterations to recover more details, assuming the progressively improved quality of the dictionary. Simulation and real data experimental results both demonstrate that the proposed method is approximately 10 to 100 times faster than the K-SVD-based dictionary learning MRI method and simultaneously improves reconstruction accuracy. [ABSTRACT FROM AUTHOR]

We proposed a maximum a posterior (MAP) framework for incorporating information from co-registered anatomical images into PET image reconstruction through a novel anato-functional joint prior. The characteristic of the utilized hyperbolic potential function is determinate by the voxel intensity differences within the anatomical image, while the penalization is computed based on voxel intensity differences in reconstructed PET images. Using realistic simulated 18FDG PET scan data, we optimized the performance of the proposed MAP reconstruction with the joint prior (JP-MAP) and compared its performance with conventional 3D MLEM and 3D MAP reconstructions. The proposed JP-MAP reconstruction algorithm resulted in quantitatively enhanced reconstructed images, as demonstrated in extensive FDG PET simulation study. The proposed method was also tested on a 20 min Florbetapir patient study performed on the high-resolution research tomograph. It was shown to outperform conventional methods in visual as well as quantitative accuracy assessment (in terms of regional noise versus activity value performance). The JP-MAP method was also compared with another MR-guided MAP reconstruction method, utilizing the Bowsher prior and was seen to result in some quantitative enhancements, especially in the case of MR-PET mis-registrations, and a definitive improvement in computational performance. [ABSTRACT FROM AUTHOR]