International Journal of Biomedical Imaging

Volume 2013 (2013), Article ID 849363, 8 pages

http://dx.doi.org/10.1155/2013/849363

## Motion Detection in Diffusion MRI via Online ODF Estimation

^{1}Athena Project-Team, INRIA, 2004 Route des Lucioles, BP93, 06902 Sophia Antipolis, INRIA Sophia Antipolis Méditerranée, France^{2}Martinos Center for Biomedical Imaging, Massachusetts General Hospital, Department of Radiology, Harvard Medical School, 149 13th Street, Charlestown, MA 02129, USA^{3}LIDS, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Room 32-D608, Cambridge, MA 02139, USA^{4}Center for Magnetic Resonance Research, Department of Radiology, University of Minnesota Medical School, 2021 Sixth Street SE, Minneapolis, MN 55455, USA^{5}Department of Electrical and Computer Engineering, University of Minnesota, 200 Union Street SE, Minneapolis, MN 55455, USA

Received 15 June 2012; Revised 31 December 2012; Accepted 4 January 2013

Academic Editor: Tiange Zhuang

Copyright © 2013 Emmanuel Caruyer et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The acquisition of high angular resolution diffusion MRI is particularly long and subject motion can become an issue. The orientation distribution function (ODF) can be reconstructed online incrementally from diffusion-weighted MRI with a Kalman filtering framework. This online reconstruction provides real-time feedback throughout the acquisition process. In this article, the Kalman filter is first adapted to the reconstruction of the ODF in constant solid angle. Then, a method called STAR (STatistical Analysis of Residuals) is presented and applied to the online detection of motion in high angular resolution diffusion images. Compared to existing techniques, this method is image based and is built on top of a Kalman filter. Therefore, it introduces no additional scan time and does not require additional hardware. The performance of STAR is tested on simulated and real data and compared to the classical generalized likelihood ratio test. Successful detection of small motion is reported (rotation under 2°) with no delay and robustness to noise.

#### 1. Introduction

Diffusion MRI has provided a great tool for neuroscientists to understand and analyze *in vivo* the anatomy of the brain white matter fiber tracts that connect different areas of the cortex. The diffusion tensor model [1] has become increasingly popular, and the study of scalar indices derived from it has proved useful in the diagnosis of a wide range of neurological diseases [2, 3]. For several specific applications, like fiber tractography, this model is, however, known to be limited, and high angular resolution imaging techniques should be used instead, to reconstruct the model-free ensemble average propagator [4–6] or the orientation distribution function (ODF) [7–10].

The acquisition of high angular resolution diffusion images requires longer time than diffusion tensor imaging. Subjects are likely to move during these acquisitions, and we can identify at least three motivations to develop a proper method for the online detection of motion. First, images can be registered prior to diffusion model estimation; however this might increase partial volume effects [11], because of the relatively low spatial resolution of diffusion-weighted images and of interpolation in the registration procedure. This also modifies the variance properties of the image [12], which should be considered carefully for group studies. When the subject moves during acquisition, a warning could be issued, so as to take a decision accordingly. Depending on the number of images already acquired, the decision could be to restart the scan or acquire a few more diffusion weighted images than originally planned to compensate for the variance increase due to the registration. Second, diffusion acquisitions use a gradient table, which is a set of orientations and -values and has been designed following an optimal sampling strategy. In Q-ball imaging for instance, the set of orientations is designed to sample the sphere in an optimal isotropic fashion [13, 14]. When correcting for motion, the diffusion encoding gradients should be rotated to be consistently defined in a coordinate frame related to the subject [15–17]. This modification might break the optimal sampling strategy as originally planned and affect the reconstruction of the ODF. Finally, in the context of online processing of diffusion images, motion must be detected, so that it can be corrected to continue the incremental reconstruction.

