Hybrid Diffusion Imaging (HYDI) was one of the first attempts to use multi-shell samplings of the q-space to infer diffusion properties beyond Diffusion Tensor Imaging (DTI) or High Angular Resolution Diffusion Imaging (HARDI). HYDI was intended as a flexible protocol embedding both DTI (for lower b-values) and HARDI (for higher b-values) processing, as well as Diffusion Spectrum Imaging (DSI) when the entire data set was exploited. In the latter case, the spherical sampling of the q-space is re-gridded by interpolation to a Cartesian lattice whose extent covers the range of acquired b-values, hence being acquisition-dependent. The Discrete Fourier Transform (DFT) is afterwards used to compute the corresponding Cartesian sampling of the Ensemble Average Propagator (EAP) in an entirely non-parametric way. From this lattice, diffusion markers such as the Return To Origin Probability (RTOP) or the Mean Squared Displacement (MSD) can be numerically estimated. We aim at re-formulating this scheme by means of a Fourier Transform encoding matrix that eliminates the need for q-space re-gridding at the same time it preserves the non-parametric nature of HYDI-DSI. The encoding matrix is adaptively designed at each voxel according to the underlying DTI approximation, so that an optimal sampling of the EAP can be pursued without being conditioned by the particular acquisition protocol. The estimation of the EAP is afterwards carried out as a regularized Quadratic Programming (QP) problem, which allows to impose positivity constraints that cannot be trivially embedded within the conventional HYDI-DSI. We demonstrate that the definition of the encoding matrix in the adaptive space allows to analytically (as opposed to numerically) compute several popular descriptors of diffusion with the unique source of error being the cropping of high frequency harmonics in the Fourier analysis of the attenuation signal. They include not only RTOP and MSD, but also Return to Axis/Plane Probabilities (RTAP/RTPP), which are defined in terms of specific spatial directions and are not available with the former HYDI-DSI. We report extensive experiments that suggest the benefits of our proposal in terms of accuracy, robustness and computational efficiency, especially when only standard, non-dedicated q-space samplings are available.

AMURA (Apparent Measures Using Reduced Acquisitions) was originally proposed as a method to infer micro-structural information from single-shell acquisitions in diffusion MRI. It reduces the number of samples needed and the computational complexity of the estimation of diffusion properties of tissues by assuming the diffusion anisotropy is roughly independent on the b-value. This simplification allows the computation of simplified expressions and makes it compatible with standard acquisition protocols commonly used even in clinical practice. The present work proposes an extension of AMURA that allows the calculation of general moments of the diffusion signals that can be applied to describe the diffusion process with higher accuracy. We provide simplified expressions to analytically compute a set of scalar indices as moments of arbitrary orders over either the whole 3-D space, particular directions, or particular planes. The existing metrics previously proposed for AMURA (RTOP, RTPP and RTAP) are now special cases of this generalization. An extensive set of experiments is performed on public data and a clinical clase acquired with a standard type acquisition. The new metrics provide additional information about the diffusion processes inside the brain.

We propose a novel formulation for relaxed analysis-based sparsity in multiple dictionaries as a general type of prior for images, and apply it for Bayesian estimation in image restoration problems. Our formulation of a ℓ2-relaxed ℓ0 pseudo-norm prior allows for an especially simple maximum a posteriori estimation iterative marginal optimization algorithm, whose convergence we prove. We achieve a significant speedup over the direct (static) solution by using dynamically evolving parameters through the estimation loop. As an added heuristic twist, we fix in advance the number of iterations, and then empirically optimize the involved parameters according to two performance benchmarks. The resulting constrained dynamic method is not just fast and effective, it is also highly robust and flexible. First, it is able to provide an outstanding tradeoff between computational load and performance, in visual and objective, mean square error and structural similarity terms, for a large variety of degradation tests, using the same set of parameter values for all tests. Second, the performance benchmark can be easily adapted to specific types of degradation, image classes, and even performance criteria. Third, it allows for using simultaneously several dictionaries with complementary features. This unique combination makes ours a highly practical deconvolution method.