Computing the orientational-average of diffusion-weighted MRI signals: a comparison of different techniques

Numerous applications in diffusion MRI involve computing the orientationally-averaged diffusion-weighted signal. Most approaches implicitly assume, for a given b-value, that the gradient sampling vectors are uniformly distributed on a sphere (or ‘shell’), computing the orientationally-averaged signal through simple arithmetic averaging. One challenge with this approach is that not all acquisition schemes have gradient sampling vectors distributed over perfect spheres. To ameliorate this challenge, alternative averaging methods include: weighted signal averaging; spherical harmonic representation of the signal in each shell; and using Mean Apparent Propagator MRI (MAP-MRI) to derive a three-dimensional signal representation and estimate its ‘isotropic part’. Here, these different methods are simulated and compared under different signal-to-noise (SNR) realizations. With sufficiently dense sampling points (61 orientations per shell), and isotropically-distributed sampling vectors, all averaging methods give comparable results, (MAP-MRI-based estimates give slightly higher accuracy, albeit with slightly elevated bias as b-value increases). As the SNR and number of data points per shell are reduced, MAP-MRI-based approaches give significantly higher accuracy compared with the other methods. We also apply these approaches to in vivo data where the results are broadly consistent with our simulations. A statistical analysis of the simulated data shows that the orientationally-averaged signals at each b-value are largely Gaussian distributed.

Parameter Optimization of Droop Controllers for Microgrids in Islanded Mode by the SQP Method with Gradient Sampling

For enhancing the stability of the microgrid operation, this paper proposes an optimization model considering the small-signal stability constraint. Due to the nonsmooth property of the spectral abscissa function, the droop controller parameters’ optimization is a nonsmooth optimization problem. The Sequential Quadratic Programming with Gradient Sampling (SQP-GS) is implemented to optimize the droop controller parameters for solving the nonsmooth problem. The SQP-GS method can guarantee the solution of the optimization problem globally and efficiently converges to stationary points with probability of one. In the current iteration, the gradient of the nonsmooth function can be evaluated on a set of randomly generated nearby points by computing closed-form sensitivities. A test on the microgrid system shows that the optimality and the efficiency of the SQP-GS are better than those of the heuristic algorithms.

Computing the Orientational-Average of Diffusion-Weighted MRI Signals: A Comparison of Different Techniques

ABSTRACTNumerous applications in diffusion MRI, from multi-compartment modeling to power-law analyses, involves computing the orientationally-averaged diffusion-weighted signal. Most approaches implicitly assume, for a given b-value, that the gradient sampling vectors are uniformly distributed on a sphere (or ‘shell’), computing the orientationally-averaged signal through simple arithmetic averaging. One challenge with this approach is that not all acquisition schemes have gradient sampling vectors distributed over perfect spheres (either by design, or due to gradient non-linearities). To ameliorate this challenge, alternative averaging methods include: weighted signal averaging; spherical harmonic representation of the signal in each shell; and using Mean Apparent Propagator MRI (MAP-MRI) to derive a three-dimensional signal representation and estimate its ‘isotropic part’. This latter approach can be applied to all q-space sampling schemes, making it suitable for multi-shell acquisitions when unwanted gradient non-linearities are present.Here, these different methods are compared under different signal-to-noise (SNR) realizations. With sufficiently dense sampling points (61points per shell), and isotropically-distributed sampling vectors, all methods give comparable results, (accuracy of MAP-MRI-based estimates being slightly higher albeit with slightly elevated bias as b-value increases). As the SNR and number of data points per shell are reduced, MAP-MRI-based approaches give pronounced improvements in accuracy over the other methods.

Mitigating the cycle-skipping of full-waveform inversion by random gradient sampling

Full-waveform inversion (FWI) is a highly nonlinear and nonconvex problem. To mitigate the dependence of FWI on the quality of starting model and on the low frequencies in the data, we apply the gradient sampling algorithm (GSA) introduced for nonsmooth, nonconvex optimization problems to FWI. The search space is hugely expanded to have more freedom to accommodate large velocity errors in the starting model. The original implementation of GSA requires explicit calculation of the gradient at each sampled vector, which is prohibitively expensive. Based on the observation that a slight perturbation in the velocity model causes a small spatial shift of the wavefield, we have approximated the sampled gradients by crosscorrelating the space-shifted source- and receiver-side wavefields. Theoretical derivation suggests that the two wavefields should be shifted in the same direction to obtain reasonable low-wavenumber updates. The final descent search direction is obtained by summing all the shifted gradients. For practical implementation, we only take one random space shift at each time step during the gradient calculation. This simplification provides an efficient realization in which the computational costs and memory requirements are the same as conventional FWI. Multiple numerical examples demonstrate that the proposed method alleviates the cycle-skipping problem of conventional FWI when starting from very crude initial velocity models without low-frequency data.