Graph search with appearance and shape information for 3-D prostate and bladder segmentation.
The segmentation of soft tissues in medical images is a challenging problem due to the weak boundary, large deformation and serious mutual influence. We present a novel method incorporating both the shape and appearance information in a 3-D graph-theoretic framework to overcome those difficulties for simultaneous segmentation of prostate and bladder. An arc-weighted graph is constructed corresponding to the initial mesh. Both the boundary and region information is incorporated into the graph with learned intensity distribution, which drives the mesh to the best fit of the image. A shape prior penalty is introduced by adding weighted-arcs in the graph, which maintains the original topology of the model and constraints the flexibility of the mesh. The surface-distance constraints are enforced to avoid the leakage between prostate and bladder. The target surfaces are found by solving a maximum flow problem in low-order polynomial time. Both qualitative and quantitative results on prostate and bladder segmentation were promising, proving the power of our algorithm.
Song
Qi
Q
Department of Electrical & Computer Engineering, University of Iowa, Iowa City, IA 52242, USA. qi-song@uiowa.edu
Liu
Yinxiao
Y
Liu
Yunlong
Y
Saha
Punam K
PK
Sonka
Milan
M
Wu
Xiaodong
X
D000465:Algorithms; D006801:Humans; D021621:Imaging, Three-Dimensional / Q000379:methods*; D008297:Male; D010363:Pattern Recognition, Automated / Q000379:methods*; D011467:Prostate / Q000000981:diagnostic imaging*; D011471:Prostatic Neoplasms / Q000000981:diagnostic imaging*; D011856:Radiographic Image Enhancement / Q000379:methods; D011857:Radiographic Image Interpretation, Computer-Assisted / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D014057:Tomography, X-Ray Computed / Q000379:methods*; D001743:Urinary Bladder / Q000000981:diagnostic imaging*