Скачать презентацию Intersubject Surface Mapping with Nonrigid Registration for Neurosurgery Скачать презентацию Intersubject Surface Mapping with Nonrigid Registration for Neurosurgery

dfa7eecf14bdb06bea3d2f2c07b8f9f3.ppt

  • Количество слайдов: 40

Intersubject Surface Mapping with Nonrigid Registration for Neurosurgery Vishal Majithia Presented in partial fulfillment Intersubject Surface Mapping with Nonrigid Registration for Neurosurgery Vishal Majithia Presented in partial fulfillment of the requirements for the Degree of Master of Science

Invasive Neurosurgery • Historically, there have been risks associated with neurosurgery. The brain and Invasive Neurosurgery • Historically, there have been risks associated with neurosurgery. The brain and spinal cord are sensitive organs. • Therefore, neurosurgical procedures must be highly accurate and minimally invasive.

Stereotactic Neurosurgery • Use of external device to direct surgical instruments to a specific Stereotactic Neurosurgery • Use of external device to direct surgical instruments to a specific target in the brain. • Create a stereotactic space coordinate system within intracranial space. • Ability to localize target, plan trajectory, identify entry point based on preoperative images. • Allows for more procedures to penetrate deep regions of the brain safely.

Applications of Stereotactic Neurosurgery • Intracranial – – – Craniotomy Needle biopsy Shunt placement Applications of Stereotactic Neurosurgery • Intracranial – – – Craniotomy Needle biopsy Shunt placement Deep brain stimulation Draining of blood clots www. pennhealth. com/health_info/

Stereotactic Neurosurgery • The Cosman Robert Wells (CRW) stereotactic system is currently used by Stereotactic Neurosurgery • The Cosman Robert Wells (CRW) stereotactic system is currently used by the Department of Neurosurgery. • Use: – Stereotactic ring is fixed to patient’s skull preceding CT image acquisition. – Target is localized and aligned with arc-center. – The surgeon can then choose a desired entry point. • Advantages: Accurate, flexible, simple to use www. radionics. com

Image-guided Neurosurgery • Image-guided neurosurgery integrates preoperative imaging with the physical space of the Image-guided Neurosurgery • Image-guided neurosurgery integrates preoperative imaging with the physical space of the patient in the operating room (OR) obtained from 3 D fluoroscopy. • Stealth. Station allows intraoperative planning. • Tracking devices give the neurosurgeon real-time 3 D imaging capabilities. • Increased accuracy of navigation for spinal and intracranial neurosurgery.

Image-guided Neurosurgery www. stealthstation. com www. siemens. com Image-guided Neurosurgery www. stealthstation. com www. siemens. com

Applications of Image-guided Neurosurgery • Spinal – Pedicle screw insertion http: //www. invalidisaatio. fi Applications of Image-guided Neurosurgery • Spinal – Pedicle screw insertion http: //www. invalidisaatio. fi

Frameless Image-guided Neurosurgery • Problem: Current image-guidance and stereotactic technology can become obstructive for Frameless Image-guided Neurosurgery • Problem: Current image-guidance and stereotactic technology can become obstructive for neurosurgeons in the OR. • Challenge: Devise a guide which can be fixed to rigid anatomy and use stereotactic space, but without the large, bulky equipment currently used. • Solution: Use rapid prototyping technology to design and create patient-specific frames and guides based on preoperative planning.

Frameless Image-guided Neurosurgery Frameless Image-guided Neurosurgery

Proposal • The neurosurgeon manually designs each patient’s guidance frame. • We would like Proposal • The neurosurgeon manually designs each patient’s guidance frame. • We would like to automate the procedure by having the surgeon design frames for a reference case. • We apply deformation fields obtained from nonrigid registration to transfer frames between patients. • We constrain our images to binary intensity. • Solution should be fast and robust for clinical use.

Nonrigid Registration • Nonrigid registration aligns images by deforming one image to match the Nonrigid Registration • Nonrigid registration aligns images by deforming one image to match the other. • The registration results in a transformation T, which maps the moving image M to the fixed image F. T(M) = F

Optical Flow • An object moving between a set of images can be characterized Optical Flow • An object moving between a set of images can be characterized by its velocity over the time the images are taken. • Assume object maintains constant intensity over time. • The optical flow, v, gives the movement of a single point:

Demons Registration • Originally developed by Thirion, this algorithm employs local forces, or demons, Demons Registration • Originally developed by Thirion, this algorithm employs local forces, or demons, which push the moving object to fit the fixed object. The force with which each demon pushes is based on the optical flow equation.

Demons Registration • This is an iterative algorithm driven solely by local forces. • Demons Registration • This is an iterative algorithm driven solely by local forces. • Deformation field is smoothed after each iteration with a Gaussian smoothing function.

CRE Algorithm • Developed by Wang and Vemuri, the Cumulative Residual Entropy (CRE) algorithm CRE Algorithm • Developed by Wang and Vemuri, the Cumulative Residual Entropy (CRE) algorithm combines nonrigid registration with an automated segmentation algorithm. • The solution is a minimization of the following energy function. • is the contour in the moving image, is the contour in the fixed image, and the transform we want is T-1(v).

CRE Algorithm • The first term measures the segmentation functional which is an active CRE Algorithm • The first term measures the segmentation functional which is an active contour model. • The second term measures the quality of the registration. The registration algorithm used is Bspline deformation.

CRE Algorithm • The energy function, C, is based on cumulative residual entropy (CRE), CRE Algorithm • The energy function, C, is based on cumulative residual entropy (CRE), ε, a term similar to the entropy term in mutual information.

CRE Algorithm Cumulative residual entropy for an image with some intensity variation. The total CRE Algorithm Cumulative residual entropy for an image with some intensity variation. The total entropy for this image is 2. 438.

