The Community for Technology Leaders
Green Image
Issue No. 04 - April (2013 vol. 35)
ISSN: 0162-8828
pp: 983-995
P. MomayyezSiahkal , Sch. of Comput. Sci., McGill Univ., Montreal, QC, Canada
K. Siddiqi , Sch. of Comput. Sci., McGill Univ., Montreal, QC, Canada
The 2D stochastic completion field algorithm, introduced by Williams and Jacobs [1], [2], uses a directional random walk to model the prior probability of completion curves in the plane. This construct has had a powerful impact in computer vision, where it has been used to compute the shapes of likely completion curves between edge fragments in visual imagery. Motivated by these developments, we extend the algorithm to 3D, using a spherical harmonics basis to achieve a rotation invariant computational solution to the Fokker-Planck equation describing the evolution of the probability density function underlying the model. This provides a principled way to compute 3D completion patterns and to derive connectivity measures for orientation data in 3D, as arises in 3D tracking, motion capture, and medical imaging. We demonstrate the utility of the approach for the particular case of diffusion magnetic resonance imaging, where we derive connectivity maps for synthetic data, on a physical phantom and on an in vivo high angular resolution diffusion image of a human brain.
Mathematical model, Stochastic processes, Magnetic resonance imaging, Equations, Discrete wavelet transforms, Solid modeling, Probabilistic logic

P. MomayyezSiahkal and K. Siddiqi, "3D Stochastic Completion Fields for Mapping Connectivity in Diffusion MRI," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 35, no. 4, pp. 983-995, 2013.
286 ms
(Ver 3.3 (11022016))