Several solutions for online motion detection and correction were recently proposed [18–21]. The authors in [18] use a camera inside the scanner to detect and evaluate a rigid motion. Their study shows the improvement in ODF reconstruction with this prospective approach for motion correction over a classical offline registration. However, this technique requires additional hardware which is to date not always available on scanners. Other approaches [19, 21] are based on the interleaving of echo navigators through the acquisition sequence. The authors in [19, 21] report good results in detecting and correcting motion, but these additional acquisitions affect the overall protocol time. Finally, a recent work [20] introduces a motion detection and prospective motion correction to account for slow motion artifacts such as image misalignment. They also reduce fast motion effects such as signal dropout, by identifying the volumes most affected by motion, and schedule reacquisition at the end of the scan. This last technique is very promising and shows good results. But the motion detection and correction is performed by comparing a diffusion weighted image to the average of diffusion weighted images with the same -value. We believe this is suboptimal, as it does not take into account the direction associated to each diffusion weighted image. This therefore might lead to a loss of sensitivity and specificity.

In this work, we propose a diffusion weighted-image-based technique for the online detection of motion in Q-ball imaging. Our method does not require new hardware or change in the acquisition protocol and is based on a Kalman filter reconstruction of the HARDI signal [22, 23]. The first contribution is the adaptation of the Kalman filtering framework for online reconstruction of ODF in constant solid angle recently introduced in the Q-ball imaging community [9, 10]. Then, we present a solution to the detection of motion in diffusion images, adapted from the generalized likelihood ratio test (GLRT) [24]. To overcome certain shortcomings of this method, we introduce STAR (STatistical Analysis of Residuals), an original method for the detection of motion in diffusion weighted images. The method is tested under various experimental conditions on semiartificial and on real data and compared to GLRT. In the Results, we report successful detection of small motion (rotation by angle under ), even in noisy conditions. The detection using STAR outperforms GLRT, while STAR does not need any delay for the detection.

#### 2. Methods

In this section, we review the definition and the expression of the ODF calculated in constant solid angle. It has been shown recently that this mathematically correct definition of ODF can be reconstructed in Q-ball imaging [9, 10]. We present an incremental reconstruction algorithm for this ODF, based on the Kalman filter. We formalize the problem of motion detection only from the observation of the diffusion signal. We present a brief review of methods for fault detection, in particular GLRT, built upon the Kalman filter, as first described by [24]. Finally, we present STAR, an original approach based on a statistical modeling of the image. It has several advantages over GLRT. Both algorithms are implemented, and we present at the end of this section the validation methods used to compare them.

##### 2.1. ODF in Constant Solid Angle

The ODF is a spherical function, retaining the angular information of the ensemble average propagator, . When defined as the marginal probability of direction, the ODF, , is the probability for a water molecule to diffuse along a given direction in a constant solid angle. It is defined from the diffusion propagator as

In diffusion MRI, we measure the signal, , which is related to the ensemble average propagator through a Fourier transform, under the narrow-pulse condition [25]

Under the assumption of a monoexponential decay of the diffusion signal , the relation between , , and the ODF is given by where denotes the Funk-Radon Transform and the Laplace-Beltrami operator [9].

The computation of the ODF can be implemented using the modified spherical harmonic basis for real and symmetric functions [8] to describe the transformed signal [9], as both the Funk-Radon transform and the Laplace-Beltrami operations in (3) have a close-form matrix expression in the spherical harmonic basis. If are the spherical harmonic coefficients that describe , then the spherical harmonic coefficients to describe the ODF are where for is the order associated to the th spherical harmonic.

The computation of the spherical harmonic coefficients describing from a series of measurements = , at discrete positions on the unit sphere, and a measurement without any diffusion encoding gradient is implemented by minimizing: The second term is a Laplace-Beltrami regularization constraint on the fitted signal, with the matrix having diagonal elements . The matrix in the data fitting term of (5) accounts for the uncertainty in the diffusion-weighted measurements as well as for the distortion introduced by the nonlinear transform, which is illustrated in Figure 1. The distortion is higher in high-magnitude and low-magnitude signal modes. The diagonal elements of can be approximated through first-order error propagation; the uncertainty on the transformed signal is simply Provided that the error on separate measurements is uncorrelated, the diagonal elements of are simply where denotes the variance of the diffusion signal and can be estimated once for the whole volume using a method like PIESNO for instance [26].

