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.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Keywords