arXiv subjects

Pascal Spincemaille

Publications and source records attributed to Pascal Spincemaille.

23 records · Page 2Linked to original sources

arXiv2020

Extending LOUPE for K-space Under-sampling Pattern Optimization in Multi-coil MRI

The previously established LOUPE (Learning-based Optimization of the Under-sampling Pattern) framework for optimizing the k-space sampling pattern in MRI was extended in three folds: firstly, fully sampled multi-coil k-space data from the scanner, rather than simulated k-space data from magnitude MR images in LOUPE, was retrospectively under-sampled to optimize the under-sampling pattern of in-vivo k-space data; secondly, binary stochastic k-space sampling, rather than approximate stochastic k-space sampling of LOUPE during training, was applied together with a straight-through (ST) estimator to estimate the gradient of the threshold operation in a neural network; thirdly, modified unrolled optimization network, rather than modified U-Net in LOUPE, was used as the reconstruction network in order to reconstruct multi-coil data properly and reduce the dependency on training data. Experimental results show that when dealing with the in-vivo k-space data, unrolled optimization network with binary under-sampling block and ST estimator had better reconstruction performance compared to the ones with either U-Net reconstruction network or approximate sampling pattern optimization network, and once trained, the learned optimal sampling pattern worked better than the hand-crafted variable density sampling pattern when deployed with other conventional reconstruction methods.

eess.IV↗

arXiv2020

Bayesian Learning of Probabilistic Dipole Inversion for Quantitative Susceptibility Mapping

A learning-based posterior distribution estimation method, Probabilistic Dipole Inversion (PDI), is proposed to solve quantitative susceptibility mapping (QSM) inverse problem in MRI with uncertainty estimation. A deep convolutional neural network (CNN) is used to represent the multivariate Gaussian distribution as the approximated posterior distribution of susceptibility given the input measured field. In PDI, such CNN is firstly trained on healthy subjects dataset with labels by maximizing the posterior Gaussian distribution loss function as used in Bayesian deep learning. When tested on new dataset without any label, PDI updates the pre-trained network in an unsupervised fashion by minimizing the KL divergence between the approximated posterior distribution represented by CNN and the true posterior distribution given the likelihood distribution from known physical model and prior distribution. Based on our experiments, PDI provides additional uncertainty estimation compared to the conventional MAP approach, meanwhile addressing the potential discrepancy issue of CNN when test data deviates from training dataset.

eess.IV↗

arXiv2020

RSANet: Recurrent Slice-wise Attention Network for Multiple Sclerosis Lesion Segmentation

Brain lesion volume measured on T2 weighted MRI images is a clinically important disease marker in multiple sclerosis (MS). Manual delineation of MS lesions is a time-consuming and highly operator-dependent task, which is influenced by lesion size, shape and conspicuity. Recently, automated lesion segmentation algorithms based on deep neural networks have been developed with promising results. In this paper, we propose a novel recurrent slice-wise attention network (RSANet), which models 3D MRI images as sequences of slices and captures long-range dependencies through a recurrent manner to utilize contextual information of MS lesions. Experiments on a dataset with 43 patients show that the proposed method outperforms the state-of-the-art approaches. Our implementation is available online at https://github.com/tinymilky/RSANet.

eess.IV↗

arXiv2019

Fidelity Imposed Network Edit (FINE) for Solving Ill-Posed Image Reconstruction

Deep learning (DL) is increasingly used to solve ill-posed inverse problems in imaging, such as reconstruction from noisy or incomplete data, as DL offers advantages over explicit image feature extractions in defining the needed prior. However, DL typically does not incorporate the precise physics of data generation or data fidelity. Instead, DL networks are trained to output some average response to an input. Consequently, DL image reconstruction contains errors, and may perform poorly when the test data deviates significantly from the training data, such as having new pathological features. To address this lack of data fidelity problem in DL image reconstruction, a novel approach, which we call fidelity-imposed network edit (FINE), is proposed. In FINE, a pre-trained prior network's weights are modified according to the physical model, on a test case. Our experiments demonstrate that FINE can achieve superior performance in two important inverse problems in neuroimaging: quantitative susceptibility mapping (QSM) and under-sampled reconstruction in MRI.

eess.IV↗

arXiv1999

Quantum dynamics and Gram's matrix

We propose to analyse the statistical properties of a sequence of vectors using the spectrum of the associated Gram matrix. Such sequences arise e.g. by the repeated action of a deterministic kicked quantum dynamics on an initial condition or by a random process. We argue that, when the number of time-steps, suitably scaled with respect to $\hbar$, increases, the limiting eigenvalue distribution of the Gram matrix reflects the possible quantum chaoticity of the original system as it tends to its classical limit. This idea is subsequently applied to study the long-time properties of sequences of random vectors at the time scale of the dimension of the Hilbert space of available states.

math-ph↗