##### 2.2. Incremental ODF Reconstruction

Provided that the acquisition sequence is incremental (in this study we use the incremental point sets as in [23]), the energy in (5) can be minimized incrementally using a Kalman filter [23]. The incremental system adapted to the reconstruction of the ODF in constant solid angle is given by

The depend on the data as expressed in (7), and the covariance of the residual can no longer be precomputed offline. The expected covariance of the estimated spherical harmonic coefficients is the matrix computed by the Kalman filter. Then the expected mean squared error on the spherical harmonic coefficients describing the ODF is given by where is the matrix form of the Funk-Radon transform and has diagonal elements , where is the Legendre polynomial of degree evaluated at 0, and is the Laplace-Beltrami matrix as in (5). An example of ODF reconstructed incrementally is shown on Figure 2.

The Kalman filter was derived with the assumption that the local diffusion propagator does not change in time. Next, we show how we can derive a motion detection algorithm from this Kalman filter.

##### 2.3. Motion and Diffusion Signal

Subject motion generally occurs in a short time compared to the acquisition time. This may induce an *abrupt* change in the diffusion signal. The detection of abrupt changes in dynamical systems has been extensively studied [24, 27]; a very good review of methods and algorithms can be found in [28]. They propose a classification of change detection problems, together with suggested methods and algorithms to address them.

In the previous section, we have introduced a Kalman filter solution to reconstruct the spherical harmonic coefficients of the Q-ball signal. The state of our system is the vector of spherical harmonic coefficients , and a motion of the subject at time is likely to imply a modification of this state, . The problem of motion detection reduces to the problem of change detection in this multidimensional system. Besides, since both the time and the magnitude of the change are unknown *a priori*, the classification in [28] suggests to use a generalized likelihood ratio test (GLRT) for the detection. In the next section we briefly describe this method and its implementation upon a Kalman filter, as originally introduced in [24].

###### 2.3.1. Classical Solution: The Generalized Likelihood Ratio Test

The Kalman filter presented in the first section is built under the hypothesis of no motion. We can monitor the residuals of this Kalman filter for each iteration and test whether the hypothesis is still valid. As it has been shown in [24], the prediction error after a change occurred at time for subsequent iterations can be decomposed as where is zero-mean Gaussian distributed with covariance and represents the propagation of a jump at time , to the prediction error at time . This can be computed as in [24]:

The problem of a change detection is to discriminate between two hypotheses: no change in the state vector: , , at time , the state vector becomes . When and are known, a natural statistic for the detection is the likelihood ratio. Provided that the residuals are linearly related to the change (10), the log-likelihood ratio is Provided that the densities and are Gaussian, after simplification this is rewriten as

In our case, both and are unknown. The generalisation of the likelihood ratio method suggests to replace and in (13) by their maximum likelihood estimates: Finally, the decision is taken by comparing to a threshold .

This technique works fine, yet suffers from several drawbacks. First, the calculation of the maximum likelihood estimate of involves the inversion of a matrix in (14) which has full rank only if . In other words, this implies a delay at least equal to the dimension of the problem. As an example, when the signal is fitted in the 4th order symmetric spherical harmonic basis, this dimension is 15. In addition, the choice of a threshold was reported to be critical and highly dependent on the delay [29]. Finally, in our situation the state vector represents the diffusion signal locally, and GLRT does not say how to combine the statistics of different voxels to calculate a statistic which could be an indicator of motion for the whole volume at once. To address these weaknesses, we propose in the next section an original approach without delay, incorporating a statistical model of the image, in order to provide a more suitable detection algorithm.

###### 2.3.2. Statistical Analysis of the Residuals

The reconstructed image is a vector field , where is a vector of spherical harmonic coefficients describing the diffusion signal at voxel position . We consider the difference between two such vector fields and , representing the same subject before and after a rigid transform. In what follows, we consider as a random variable, with unknown covariance matrix .

