Name
Title | ||
|---|---|---|
Optimal graph search segmentation using arc-weighted graph for simultaneous surface detection of bladder and prostate. |
Abstract | ||
|---|---|---|
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic approach. Hard surface interacting constraints are enforced in the interacting regions, preserving the geometric relationship of those partially interacting surfaces. The soft smoothness a priori shape compliance is introduced into the energy functional to provide shape guidance. The globally optimal surfaces can be simultaneously achieved by solving a maximum flow problem based on an arc-weighted graph representation. Representing the segmentation problem in an arc-weighted graph, one can incorporate a wider spectrum of constraints into the formulation, thus increasing segmentation accuracy and robustness in volumetric image data. To the best of our knowledge, our method is the first attempt to introduce the arc-weighted graph representation into the graph-searching approach for simultaneous segmentation of multiple partially interacting objects, which admits a globally optimal solution in a low-order polynomial time. Our new approach was applied to the simultaneous surface detection of bladder and prostate. The result was quite encouraging in spite of the low saliency of the bladder and prostate in CT images. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04271-3_100 | MICCAI |
Keywords | Field | DocType |
interacting region,arc-weighted graph representation,3-d graph-theoretic approach,interacting surface,segmentation accuracy,optimal graph search segmentation,arc-weighted graph,simultaneous segmentation,segmentation problem,optimal surface segmentation,interacting object,simultaneous surface detection | Scale-space segmentation,Pattern recognition,Computer science,Segmentation,Robustness (computer science),Maximum flow problem,Artificial intelligence,Graph bandwidth,Energy functional,Time complexity,Graph (abstract data type) | Conference |
Volume | Issue | ISSN |
12 | Pt 2 | 0302-9743 |
Citations | PageRank | References |
25 | 1.35 | 13 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qi Song | 1 | 63 | 5.44 |
| Xiaodong Wu | 2 | 859 | 77.06 |
| Yunlong Liu | 3 | 33 | 2.42 |
| Mark Smith | 4 | 25 | 1.35 |
| John Buatti | 5 | 56 | 3.54 |
| Milan Sonka | 6 | 2889 | 254.20 |