Circumventing the curse of dimensionality in magnetic resonance fingerprinting through a deep learning approach.

Magnetic resonance fingerprinting (MRF) is a rapidly developing approach for fast quantitative MRI. A typical drawback of dictionary-based MRF is an explosion of the dictionary size as a function of the number of reconstructed parameters, according to the "curse of dimensionality", which determines an explosion of resource requirements. Neural networks (NNs) have been proposed as a feasible alternative, but this approach is still in its infancy. In this work, we design a deep learning approach to MRF using a fully connected network (FCN). In the first part we investigate, by means of simulations, how the NN performance scales with the number of parameters to be retrieved in comparison with the standard dictionary approach. Four MRF sequences were considered: IR-FISP, bSSFP, IR-FISP-B1 , and IR-bSSFP-B1 , the latter two designed to be more specific for B1+ parameter encoding. Estimation accuracy, memory usage, and computational time required to perform the estimation task were considered to compare the scalability capabilities of the dictionary-based and the NN approaches. In the second part we study optimal training procedures by including different data augmentation and preprocessing strategies during training to achieve better accuracy and robustness to noise and undersampling artifacts. The study is conducted using the IR-FISP MRF sequence exploiting both simulations and in vivo acquisitions. Results demonstrate that the NN approach outperforms the dictionary-based approach in terms of scalability capabilities. Results also allow us to heuristically determine the optimal training strategy to make an FCN able to predict T1 , T2 , and M0 maps that are in good agreement with those obtained with the original dictionary approach. k-SVD denoising is proposed and found to be critical as a preprocessing step to handle undersampled data.

A deep learning approach for magnetic resonance fingerprinting: Scaling capabilities and good training practices investigated by simulations.

MR fingerprinting (MRF) is an innovative approach to quantitative MRI. A typical disadvantage of dictionary-based MRF is the explosive growth of the dictionary as a function of the number of reconstructed parameters, an instance of the curse of dimensionality, which determines an explosion of resource requirements. In this work, we describe a deep learning approach for MRF parameter map reconstruction using a fully connected architecture. Employing simulations, we have investigated how the performance of the Neural Networks (NN) approach scales with the number of parameters to be retrieved, compared to the standard dictionary approach. We have also studied optimal training procedures by comparing different strategies for noise addition and parameter space sampling, to achieve better accuracy and robustness to noise. Four MRF sequences were considered: IR-FISP, bSSFP, IR-FISP-B1, and IR-bSSFP-B1. A comparison between NN and the dictionary approaches in reconstructing parameter maps as a function of the number of parameters to be retrieved was performed using a numerical brain phantom. Results demonstrated that training with random sampling and different levels of noise variance yielded the best performance. NN performance was at least as good as the dictionary-based approach in reconstructing parameter maps using Gaussian noise as a source of artifacts: the difference in performance increased with the number of estimated parameters because the dictionary method suffers from the coarse resolution of the parameter space sampling. The NN proved to be more efficient in memory usage and computational burden, and has great potential for solving large-scale MRF problems.

Predicting the Driver's Focus of Attention: The DR(eye)VE Project.

In this work we aim to predict the driver's focus of attention. The goal is to estimate what a person would pay attention to while driving, and which part of the scene around the vehicle is more critical for the task. To this end we propose a new computer vision model based on a multi-branch deep architecture that integrates three sources of information: raw video, motion and scene semantics. We also introduce DR(eye)VE, the largest dataset of driving scenes for which eye-tracking annotations are available. This dataset features more than 500,000 registered frames, matching ego-centric views (from glasses worn by drivers) and car-centric views (from roof-mounted camera), further enriched by other sensors measurements. Results highlight that several attention patterns are shared across drivers and can be reproduced to some extent. The indication of which elements in the scene are likely to capture the driver's attention may benefit several applications in the context of human-vehicle interaction and driver attention analysis.

Socially Constrained Structural Learning for Groups Detection in Crowd.

Modern crowd theories agree that collective behavior is the result of the underlying interactions among small groups of individuals. In this work, we propose a novel algorithm for detecting social groups in crowds by means of a Correlation Clustering procedure on people trajectories. The affinity between crowd members is learned through an online formulation of the Structural SVM framework and a set of specifically designed features characterizing both their physical and social identity, inspired by Proxemic theory, Granger causality, DTW and Heat-maps. To adhere to sociological observations, we introduce a loss function ( G -MITRE) able to deal with the complexity of evaluating group detection performances. We show our algorithm achieves state-of-the-art results when relying on both ground truth trajectories and tracklets previously extracted by available detector/tracker systems.