Learning to Sample MRI via Variational Information Maximization
Accelerating MRI scans requires optimal sampling of k-space data. This is however a daunting task due to the discrete and non-convex nature of sampling optimization. To cope with this challenge, we put forth a novel deep learning framework that leverages uncertainty autoencoders to enable joint optimization of sampling pattern and reconstruction of MRI scans. We represent the encoder as a non-uniform Fast Fourier Transform that allows {\it continuous} optimization of k-space samples on a non-Cartesian plane, while the decoder is a deep reconstruction network. Our approach is universal in a sense that it can be used with any reconstruction network. Experiments with knee MRI shows improved reconstruction quality of our data-driven sampling over the prevailing variable-density sampling.
Code (0)
등록된 구현이 없습니다.
Tasks
DecoderSimilar Papers 제목 키워드 기반
Variational Curriculum Reinforcement Learning for Unsupervised Discovery of Skills
Mutual information-based reinforcement learning (RL) has been proposed as a promising framework for retrieving complex skills autonomously without a task-oriented reward function through mutual information (MI) maximizat…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Robot NavigationVariational Information Bottleneck on Vector Quantized Autoencoders
In this paper, we provide an information-theoretic interpretation of the Vector Quantized-Variational Autoencoder (VQ-VAE). We show that the loss function of the original VQ-VAE can be derived from the variational determ…
VMI-VAE: Variational Mutual Information Maximization Framework for VAE With Discrete and Continuous Priors
Variational Autoencoder is a scalable method for learning latent variable models of complex data. It employs a clear objective that can be easily optimized. However, it does not explicitly measure the quality of learned …
Auto-Encoding Total Correlation Explanation
Advances in unsupervised learning enable reconstruction and generation of samples from complex distributions, but this success is marred by the inscrutability of the representations learned. We propose an information-the…
DisentanglementRepresentation LearningAPS: Active Pretraining with Successor Features
We introduce a new unsupervised pretraining objective for reinforcement learning. During the unsupervised reward-free pretraining phase, the agent maximizes mutual information between tasks and states induced by the poli…
Unsupervised Reinforcement Learning