TY - GEN
T1 - A path-planning algorithm for image-guided neurosurgery
AU - Vaillant, Marc
AU - Davatzikos, Christos
AU - Taylor, Russell H.
AU - Nick Bryan, R.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.
PY - 1997
Y1 - 1997
N2 - A computer algorithm for determining optimal surgical paths in the brain is presented. The algorithm computes a cost function associated with each point on the outer brain boundary, which is treated as a candidate entry point. The cost function is determined partly based on a segmentation of the patients images into gray and white matter, and partly based on a spatially transformed atlas of the human brain registered to the patient's MR images. The importance of various structures, such as thalamic nuclei, optic nerve and radiations, and individual Brodman's areas, can be defined on the atlas and transferred onto the patient's images through the spatial transformation. The cost of a particular path associated with each critical structure, as well as the total cost of each path are computed and displayed, allowing the surgeon to define a low cost path, to visualize an arbitrary cross-section through the patient's MR images that contains this path, and to examine all the cross-sectional images orthogonal to that path.
AB - A computer algorithm for determining optimal surgical paths in the brain is presented. The algorithm computes a cost function associated with each point on the outer brain boundary, which is treated as a candidate entry point. The cost function is determined partly based on a segmentation of the patients images into gray and white matter, and partly based on a spatially transformed atlas of the human brain registered to the patient's MR images. The importance of various structures, such as thalamic nuclei, optic nerve and radiations, and individual Brodman's areas, can be defined on the atlas and transferred onto the patient's images through the spatial transformation. The cost of a particular path associated with each critical structure, as well as the total cost of each path are computed and displayed, allowing the surgeon to define a low cost path, to visualize an arbitrary cross-section through the patient's MR images that contains this path, and to examine all the cross-sectional images orthogonal to that path.
UR - http://www.scopus.com/inward/record.url?scp=84956676391&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84956676391&partnerID=8YFLogxK
U2 - 10.1007/bfb0029269
DO - 10.1007/bfb0029269
M3 - Conference contribution
AN - SCOPUS:84956676391
SN - 3540627340
SN - 9783540627340
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 467
EP - 476
BT - CVRMed-MRCAS 1997 - 1st Joint Conference Computer Vision, Virtual Reality and Robotics in Medicine and Medical Robotics and Computer-Assisted Surgery, Proceedings
A2 - Troccaz, Jocelyne
A2 - Grimson, Eric
A2 - Mösges, Ralph
PB - Springer Verlag
T2 - 1st International Joint Conference on Computer Vision, Virtual Reality, and Robotics in Medicine and Medical Robotics and Computer Assisted Surgery, CVRMed-MRCAS 1997
Y2 - 19 March 1997 through 22 March 1997
ER -