Difference between revisions of "Documentation/4.8/Modules/GeodesicSlicer"
(Created page with "<noinclude>{{documentation/versioncheck}}</noinclude> <!-- ---------------------------- --> {{documentation/{{documentation/version}}/module-header}} <!-- --------------------...") |
(I have made this page (under construction)) |
||
Line 3: | Line 3: | ||
{{documentation/{{documentation/version}}/module-header}} | {{documentation/{{documentation/version}}/module-header}} | ||
<!-- ---------------------------- --> | <!-- ---------------------------- --> | ||
− | + | [[File:GeodesicSlicer logo.png|128x128px|thumb|center|GeodesicSlicer logo]] | |
<!-- ---------------------------- --> | <!-- ---------------------------- --> | ||
{{documentation/{{documentation/version}}/module-section|Introduction and Acknowledgements}} | {{documentation/{{documentation/version}}/module-section|Introduction and Acknowledgements}} | ||
Line 11: | Line 11: | ||
: '''Acknowledgements:''' This work was supported by CHU Caen.<br> | : '''Acknowledgements:''' This work was supported by CHU Caen.<br> | ||
: '''Contact:''' Frederic Briend, <email>briend@cyceron.fr</email><br> | : '''Contact:''' Frederic Briend, <email>briend@cyceron.fr</email><br> | ||
− | |||
[[File:Logo ISTS Elise final trans petit.jpg|146x122px|thumb|center|ISTS]] | [[File:Logo ISTS Elise final trans petit.jpg|146x122px|thumb|center|ISTS]] | ||
{{documentation/{{documentation/version}}/module-introduction-row}} | {{documentation/{{documentation/version}}/module-introduction-row}} | ||
Line 31: | Line 30: | ||
*'''''Mesh''''' A mesh or polygon mesh is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. | *'''''Mesh''''' A mesh or polygon mesh is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. | ||
*'''''Shortest path''''' In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. | *'''''Shortest path''''' In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. | ||
− | *'''''10-20 EEG system''''' The International 10-20 system | + | *'''''10-20 EEG system''''' The International 10-20 system is commonly used for EEG electrode placement and for correlating external skull locations to underlying cortical areas.<ref name="Jasper 1958">Jasper, H.H. The ten-twenty electrode system of the International Federation. Electroencephalogr. Clin. Neurophysiol., 1958, 10: 370-375</ref> |
<!-- ---------------------------- --> | <!-- ---------------------------- --> | ||
Line 43: | Line 42: | ||
{{documentation/{{documentation/version}}/module-section|Panels and their use}} | {{documentation/{{documentation/version}}/module-section|Panels and their use}} | ||
− | + | [[File:Wiki main picture.png|thumb|center|Geodesic Slicer. Panel set]] | |
==== Create a mesh ==== | ==== Create a mesh ==== | ||
Line 89: | Line 88: | ||
<!-- ---------------------------- --> | <!-- ---------------------------- --> | ||
{{documentation/{{documentation/version}}/module-section|References}} | {{documentation/{{documentation/version}}/module-section|References}} | ||
− | |||
<!-- ---------------------------- --> | <!-- ---------------------------- --> | ||
{{documentation/{{documentation/version}}/module-footer}} | {{documentation/{{documentation/version}}/module-footer}} | ||
<!-- ---------------------------- --> | <!-- ---------------------------- --> |
Revision as of 16:53, 8 February 2018
Home < Documentation < 4.8 < Modules < GeodesicSlicer
For the latest Slicer documentation, visit the read-the-docs. |
Introduction and Acknowledgements
|
The module has been developed based on ideas and feedback from the community. We would like to especially thank:
- Dr. Olivier Etard, M.D., Ph.D., CHU de Caen.
- Dr. Sonia Dollfus, M.D., Ph.D., CHU de Caen, header of ISTS.
- Dr. Csaba Pinter, MSc, Queen's University.
- Dr. Andras Lasso, Ph.D., Queen's University.
Contents
Module Description
This module calculates geodesic path in 3D structure. Thanks to this geodesic path, this module could draw an EEG 10-20 system.
Terminology
- Mesh A mesh or polygon mesh is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling.
- Shortest path In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
- 10-20 EEG system The International 10-20 system is commonly used for EEG electrode placement and for correlating external skull locations to underlying cortical areas.[1]
Use Cases
The overall goal is to allow users to find the shortest paths between nodes in a graph and via the Dijkstra's algorithm to make 10-20 system. This module can be used for:
- Stimulation in psychiatry
- surgery measurement
- 3D printing
Panels and their use
Create a mesh
Image à insérer: "wiki_main_picture2.png"
A typical straightforward Geodesic Slicer workflow for consists of the following steps:
- Load a volume.nii.
- Enter the Geodesic Slicer module using either the toolbar or the Modules menu button.
- Create a mesh.
- Wait a moment
- Use this mesh.
- If your background was named 't1' the label will be called 't1-label'.
- Go to Parameters to find the shortest path or Make 10-20 EEG system electrode section.
Parameters to find the shortest path
- Source points.
- Input STL model.
- Calculate in centimeter the shortest path via the Dijkstra's algorithm.
- Draw the Dijkstra's algorithm shortest path.
- Length (cm)
10-20 system electrode
Run the Dijkstra's algorithm to make the 10-20 system electrode distances
4 anatomical landmarks
Four anatomical landmarks are used for the essential positioning of the electrodes:
- 1/the nasion
- 2/the inion
- 3/the pre auricular to the left ear
- 4/the pre auricular to the right ear
Input STL model
This model required to contain a dense set of points.
Make 10-20 EEG system electrode
Make 10-20 EEG system electrode via the Dijkstra's algorithm.
- Distance T3-Stim in the T3P3 axis are give in centimeters.
Information for Developers
The code is available at Github.
References
- ↑ Jasper, H.H. The ten-twenty electrode system of the International Federation. Electroencephalogr. Clin. Neurophysiol., 1958, 10: 370-375