Prostate Surgery Path Planning Based on Simplified Delay-PCNN

Author

Li, He ; Zhang, Xuming ; Hou, Wenguang ; Ding, Mingyue

Author_Institution

Key Lab. of Image Process. & Intell. Control of Educ. Minist. of China, Huazhong Univ. of Sci. & Technol., Wuhan, China

fYear

2011

fDate

14-17 Dec. 2011

Firstpage

300

Lastpage

303

Abstract

This paper presents an algorithm to find the shortest path in 3D(three-dimensional) prostate surgery planning. Using a simplified delay pulse coupled neural network(S-DPCNN) model, a shortest path can be drawn automatically from the target position to the puncture point. Compared to the traditional pulse coupled neural network(PCNN), S-DPCNN needs much fewer neurons and therefore decreases complexity of computation. Experiments on computer simulations show the validity of this method.

Keywords

cancer; medical computing; neural nets; path planning; solid modelling; surgery; 3D prostate surgery path planning; S-DPCNN model; computer simulation; puncture point; shortest path; simplified delay pulse coupled neural network; target position; Biological neural networks; Joining processes; Neurons; Path planning; Solid modeling; Surgery; Three dimensional displays; 3D prostate path planning; S-DPCNN; puncture point; shortest path; target point;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computation and Bio-Medical Instrumentation (ICBMI), 2011 International Conference on

Conference_Location

Wuhan, Hubei

Print_ISBN

978-1-4577-1152-7

Type

conf

DOI

10.1109/ICBMI.2011.75

Filename

6131768