scholarly journals An Optimization-Based Meta-Learning Model for MRI Reconstruction with Diverse Dataset

2021 ◽  
Vol 7 (11) ◽  
pp. 231
Author(s):  
Wanyu Bian ◽  
Yunmei Chen ◽  
Xiaojing Ye ◽  
Qingchao Zhang
Keyword(s):  
Bilevel Optimization ◽  
Variational Model ◽  
Data Sets ◽  
Reconstruction Method ◽  
Learning Framework ◽  
Network Parameters ◽  
Meta Learning ◽  
Invariant Part ◽  
Mri Reconstruction ◽  
Magnetic Resonance Imaging Mri

This work aims at developing a generalizable Magnetic Resonance Imaging (MRI) reconstruction method in the meta-learning framework. Specifically, we develop a deep reconstruction network induced by a learnable optimization algorithm (LOA) to solve the nonconvex nonsmooth variational model of MRI image reconstruction. In this model, the nonconvex nonsmooth regularization term is parameterized as a structured deep network where the network parameters can be learned from data. We partition these network parameters into two parts: a task-invariant part for the common feature encoder component of the regularization, and a task-specific part to account for the variations in the heterogeneous training and testing data. We train the regularization parameters in a bilevel optimization framework which significantly improves the robustness of the training process and the generalization ability of the network. We conduct a series of numerical experiments using heterogeneous MRI data sets with various undersampling patterns, ratios, and acquisition settings. The experimental results show that our network yields greatly improved reconstruction quality over existing methods and can generalize well to new reconstruction problems whose undersampling patterns/trajectories are not present during training.

scholarly journals An Optimization-Based Meta-Learning Model for MRI Reconstruction with Diverse Dataset

2021 ◽  
Author(s):  
Wanyu Bian ◽  
Yunmei Chen ◽  
Xiaojing Ye ◽  
Qingchao Zhang
Keyword(s):  
Network Architecture ◽  
Bilevel Optimization ◽  
Training Data ◽  
Training Dataset ◽  
Variational Model ◽  
Validation Dataset ◽  
Training Time ◽  
Learning Framework ◽  
Meta Learning ◽  
Mri Reconstruction

(1) Purpose: This work aims at developing a generalizable MRI reconstruction model in the meta-learning framework. The standard benchmarks in meta-learning are challenged by learning on diverse task distributions. The proposed network learns the regularization function in a variational model and reconstructs MR images with various under-sampling ratios or patterns that may or may not be seen in the training data by leveraging a heterogeneous dataset. (2) Methods: We propose an unrolling network induced by learnable optimization algorithms (LOA) for solving our nonconvex nonsmooth variational model for MRI reconstruction. In this model, the learnable regularization function contains a task-invariant common feature encoder and task-specific learner represented by a shallow network. To train the network we split the training data into two parts: training and validation, and introduce a bilevel optimization algorithm. The lower-level optimization trains task-invariant parameters for the feature encoder with fixed parameters of the task-specific learner on the training dataset, and the upper-level optimizes the parameters of the task-specific learner on the validation dataset. (3) Results: The PSNR increases 1.5 dB on average compared to the network trained through conventional supervised learning on the seen CS ratios. We test the result of quick adaption on the unseen tasks after meta-training, the average PSNR arises 1.22 dB compared to the conventional learning procedure that is directly trained on the unseen CS ratios in the meanwhile saving half of the training time. The average PSNR arises 1.87 dB for unseen sampling patterns comparing to conventional learning; (4) Conclusion: We proposed a meta-learning framework consisting of the base network architecture, design of regularization, and bi-level optimization-based training. The network inherits the convergence property of the LOA and interpretation of the variational model. The generalization ability is improved by the designated regularization and bilevel optimization-based training algorithm.

Cost-sensitive meta-learning framework

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Samar Ali Shilbayeh ◽  
Sunil Vadera
Keyword(s):  
Machine Learning ◽  
Learning System ◽  
Classification Algorithms ◽  
Data Sets ◽  
Classification Methods ◽  
Content Type ◽  
Learning Framework ◽  
Cost Sensitive Classification ◽  
Meta Learning ◽  
Training Examples

