We introduce a computationally efficient fODF-weighted graph structure where shortest-paths through white matter compute the probability of connection while naturally limiting the angle of propagation between steps. Connectivity matrices obtained from this structure maintain many properties of probabilistic streamline count connectomes while avoiding the sampling bias of tractography.
This abstract and the presentation materials are available to members only; a login is required.