UpdateBot: Nightly -> 4.8

2017-10-18T07:05:21Z

Nightly -> 4.8

New page

<noinclude>{{documentation/versioncheck}}</noinclude>

{{documentation/{{documentation/version}}/module-header}}



{{documentation/{{documentation/version}}/module-section|Introduction and Acknowledgements}}
{{documentation/{{documentation/version}}/module-introduction-start|{{documentation/modulename}}}}
{{documentation/{{documentation/version}}/module-introduction-row}}

Acknowledgments:
Supported by grant number FMECD-2010/71131616E from the Spanish Ministry of Education/Fulbright Committee <br>
Contributors: Antonio Tristan Vega, Demian Wassermann and Carl-Fredrik Westin. The directional iterators were contributed by Luis Ibanez (Kitware).<br>

{{documentation/{{documentation/version}}/module-introduction-row}}
{{documentation/{{documentation/version}}/module-introduction-logo-gallery
|{{collaborator|logo|namic}}|{{collaborator|longname|namic}}
}}
{{documentation/{{documentation/version}}/module-introduction-end}}


{{documentation/{{documentation/version}}/module-section|Module Description}}
This module implements the Finsler tractography method with HARDI data described by J. Melonakos et al. From a set of seeding and target points, the paths are estimated as the shortest path taking into account a local, directional dependent cost.

The output provided is the connectivity map from each voxel in the volume to the seeding points, plus a vector volume with the directions tangent to the fiber bundles at each point. These directions can be traced back to actually compute the fiber bundles using [[Documentation/{{documentation/version}}/Modules/FinslerBacktracing|Finsler Backtracing Module]]. <br>

The Finsler Tractography Module module uses the fast-sweeping algorithm to find the connectivity from a set of seeding points to each voxel in the input DWI volume (or inside the mask, if provided). This connectivity is the minimum cost of arriving at each voxel from the seeds, following the trajectory of the estimated pathways. The cost is computed as the integral along the pathway of a local directional cost computed from the ODF or some other HARDI-related measurement. A complete description of the algorithm may be found in: J. Melonakos, E. Pichon, S. Angenent, A. Tannenbaum, 'Finsler Active Contours'. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(3):412-423. March 2008. A background-removal mask can be used to accelerate computations. Optionally, the algorithm provides at each voxel an estimation of the vector tangent to the optimal pathway at that point (arrival direction). Fast-sweeping is full multi-threaded, and some other accelerations (checking only those voxels in the causal direction of the solution) have been implemented to obtain a result in a reasonable time. However, an algorithm virtually identical to that in the aforementioned paper may be reproduced fixing the advanced parameters as follows: Cost: (E(q)/Phi(r))^3 Directions: 26 Use threads: deactivate Use accelerated iterations: deactivate (Start accelerated iterations becomes irrelevant). <br>


{{documentation/{{documentation/version}}/module-section|Use Cases}}

Create fiber tracks from DWI volume.


{{documentation/{{documentation/version}}/module-section|Tutorials}}

N/A


{{documentation/{{documentation/version}}/module-section|Similar Extensions}}
N/A


{{documentation/{{documentation/version}}/module-section|References}}
* GJ. Melonakos, E. Pichon, S. Angenent, A. Tannenbaum, 'Finsler Active Contours'. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(3):412-423. March 2008


{{documentation/{{documentation/version}}/module-section|Information for Developers}}
{{documentation/{{documentation/version}}/module-developerinfo}}


{{documentation/{{documentation/version}}/module-footer}}

Documentation/4.8/Modules/FinslerTractography - Revision history

UpdateBot: Nightly -> 4.8