Purpose This paper aims to describe the use of a meta-learning framework for recommending cost-sensitive classification methods with the aim of answering an important question that arises in machine learning, namely, “Among all the available classification algorithms, and in considering a specific type of data and cost, which is the best algorithm for my problem?” Design/methodology/approach This paper describes the use of a meta-learning framework for recommending cost-sensitive classification methods for the aim of answering an important question that arises in machine learning, namely, “Among all the available classification algorithms, and in considering a specific type of data and cost, which is the best algorithm for my problem?” The framework is based on the idea of applying machine learning techniques to discover knowledge about the performance of different machine learning algorithms. It includes components that repeatedly apply different classification methods on data sets and measures their performance. The characteristics of the data sets, combined with the algorithms and the performance provide the training examples. A decision tree algorithm is applied to the training examples to induce the knowledge, which can then be used to recommend algorithms for new data sets. The paper makes a contribution to both meta-learning and cost-sensitive machine learning approaches. Those both fields are not new, however, building a recommender that recommends the optimal case-sensitive approach for a given data problem is the contribution. The proposed solution is implemented in WEKA and evaluated by applying it on different data sets and comparing the results with existing studies available in the literature. The results show that a developed meta-learning solution produces better results than METAL, a well-known meta-learning system. The developed solution takes the misclassification cost into consideration during the learning process, which is not available in the compared project. Findings The proposed solution is implemented in WEKA and evaluated by applying it to different data sets and comparing the results with existing studies available in the literature. The results show that a developed meta-learning solution produces better results than METAL, a well-known meta-learning system. Originality/value The paper presents a major piece of new information in writing for the first time. Meta-learning work has been done before but this paper presents a new meta-learning framework that is costs sensitive.

scholarly journals Improving Non-Cartesian MRI Reconstruction through Discontinuity Subtraction

2006 ◽  
Vol 2006 ◽  
pp. 1-9 ◽  
Author(s):  
Jiayu Song ◽  
Qing Huo Liu
Keyword(s):  
Reconstruction Method ◽  
Reconstruction Methods ◽  
Spread Function ◽  
Data Fidelity ◽  
Mri Reconstruction ◽  
Magnetic Resonance Imaging Mri ◽  
Space Data ◽  
2D And 3D ◽  
Undersampled Data

Non-Cartesian sampling is widely used for fast magnetic resonance imaging (MRI). Accurate and fast image reconstruction from non-Cartesiank-space data becomes a challenge and gains a lot of attention. Images provided by conventional direct reconstruction methods usually bear ringing, streaking, and other leakage artifacts caused by discontinuous structures. In this paper, we tackle these problems by analyzing the principal point spread function (PSF) of non-Cartesian reconstruction and propose a leakage reduction reconstruction scheme based on discontinuity subtraction. Data fidelity ink-space is enforced during each iteration. Multidimensional nonuniform fast Fourier transform (NUFFT) algorithms are utilized to simulate thek-space samples as well as to reconstruct images. The proposed method is compared to the direct reconstruction method on computer-simulated phantoms and physical scans. Non-Cartesian sampling trajectories including 2D spiral, 2D and 3D radial trajectories are studied. The proposed method is found useful on reducing artifacts due to high image discontinuities. It also improves the quality of images reconstructed from undersampled data.

Systematic Analysis and Review of Magnetic Resonance Imaging (MRI) Reconstruction Techniques

2021 ◽  
Vol 16 ◽  
Author(s):  
Penta Anil Kumar ◽  
R. Gunasundari ◽  
R. Aarthi
Keyword(s):  
Magnetic Resonance Imaging ◽  
Magnetic Resonance ◽  
Optimization Technique ◽  
Motion Artifacts ◽  
Reconstruction Technique ◽  
Resonance Imaging ◽  
Research Gaps ◽  
Conventional Mri ◽  
Mri Reconstruction ◽  
Magnetic Resonance Imaging Mri

