Blind Primed Supervised (BLIPS) Learning for MR Image Reconstruction.
Ontology highlight
ABSTRACT:
SUBMITTER: Lahiri A
PROVIDER: S-EPMC8672324 | biostudies-literature | 2021 Nov
REPOSITORIES: biostudies-literature
Publications
Blind Primed Supervised (BLIPS) Learning for MR Image Reconstruction.
Lahiri Anish A Wang Guanhua G Ravishankar Saiprasad S Fessler Jeffrey A JA
IEEE transactions on medical imaging 20211027 11
This paper examines a combined supervised-unsupervised framework involving dictionary-based blind learning and deep supervised learning for MR image reconstruction from under-sampled k-space data. A major focus of the work is to investigate the possible synergy of learned features in traditional shallow reconstruction using adaptive sparsity-based priors and deep prior-based reconstruction. Specifically, we propose a framework that uses an unrolled network to refine a blind dictionary learning-b ...[more]
Similar Datasets
Project description:In recent years, there has been attention on leveraging the statistical modeling capabilities of neural networks for reconstructing sub-sampled Magnetic Resonance Imaging (MRI) data. Most proposed methods assume the existence of a representative fully-sampled dataset and use fully-supervised training. However, for many applications, fully sampled training data is not available, and may be highly impractical to acquire. The development and understanding of self-supervised methods, which use only sub-sampled data for training, are therefore highly desirable. This work extends the Noisier2Noise framework, which was originally constructed for self-supervised denoising tasks, to variable density sub-sampled MRI data. We use the Noisier2Noise framework to analytically explain the performance of Self-Supervised Learning via Data Undersampling (SSDU), a recently proposed method that performs well in practice but until now lacked theoretical justification. Further, we propose two modifications of SSDU that arise as a consequence of the theoretical developments. Firstly, we propose partitioning the sampling set so that the subsets have the same type of distribution as the original sampling mask. Secondly, we propose a loss weighting that compensates for the sampling and partitioning densities. On the fastMRI dataset we show that these changes significantly improve SSDU's image restoration quality and robustness to the partitioning parameters.
| S-EPMC7614963 | biostudies-literature
Project description:Accelerating MRI scans is one of the principal outstanding problems in the MRI research community. Towards this goal, we hosted the second fastMRI competition targeted towards reconstructing MR images with subsampled k-space data. We provided participants with data from 7,299 clinical brain scans (de-identified via a HIPAA-compliant procedure by NYU Langone Health), holding back the fully-sampled data from 894 of these scans for challenge evaluation purposes. In contrast to the 2019 challenge, we focused our radiologist evaluations on pathological assessment in brain images. We also debuted a new Transfer track that required participants to submit models evaluated on MRI scanners from outside the training set. We received 19 submissions from eight different groups. Results showed one team scoring best in both SSIM scores and qualitative radiologist evaluations. We also performed analysis on alternative metrics to mitigate the effects of background noise and collected feedback from the participants to inform future challenges. Lastly, we identify common failure modes across the submissions, highlighting areas of need for future research in the MRI reconstruction community.
| S-EPMC8428775 | biostudies-literature
Project description:Magnetic resonance image (MRI) reconstruction using SENSitivity Encoding (SENSE) requires regularization to suppress noise and aliasing effects. Edge-preserving and sparsity-based regularization criteria can improve image quality, but they demand computation-intensive nonlinear optimization. In this paper, we present novel methods for regularized MRI reconstruction from undersampled sensitivity encoded data--SENSE-reconstruction--using the augmented Lagrangian (AL) framework for solving large-scale constrained optimization problems. We first formulate regularized SENSE-reconstruction as an unconstrained optimization task and then convert it to a set of (equivalent) constrained problems using variable splitting. We then attack these constrained versions in an AL framework using an alternating minimization method, leading to algorithms that can be implemented easily. The proposed methods are applicable to a general class of regularizers that includes popular edge-preserving (e.g., total-variation) and sparsity-promoting (e.g., l(1)-norm of wavelet coefficients) criteria and combinations thereof. Numerical experiments with synthetic and in vivo human data illustrate that the proposed AL algorithms converge faster than both general-purpose optimization algorithms such as nonlinear conjugate gradient (NCG) and state-of-the-art MFISTA.
| S-EPMC3081617 | biostudies-literature
Project description:PurposeNumerous 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.MethodsThe 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.ResultsFor 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.ConclusionFor 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:The self-calibration parallel imaging (SC-SENSE) method reconstructs the image by estimating the coil sensitivity matrix. In order to obtain the sensitivity matrix, it is necessary to take a small amount of automatic calibration signal lines (ACSL) in the center of k-space. This method uses the data of the central region to obtain the sensitivity matrix, and then the reconstructed image is obtained. This paper proposed the triple cycle optimization (TCO) method to continuously optimize reconstructed images. The proposed TCO method takes the sensitivity matrix obtained by ACSL and substituted the reconstructed image as the initial data generation into the loop, and estimates the k-space data repeatedly. A new sensitivity matrix is obtained by using k-space data and the reconstructed image, and a stable triple cycle is obtained. In the cycle, all data are optimized to a certain extent, including the reconstructed image. Experimental results show that under the same sampling density, images reconstructed by using the triple cycle optimization method have lower noise and artifacts than those of the traditional method. When combined with the variable density sampling method, the effect is remarkable with a much low sampling rate.
| S-EPMC9095676 | biostudies-literature
Project description:PurposeTo advance research in the field of machine learning for MR image reconstruction with an open challenge.MethodsWe provided participants with a dataset of raw k-space data from 1,594 consecutive clinical exams of the knee. The goal of the challenge was to reconstruct images from these data. In order to strike a balance between realistic data and a shallow learning curve for those not already familiar with MR image reconstruction, we ran multiple tracks for multi-coil and single-coil data. We performed a two-stage evaluation based on quantitative image metrics followed by evaluation by a panel of radiologists. The challenge ran from June to December of 2019.ResultsWe received a total of 33 challenge submissions. All participants chose to submit results from supervised machine learning approaches.ConclusionsThe challenge led to new developments in machine learning for image reconstruction, provided insight into the current state of the art in the field, and highlighted remaining hurdles for clinical adoption.
| S-EPMC7719611 | biostudies-literature
Project description:ObjectivesTo compare the image quality and diagnostic performance of conventional motion-corrected periodically rotated overlapping parallel line with enhanced reconstruction (PROPELLER) MRI sequences with post-processed PROPELLER MRI sequences using deep learning-based (DL) reconstructions.MethodsIn this prospective study of 30 patients, conventional (19 min 18 s) and accelerated MRI sequences (7 min 16 s) using the PROPELLER technique were acquired. Accelerated sequences were post-processed using DL. The image quality and diagnostic confidence were qualitatively assessed by 2 readers using a 5-point Likert scale. Analysis of the pathological findings of cartilage, rotator cuff tendons and muscles, glenoid labrum and subacromial bursa was performed. Inter-reader agreement was calculated using Cohen's kappa statistic. Quantitative evaluation of image quality was measured using the signal-to-noise ratio (SNR) and contrast-to-noise ratio (CNR).ResultsMean image quality and diagnostic confidence in evaluation of all shoulder structures were higher in DL sequences (p value = 0.01). Inter-reader agreement ranged between kappa values of 0.155 (assessment of the bursa) and 0.947 (assessment of the rotator cuff muscles). In 17 cases, thickening of the subacromial bursa of more than 2 mm was only visible in DL sequences. The pathologies of the other structures could be properly evaluated by conventional and DL sequences. Mean SNR (p value = 0.01) and CNR (p value = 0.02) were significantly higher for DL sequences.ConclusionsThe accelerated PROPELLER sequences with DL post-processing showed superior image quality and higher diagnostic confidence compared to the conventional PROPELLER sequences. Subacromial bursa can be thoroughly assessed in DL sequences, while the other structures of the shoulder joint can be assessed in conventional and DL sequences with a good agreement between sequences.Key points• MRI of the shoulder requires long scan times and can be hampered by motion artifacts. • Deep learning-based convolutional neural networks are used to reduce image noise and scan time while maintaining optimal image quality. The radial k-space acquisition technique (PROPELLER) can reduce the scan time and has potential to reduce motion artifacts. • DL sequences show a higher diagnostic confidence than conventional sequences and therefore are preferred for assessment of the subacromial bursa, while conventional and DL sequences show comparable performance in the evaluation of the shoulder joint.
| S-EPMC9935676 | biostudies-literature
Project description:Two-photon excitation (2PE) laser scanning microscopy is the imaging modality of choice when one desires to work with thick biological samples. However, its spatial resolution is poor, below confocal laser scanning microscopy. Here, we propose a straightforward implementation of 2PE image scanning microscopy (2PE-ISM) that, by leveraging our recently introduced single-photon avalanche diode (SPAD) array detector and a novel blind image reconstruction method, is shown to enhance the effective resolution, as well as the overall image quality of 2PE microscopy. With our adaptive pixel reassignment procedure ?1.6 times resolution increase is maintained deep into thick semi-transparent samples. The integration of Fourier ring correlation based semi-blind deconvolution is shown to further enhance the effective resolution by a factor of ?2 - and automatic background correction is shown to boost the image quality especially in noisy images. Most importantly, our 2PE-ISM implementation requires no calibration measurements or other input from the user, which is an important aspect in terms of day-to-day usability of the technique.
| S-EPMC7316014 | biostudies-literature
Project description:Anatomically-driven image reconstruction algorithms have become very popular in positron emission tomography (PET) where they have demonstrated improved image resolution and quantification. This work, consider the effect of spatial inconsistency between MR and PET images in hot and cold regions of the PET image. We investigate these effects on the kernel method from machine learning, in particular, the hybrid kernelized expectation maximization (HKEM). These were applied to Jaszczak phantom and patient data acquired with the Biograph Siemens mMR. The results show that even a small shift can cause a significant change in activity concentration. In general, the PET-MR inconsistencies can induce the partial volume effect, more specifically the 'spill-in' of the affected cold regions and the 'spill-out' from the hot regions. The maximum change was about 100% for the cold region and 10% for the hot lesion using KEM, against the 37% and 8% obtained with HKEM. The findings of this work suggest that including PET information in the kernel enhances the flexibility of the reconstruction in case of spatial inconsistency. Nevertheless, accurate registration and choice of the appropriate MR image for the creation of the kernel is essential to avoid artifacts, blurring, and bias.
| S-EPMC7596768 | 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