View Document Preview and Link Document Date: 2014-09-14 12:13:53 Open Document File Size: 1,49 MB Share Result on Facebook
City Seattle / Oxford / / Company MIT Press / / Country Denmark / / Facility Technical University of Denmark Abstract / Washington University / University of Copenhagen / Max Planck Institute / / IndustryTerm adaptive solutions / continuous solutions / path algorithms / diffusion tensor imaging tractography atlas / probabilistic continuous shortest path tractography algorithm / distinct solution / recent algorithm / probabilistic algorithms / tensor imaging / probabilistic numerical solution / shortest paths solutions / diffusion tensor imaging / possible solutions / structural connectivity networks / numerical algorithms / candidate solutions / Deterministic fiber tracking algorithms / non-invasive imaging technology / tractography algorithm / brain networks / expectation-maximization algorithm / feasible solutions / / Organization Danish Council for Independent Research / Max Planck Institute for Intelligent Systems / National Institute of Health / Villum Foundation / Technical University of Denmark Abstract / Germany Department of Computer Science / MIT / Harvard / McDonnell Center for Systems Neuroscience / Washington University / U.S. Securities and Exchange Commission / University of Copenhagen / / Person David Van Essen / Kamil Ugurbil / Duda / / ProgrammingLanguage R / T / / PublishedMedium Machine Learning / / Technology Neuroscience / probabilistic continuous shortest path tractography algorithm / suggested algorithm / Deterministic fiber tracking algorithms / expectation-maximization algorithm / GPS / recent algorithm / Shortest path algorithms / machine learning / animation / MRI / non-invasive imaging technology / / URL http / SocialTag 
Probabilistic shortest path tractography in DTI using Gaussian Process ODE solvers Michael Schober1 , Niklas Kasenburg1,2 , Aasa Feragen1,2 , Philipp Hennig1 , Søren Hauberg3 1