Background: Magnetic Resonance Imaging (MRI) plays an important role in the field of medical diagnostic imaging as it poses non-invasive acquisition and high soft-tissue contrast. However, the huge time is needed for the MRI scanning process that results in motion artifacts, degrades image quality, misinterpretation of data, and may cause uncomfortable to the patient. Thus, the main goal of MRI research is to accelerate data acquisition processing without affecting the quality of the image. Introduction: This paper presents a survey based on distinct conventional MRI reconstruction methodologies. In addition, a novel MRI reconstruction strategy is proposed based on weighted Compressive Sensing (CS), Penalty-aided minimization function, and Meta-heuristic optimization technique. Methods: An illustrative analysis is done concerning adapted methods, datasets used, execution tools, performance measures, and values of evaluation metrics. Moreover, the issues of existing methods and the research gaps considering conventional MRI reconstruction schemes are elaborated to obtain improved contribution for devising significant MRI reconstruction techniques. Results: The proposed method will reduce conventional aliasing artifacts problems, may attain lower Mean Square Error (MSE), higher Peak Signal-to-Noise Ratio (PSNR), and Structural SIMilarity (SSIM) index. Conclusion: The issues of existing methods and the research gaps considering conventional MRI reconstruction schemes are elaborated to devising an improved significant MRI reconstruction technique.

An Algorithm Combining Analysis-based Blind Compressed Sensing and Nonlocal Low-rank Constraints for MRI Reconstruction

2019 ◽  
Vol 15 (3) ◽  
pp. 281-291 ◽  
Author(s):  
Mei Sun ◽  
Jinxu Tao ◽  
Zhongfu Ye ◽  
Bensheng Qiu ◽  
Jinzhang Xu ◽  
...  
Keyword(s):  
Compressed Sensing ◽  
Signal Reconstruction ◽  
Low Rank ◽  
Mr Images ◽  
Scanning Time ◽  
Previous State ◽  
Rank Approximation ◽  
Mri Reconstruction ◽  
Magnetic Resonance Imaging Mri ◽  
Rank Constraints

Background: In order to overcome the limitation of long scanning time, compressive sensing (CS) technology exploits the sparsity of image in some transform domain to reduce the amount of acquired data. Therefore, CS has been widely used in magnetic resonance imaging (MRI) reconstruction. </P><P> Discussion: Blind compressed sensing enables to recover the image successfully from highly under- sampled measurements, because of the data-driven adaption of the unknown transform basis priori. Moreover, analysis-based blind compressed sensing often leads to more efficient signal reconstruction with less time than synthesis-based blind compressed sensing. Recently, some experiments have shown that nonlocal low-rank property has the ability to preserve the details of the image for MRI reconstruction. Methods: Here, we focus on analysis-based blind compressed sensing, and combine it with additional nonlocal low-rank constraint to achieve better MR images from fewer measurements. Instead of nuclear norm, we exploit non-convex Schatten p-functionals for the rank approximation. </P><P> Results & Conclusion: Simulation results indicate that the proposed approach performs better than the previous state-of-the-art algorithms.

MULFE: Multi-Label Learning via Label-Specific Feature Space Ensemble

2021 ◽  
Vol 16 (1) ◽  
pp. 1-24
Author(s):  
Yaojin Lin ◽  
Qinghua Hu ◽  
Jinghua Liu ◽  
Xingquan Zhu ◽  
Xindong Wu
Keyword(s):  
Empirical Studies ◽  
Feature Space ◽  
Training Data ◽  
Data Sets ◽  
Learning Framework ◽  
Feature Spaces ◽  
Public Data ◽  
Margin Distribution ◽  
Label Correlations ◽  
Label Correlation

In multi-label learning, label correlations commonly exist in the data. Such correlation not only provides useful information, but also imposes significant challenges for multi-label learning. Recently, label-specific feature embedding has been proposed to explore label-specific features from the training data, and uses feature highly customized to the multi-label set for learning. While such feature embedding methods have demonstrated good performance, the creation of the feature embedding space is only based on a single label, without considering label correlations in the data. In this article, we propose to combine multiple label-specific feature spaces, using label correlation, for multi-label learning. The proposed algorithm, mu lti- l abel-specific f eature space e nsemble (MULFE), takes consideration label-specific features, label correlation, and weighted ensemble principle to form a learning framework. By conducting clustering analysis on each label’s negative and positive instances, MULFE first creates features customized to each label. After that, MULFE utilizes the label correlation to optimize the margin distribution of the base classifiers which are induced by the related label-specific feature spaces. By combining multiple label-specific features, label correlation based weighting, and ensemble learning, MULFE achieves maximum margin multi-label classification goal through the underlying optimization framework. Empirical studies on 10 public data sets manifest the effectiveness of MULFE.

