Mr. Ajeet Wankhede Profile

Ajeet Wankhede

at Univ. of Maryland, College Park

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 8 March 2019 Paper

Heuristic-based optimal path planning for neurosurgical tumor ablation

Ajeet Wankhede, Likhita Madiraju, Dipam Patel, Kevin Cleary, Chima Oluigbo, Reza Monfaredi

Proceedings Volume 10951, 109512H (2019) https://doi.org/10.1117/12.2512352

KEYWORDS: Tumors, Surgery, Brain, Skull, MATLAB, Magnetic resonance imaging, Neuroimaging, Detection and tracking algorithms, 3D modeling

Read Abstract +

In brain tumor ablation procedures, imaging for path planning and tumor ablation are performed in two different sessions. Using pre-operative MR images, the neurosurgeon determines an optimal ablation path to maximize tumor ablation in a single path ablation while avoiding critical structures in the brain. After pre-operative path planning the patient undergoes brain surgery. Manual planning for brain tumor ablation is time-intensive. In addition, the preoperative images may not precisely match the intra-operative images due to brain shift after opening the skull. Surgeons sometimes therefore adjust the path planned during the surgery, which leads to increased anaesthesia and operation time. In this paper, a new heuristic-based search algorithm is introduced to find an optimal ablation path for brain tumors, that can be used both pre- and intra-operatively. The algorithm is intended to maximize the safe ablation region with a single path ablation. Given the tumor location, healthy tissue locations, and a random start point on the skull from medical images, our proposed algorithm computes all plausible entry points on the skull and then searches for different ablation paths that intersect with the tumor, avoids the critical structures, and finds the optimal path. We implemented Breadth First Search (BFS), Dijkstra, and our proposed heuristic based algorithms. In this paper we report the results of a comparative study for these methods in terms of the search space explored and required computation time to find an optimal ablation path.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years