Optimal Surface Segmentation in Volumetric Images - A Graph-Theoretic Approach

January 2006

Optimal Surface Segmentation in Volumetric Images - A Graph-Theoretic Approach

Authors:

Kang Li, Xiaodong Wu, Danny Z. Chen, and Milan Sonka

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.
@article{Li-2006-9384,
author = {Kang Li And Xiaodong Wu And Danny Z. Chen And Milan Sonka},
title = {Optimal Surface Segmentation in Volumetric Images - A Graph-Theoretic Approach},
journal = {Proceedings of IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {2006},
month = {January},
volume = {28},
number = {1},
pages = {119 - 134},
keywords = {Optimal surface, medical image segmentation, graph algorithms, graph cut, minimum s-t cut, geometric constraint},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.