Hence if there is no motion, the residuals for the whole volume will be distributed as , where is the variance predicted by the Kalman filter. Otherwise the overall variance of the residuals will increase as , where is the matrix for the propagation of a jump at time to the prediction error at time , and the covariance matrix of is unknown.

Based on the previous observations, we design a test for motion detection without delay. This means that based on measurements up to time , we are able to decide whether a motion occurred at time or not. Given a sample of residuals at time , at voxel positions selected randomly within the brain, the hypotheses that a motion did occur at time or not are equivalent to : has variance , as predicated by the Kalman filter; : has a variance .

This decision problem is commonly addressed with a one-sided -test [30]. We first calculate the statistic: Under the hypothesis , approximately follows a distribution. We want to reject the hypothesis with a significance level : under the hypothesis , we compute such that . The value of is obtained from the inverse cumulative function of the distribution.

##### 2.4. Validation Methods

We implemented the incremental reconstruction using Kalman filtering, together with GLRT and STAR for motion detection. These techniques were tested on real data, and a quantitative analysis of both was performed on semiartificial data, where the motion is simulated by a rigid transform. In this section, we describe how these images were synthesized.

The simulation is based on a tensor field reconstructed images of still subject, acquired on a 3T Siemens magnet at the Center for Magnetic Resonance Research, University of Minnesota Medical School, with 200 encoding directions computed following the optimal sampling scheme of [23], s/m, isotropic resolution mm, 25 images, image matrix, 64 slices, TE = 90 ms, and TR = 8500 ms. We choose a series of diffusion gradient directions and a -value for synthesis. The rigid motion is specified by an instant , its rotation component and its translation vector . Provided that the diffusion encoding gradients should be rotated accordingly [15–17], the gradient directions used for synthesis are . The rigid transform is finally applied to the synthetic diffusion weighted images , after which the images are corrupted by Rician noise.

#### 3. Results

We evaluate the general likelihood ratio, and the residual-based statistics computed for STAR as a motion detection criterion. We first investigate the accuracy of the theoretical threshold in STAR. Then we compare the sensitivity and specificity of GLRT and STAR, for different values of the experimental parameter. Within this section, we report the true positive rate (TPR), defined as TPR = #detected positives/#positives, and the false positive rate, define as FPR = #mislabeled negatives/#negatives.

##### 3.1. Software Implementation

The Kalman filter and STAR were implemented in Python, with the use of the SciPy [31] toolkit, which is an efficient library for scientific computing. Based on this implementation, the reconstruction of the ODF field for an image of dimensions , with 200 diffusion-weighted images, took approximately 29 s on a 4-core Intel Core computer at 3.20 GHz, with 4.0 GB memory, running Linux Mint 13. This means that each diffusion volume is processed within less than 150 ms, which is short with respect to TR.

##### 3.2. Threshold Selection in Motion Detection

One of the advantages of STAR outlined in the previous section is that the threshold for the detection can be deduced from the target false positive rate. In practice, as becomes large, we approximate the distribution for the decision test described in Section 2.3.2 by a normal distribution: , and is given by the inverse normal cumulative density function. For a false positive rate fewer than 5%, the theoretical threshold is . This value is experimentally tested, and the results are presented in the next section.

We report in Figure 3 the value of the statistics , for a series of 100 experiments without motion and a series of 100 experiments where the volume was rotated after 18 acquisitions by an angle of 2°. The threshold was taken as 1.64, for which the false positive probability is 5%. The empirical false positive rate we report for these 200 simulations is 4%, while the true positive rate is 90%.

##### 3.3. Motion Detection: Sensitivity and Specificity

We computed both detection criteria on a series of 100 datasets without motion, and a series of 100 experiments with motion. We plot in Figure 4 the curve TPR *versus* FPR obtained by choosing different threshold values.

We also evaluate the robustness of GLRT and STAR in various experimental conditions. For a fixed FPR = 5%, we plot the TPR score of both methods. The experimental conditions include the delay, instant of motion in the acquisition sequence, SNR, and motion magnitude. The results of these simulations are reported in Figure 5. The experimental conditions, unless explicitly modified, were a rotation around the left-right axis by an angle of 3°, SNR = 20, motion instant and a delay (for GLRT). The experiment includes 400 negatives (simulations without motion) and 100 positives (simulations with motion). The monitoring of residuals in STAR and in GLRT is limited to 500 voxels randomly selected within the brain to get a computational cost adequate for online treatment.

###### 3.3.1. Experiment on a Real Data

We also validate our methods on a real dataset, with the same imaging parameters as above. During the acquisition, the subject was asked to slightly tilt his head after 80 images were acquired. The motion was *a posteriori* identified as a rotation of 20° about the -axis (see Figure 6). The detection algorithms could detect this motion: with a delay of 2 acquisitions for GLRT, and with no delay for STAR.

#### 4. Discussion

Among the challenges of a motion detection algorithm, we have tested both GLRT and STAR in these conditions: (i)small delay for the detection (ideally no delay);(ii)motion that occurred in the first few iterations of the Kalman filter;(iii)very noisy conditions (SNR down to 10);(iv)small motion.With the help of simulated motion, we were able to present this exhaustive set of tests and subsequently the quantitative results. In addition to these tests on artificially added motion, we also showed the application of the method in a real setting, with a healthy subject asked to move on purpose during the scan.

Both criteria show good results in detecting motion, even in severe experimental conditions. As expected, STAR is more robust to noise (Figure 5(a)) and performs better in detecting small motion (Figure 5(b)), since it combines natively the residuals from different voxels.

In addition, GLRT cannot be computed if the number of acquired signals is lower than the dimension of the model, which is 15 in the case of 4^{th} order real, symmetric spherical harmonics. This impacts the ability to detect motion occurring at the beginning of an acquisition sequence: they are detected by STAR, while GLRT cannot be computed (see Figure 5(d)). In addition, GLRT needs a delay greater than 6 to get similar sensitivity as STAR (Figure 5(c)). STAR does not need any delay in the decision. Therefore, STAR is an original method that is best adapted to the problem of detecting motion online from a set of diffusion weighted images.

As we have reported in the implementation section, the reconstruction of the ODF field using Kalman filtering is fast and compatible with online implementation.

#### 5. Conclusions

In this paper, we have proposed a method for the detection of motion in diffusion MRI. We have developed a Kalman filter solution for the estimation of the ODF in constant solid angle. The detection algorithm STAR is based on the analysis of the residuals of the Kalman filter, yet it is general and can be directly applied to any linear diffusion model reconstruction. Compared to other techniques for the prospective detection and correction of motion [18, 19], our method does not require any camera or additional device. Once motion is detected by our technique, a decision could be taken by the scanner operator, or the protocol in [19] could be used for motion correction. To the best of our knowledge, our technique is the only image-based approach that clearly takes into account the directional information in diffusion weighted images to detect motion online.

The proposed technique was tested on semi-artificial data as well as in a real data and shows good results for the online detection of motion. Compared to GLRT, which is a classical solution for the detection of changes in dynamical systems, STAR combines the residuals at different voxel positions to compute a statistic, on which the decision is based. STAR performs better than GLRT in the detection of small motion, motion in noise, or motion occurring early in the acquisition protocol. Besides, STAR does not need any delay for the detection, which makes it very efficient in practical situations.

#### Acknowledgments

This work was partly supported by Inria CD-MRI Associate Team program, ANR NucleiPark, France-Parkinson Foundation, and NIH Grants P41 RR008079 (NCRR), P41 EB015894 (NIBIB), P30 NS057091, and P30 NS076408. C. Lenglet and G. Sapiro were partly supported by the NIH Human Connectome Project U54 MH091657 and Grant R01 EB008432. G. Sapiro received additional support from ONR, NGA, NSF, DARPA, NSSEFF, and ARO.

#### References

- P. J. Basser, J. Mattiello, and D. LeBihan, “MR diffusion tensor spectroscopy and imaging,”
*Biophysical Journal*, vol. 66, no. 1, pp. 259–267, 1994. View at Google Scholar · View at Scopus - D. K. Jones,
*Diffusion MRI: Theory, Methods, and Applications*, University Press, Oxford, UK, 2010. - H. Johansen-Berg and T. E. J. Behrens, Eds.,
*Diffusion MRI: From Quantitative Measurement to in-Vivo neuroanaTomy*, Academic Press, 2009. - H.-E. Assemlal, D. Tschumperlé, and L. Brun, “Efficient computation of pdf-based characteristics from diffusion mr signal,” in
*Proceedings of the International Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI '08)*, pp. 70–78, Springer, Berlin, Heidelberg, 2008. - E. Ozarslan, C. G. Koay, T. M. Shepherd, S. J. Blackband, and P. J. Basser, “Simple harmonic oscillator based reconstruction and estimation for three-dimensional q-space mri,” in
*Proceedings of the 17th International Society for Magnetic Resonance in Medicine Scientific (ISMRM '09)*, Hawaii, Hawaii, USA, April 2009. - M. Descôteaux, R. Deriche, D. LeBihan, J. F. Mangin, and C. Poupon, “Diffusion propagator imaging: using laplace’s equation and multiple shell acquisitions to reconstruct the diffusion propagator,” in
*Proceedings of the Intelligent Platform Management Interface (IPMI '09)*, vol. 5636 of*Lecture Notes in Computer Science*, pp. 1–13, 2009. - D. S. Tuch, “Q-ball imaging,”
*Magnetic Resonance in Medicine*, vol. 52, no. 6, pp. 1358–1372, 2004. View at Google Scholar - M. Descoteaux, E. Angelino, S. Fitzgibbons, and R. Deriche, “Regularized, fast, and robust analytical Q-ball imaging,”
*Magnetic Resonance in Medicine*, vol. 58, no. 3, pp. 497–510, 2007. View at Publisher · View at Google Scholar · View at Scopus - I. Aganj, C. Lenglet, G. Sapiro, E. Yacoub, K. Ugurbil, and N. Harel, “Reconstruction of the orientation distribution function in single- and multiple-shell q-ball imaging within constant solid angle,”
*Magnetic Resonance in Medicine*, vol. 64, no. 2, pp. 554–566, 2010. View at Publisher · View at Google Scholar · View at Scopus - A. Tristán-Vega, C. F. Westin, and S. Aja-Fernández, “Estimation of fiber orientation probability density functions in high angular resolution diffusion imaging,”
*NeuroImage*, vol. 47, no. 2, pp. 638–650, 2009. View at Google Scholar - A. Pfefferbaum, E. V. Sullivan, M. Hedehus, K. O. Lim, E. Adalsteinsson, and M. Moseley, “Agerelated decline in brain white matter anisotropy measured with spatially corrected echo-planar
diffusion tensor imaging,”
*Magnetic Resonance in Medicine*, vol. 44, no. 2, pp. 259–268, 2000. View at Google Scholar - G. K. Rohde, A. S. Barnett, P. J. Basser, and C. Pierpaoli, “Estimating intensity variance due to noise in registered images: applications to diffusion tensor MRI,”
*NeuroImage*, vol. 26, no. 3, pp. 673–684, 2005. View at Publisher · View at Google Scholar · View at Scopus - D. K. Jones, M. A. Horsfield, and A. Simmons, “Optimal strategies for measuring diffusion in anisotropic systems by magnetic resonance imaging,”
*Magnetic Resonance in Medicine*, vol. 42, no. 3, pp. 515–525, 1999. View at Google Scholar - N. G. Papadakis, C. D. Murrills, L. D. Hall, C. L. H. Huang, and T. Adrian Carpenter, “Minimal gradient encoding for robust estimation of diffusion anisotropy,”
*Magnetic Resonance Imaging*, vol. 18, no. 6, pp. 671–679, 2000. View at Publisher · View at Google Scholar · View at Scopus - G. K. Rohde, A. S. Barnett, P. J. Basser, S. Marenco, and C. Pierpaoli, “Comprehensive approach for correction of motion and distortion in diffusion-weighted MRI,”
*Magnetic Resonance in Medicine*, vol. 51, no. 1, pp. 103–114, 2004. View at Publisher · View at Google Scholar · View at Scopus - A. Barmpoutis, B. C. Vemuri, and J. R. Forder, “Registration of high angular resolution diffusion MRI images using 4 th order tensors,”
*Lecture Notes in Computer Science*, vol. 4791, no. 1, pp. 908–915, 2007. View at Google Scholar · View at Scopus - A. Leemans and D. K. Jones, “The B-matrix must be rotated when correcting for subject motion in DTI data,”
*Magnetic Resonance in Medicine*, vol. 61, no. 6, pp. 1336–1349, 2009. View at Publisher · View at Google Scholar · View at Scopus - M. Aksoy, C. Forman, M. Straka et al., “Real-time optical motion correction for diffusion tensor imaging,”
*Magnetic Resonance in Medicine*, vol. 66, no. 2, pp. 366–378, 2011. View at Publisher · View at Google Scholar · View at Scopus - A. A. Alhamud, A. Hess, M. D. Tisdall, E. M. Meintjes, and A. J. van der Kouwe, “Implementation of real time motion correction in diffusion tensor imaging,” in
*Proceedings of the 19th International Society for Magnetic Resonance Society for Magnetic Resonance in Medicine (ISMRM '11)*, Montreal, Canada, May 2011. - T. Benner, A. J. van der Kouwe, and A. G. Sorensen, “Diffusion imaging with prospective motion correction and reacquisition,”
*Magnetic Resonance in Medicine*, vol. 66, no. 1, pp. 154–167, 2011. View at Google Scholar - T. Kober, R. Gruetter, and G. Krueger, “Prospective and retrospective motion correction in diffusion magnetic resonance imaging of the human brain,”
*Neuroimage*, vol. 59, no. 1, pp. 389–398, 2012. View at Google Scholar - C. Poupon, A. Roche, J. Dubois, J. F. Mangin, and F. Poupon, “Real-time MR diffusion tensor and Q-ball imaging using Kalman filtering,”
*Medical Image Analysis*, vol. 12, no. 5, pp. 527–534, 2008. View at Publisher · View at Google Scholar · View at Scopus - R. Deriche, J. Calder, and M. Descoteaux, “Optimal real-time Q-ball imaging using regularized Kalman filtering with incremental orientation sets,”
*Medical Image Analysis*, vol. 13, no. 4, pp. 564–579, 2009. View at Publisher · View at Google Scholar · View at Scopus - A. Willsky and H. Jones, “A generalized likelihood ratio approach to the detection and estimation of jumps in linear systems,”
*IEEE Transactions on Automatic Control*, vol. 21, no. 1, pp. 108–112, 1976. View at Google Scholar - P. T. Callaghan,
*Principles of Nuclear Magnetic Resonance Microscopy*, Clarendon, Oxford, UK, 1991. - C. G. Koay, E. Özarslan, and C. Pierpaoli, “Probabilistic Identification and Estimation of Noise (PIESNO): a self-consistent approach and its applications in MRI,”
*Journal of Magnetic Resonance*, vol. 199, no. 1, pp. 94–103, 2009. View at Publisher · View at Google Scholar · View at Scopus - M. Basseville and A. Benveniste,
*Detection of Abrupt Changes in Signals and Dynamical Systems*, Lecture Notes in Control and Information Sciences, Springer, 1984. - M. Basseville and I. V. Nikiforov,
*Detection of Abrupt Changes: Theory and Application*, Prentice-Hall, Upper Saddle River, NJ, USA, 1993. - M. Basseville and A. Benveniste, “Design and comparative study of some sequential jump
detection algorithms for digital signals,”
*IEEE Transactions on Acoustics, Speech, and Signal Processing*, vol. 31, no. 3, pp. 521–535, 1983. View at Google Scholar · View at Scopus - G. W. Snedecor and W. G. Cochran,
*Statistical Methods*, Iowa State University Press, 1989. - E. Jones, T. Oliphant, P. Peterson et al.,
*SciPy: Open Source Scientific Tools for Python*, 2001.