Multi-polarization Fusion Few-shot HRRP Target Recognition Based on Meta-learning Framework

2021 ◽  
pp. 1-1
Author(s):  
Qi Liu ◽  
Xinyu Zhang ◽  
Yongxiang Liu ◽  
Kai Huo ◽  
Weidong Jiang ◽  
...  
Keyword(s):  
Target Recognition ◽  
Learning Framework ◽  
Meta Learning

scholarly journals Validating a Local Arterial Input Function Method for Improved Perfusion Quantification in Stroke

2011 ◽  
Vol 31 (11) ◽  
pp. 2189-2198 ◽  
Author(s):  
Lisa Willats ◽  
Soren Christensen ◽  
Henry K Ma ◽  
Geoffrey A Donnan ◽  
Alan Connelly ◽  
...  
Keyword(s):  
Time Course ◽  
Arterial Input Function ◽  
Input Function ◽  
Perfusion Magnetic Resonance Imaging ◽  
Data Sets ◽  
Bolus Tracking ◽  
Perfusion Quantification ◽  
Magnetic Resonance Imaging Mri ◽  
Arterial Input Functions ◽  
Contrast Bolus

In bolus-tracking perfusion magnetic resonance imaging (MRI), temporal dispersion of the contrast bolus due to stenosis or collateral supply presents a significant problem for accurate perfusion quantification in stroke. One means to reduce the associated perfusion errors is to deconvolve the bolus concentration time-course data with local Arterial Input Functions (AIFs) measured close to the capillary bed and downstream of the arterial abnormalities causing dispersion. Because the MRI voxel resolution precludes direct local AIF measurements, they must be extrapolated from the surrounding data. To date, there have been no published studies directly validating these local AIFs. We assess the effectiveness of local AIFs in reducing dispersion-induced perfusion error by measuring the residual dispersion remaining in the local AIF deconvolved perfusion maps. Two approaches to locating the local AIF voxels are assessed and compared with a global AIF deconvolution across 19 bolus-tracking data sets from patients with stroke. The local AIF methods reduced dispersion in the majority of data sets, suggesting more accurate perfusion quantification. Importantly, the validation inherently identifies potential areas for perfusion underestimation. This is valuable information for the identification of at-risk tissue and management of stroke patients.

An Applicative Survey on Few-Shot Learning

2021 ◽  
Vol 15 ◽  
Author(s):  
Jianwei Zhang ◽  
Xubin Zhang ◽  
Lei Lv ◽  
Yining Di ◽  
Wei Chen
Keyword(s):  
Large Scale ◽  
Representation Learning ◽  
Language Models ◽  
Data Sets ◽  
Research Directions ◽  
Large Scale Data ◽  
Cross Domain ◽  
Meta Learning ◽  
Definition Of ◽  
Future Work

Background: Learning discriminative representation from large-scale data sets has made a breakthrough in decades. However, it is still a thorny problem to generate representative embedding from limited examples, for example, a class containing only one image. Recently, deep learning-based Few-Shot Learning (FSL) has been proposed. It tackles this problem by leveraging prior knowledge in various ways. Objective: In this work, we review recent advances of FSL from the perspective of high-dimensional representation learning. The results of the analysis can provide insights and directions for future work. Methods: We first present the definition of general FSL. Then we propose a general framework for the FSL problem and give the taxonomy under the framework. We survey two FSL directions: learning policy and meta-learning. Results: We review the advanced applications of FSL, including image classification, object detection, image segmentation and other tasks etc., as well as the corresponding benchmarks to provide an overview of recent progress. Conclusion: FSL needs to be further studied in medical images, language models, and reinforcement learning in future work. In addition, cross-domain FSL, successive FSL, and associated FSL are more challenging and valuable research directions.

Sign in / Sign up

Export Citation Format

Share Document