CRE Algorithm Cumulative residual entropy for an iso-intensity image. The total entropy is 0. CRE Algorithm Cumulative residual entropy for an iso-intensity image. The total entropy is 0. 1596.

CRE Algorithm • The third term connects the registration and segmentation components. This is CRE Algorithm • The third term connects the registration and segmentation components. This is done by calculating a total signed distance between the result of the segmentation (black) and the result of the registration (red).

Registration Test Cases • We use test cases for which we can predict results. Registration Test Cases • We use test cases for which we can predict results. This allows us to measure the quality of accuracy in the registration as well as the mapping of surface points. • Let SA be the number of voxels in the ideal mapping of a surface. Let SB be the number of voxels in the actual mapping of the surface with the obtained transform. Let SM be the number of voxels which overlap between the ideal and actual surface mappings. We can then define the quality of the surface mapping Qs as:

Cube Registration T T Cube Registration T T

Cube Registration Ideal patch (yellow) and moving patch (blue) Cube Registration Ideal patch (yellow) and moving patch (blue)

Results: Cube Registration Demons registration results completed in 64 minutes, 2500 iterations SA = Results: Cube Registration Demons registration results completed in 64 minutes, 2500 iterations SA = 990, SB = 990, SM = 920, QS = 0. 929

Results: Cube Registration CRE Registration results completed in 87 minutes, 2209 iterations SA = Results: Cube Registration CRE Registration results completed in 87 minutes, 2209 iterations SA = 990, SB = 609, SM = 547, QS = 0. 339

Spinal Vertebral Body Registration: First Image Set Sheared (gray) and original (blue) spinal vertebral Spinal Vertebral Body Registration: First Image Set Sheared (gray) and original (blue) spinal vertebral bodies (SVB)

Results: Sheared SVB Registration Demons registration results completed in 655 minutes, 3000 iterations SA Results: Sheared SVB Registration Demons registration results completed in 655 minutes, 3000 iterations SA = 600, SB = 600, SM = 558, QS = 0. 930

Results: Sheared SVB Registration CRE registration results completed in 492 minutes, 4724 iterations SA Results: Sheared SVB Registration CRE registration results completed in 492 minutes, 4724 iterations SA = 600, SB = 412, SM = 0, QS = 0

Spinal Vertebral Body Registration: Second Image Set Stretched (gray) and original (blue) spinal vertebral Spinal Vertebral Body Registration: Second Image Set Stretched (gray) and original (blue) spinal vertebral bodies

Results: Stretched SVB Registration Demons registration results completed in 1106 minutes, 4000 iterations SF Results: Stretched SVB Registration Demons registration results completed in 1106 minutes, 4000 iterations SF = 1800, SB = 1729

Results: Stretched SVB Registration CRE registration results completed in 623 minutes, 5580 iterations SF Results: Stretched SVB Registration CRE registration results completed in 623 minutes, 5580 iterations SF = 1800, SB = 1611

Discussion • Accuracy and robustness – Demons algorithm gave good results for registering test Discussion • Accuracy and robustness – Demons algorithm gave good results for registering test images and mapping surfaces from one object to another. – CRE algorithm was unable to register any of the images very well. • Speed – Demons algorithm was very slow to converge – CRE algorithm was faster to converge, but did not give good results – Neither algorithm gave good results in a reasonable amount of time

Discussion • Multiresolution approach – Perform a crude registration at low resolutions. – Very Discussion • Multiresolution approach – Perform a crude registration at low resolutions. – Very fast computation times and converges more rapidly. – Loss of surface points due to aliasing during downsampling makes this method impractical for our application.

Discussion: Demons Registration • The demons registration took too long for clinical applications. This Discussion: Demons Registration • The demons registration took too long for clinical applications. This may be caused by the binary nature of the images we are registering. Recall the definition of the velocity vectors which drive the registration. • Points with zero velocity do not contribute to the transform.

Discussion: Demons Registration The above 2 D example shows the active demons for a Discussion: Demons Registration The above 2 D example shows the active demons for a single iteration. The only driving force is these boundary voxels. The combination of few active effectors, constraints to maintain local deformations, and lack of any global, systematic search for a solution leads to very slow convergence.

Discussion: CRE Algorithm • The CRE algorithm was unable to accurately register any of Discussion: CRE Algorithm • The CRE algorithm was unable to accurately register any of the image sets. • A possible source of error may lie in the number of grid points. Increasing the number of grid points does increase the quality of the registration, but at the cost of increased runtime per iteration.

Conclusion • Nonrigid registration has been shown to accurately map surface points for test Conclusion • Nonrigid registration has been shown to accurately map surface points for test cases. • The results from test cases were unable to demonstrate clinical viability based on speed and robustness.

Future Work • Recent methods have been proposed to speed up the Demons algorithm Future Work • Recent methods have been proposed to speed up the Demons algorithm with the application of external forces. 1 • Constraints on the deformation field obtained by the CRE algorithm may help this method be more stable at the expense of increased iterations. • Conversion of iso-intensity volume to multi-intensity volume • Testing with clinical images 1. Wang et al, “Validation of an accelerated demons algorithm for deformable image registration in radiation therapy, ” Phys. Med. Biol. 50, 2887 -2905 (2005).

Acknowledgements • Committee Members – – Dr. Frank Bova Dr. Samim Anghaie Dr. David Acknowledgements • Committee Members – – Dr. Frank Bova Dr. Samim Anghaie Dr. David Gilland Dr. William Friedman. • Radiosurgery Lab – Dr. Didier Rajon – Barbara Garita – Atchar Sudhyadhom • Computer Science – Dr. Baba Vemuri – Fei Wang