The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2006 vol.28)
pp: 119-134
Kang Li , IEEE
ABSTRACT
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications. We have developed an optimal surface detection method capable of simultaneously detecting multiple interacting surfaces, in which the optimality is controlled by the cost functions designed for individual surfaces and by several geometric constraints defining the surface smoothness and interrelations. The method solves the surface segmentation problem by transforming it into computing a minimum s{\hbox{-}} t cut in a derived arc-weighted directed graph. The proposed algorithm has a low-order polynomial time complexity and is computationally efficient. It has been extensively validated on more than 300 computer-synthetic volumetric images, 72 CT-scanned data sets of different-sized plexiglas tubes, and tens of medical images spanning various imaging modalities. In all cases, the approach yielded highly accurate results. Our approach can be readily extended to higher-dimensional image segmentation.
INDEX TERMS
Index Terms- Optimal surface, medical image segmentation, graph algorithms, graph cut, minimum s{\hbox{-}} t cut, geometric constraint.
CITATION
Kang Li, Danny Z. Chen, Milan Sonka, "Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 1, pp. 119-134, January 2006, doi:10.1109/TPAMI.2006.19
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool