This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
January 2006 (vol. 28 no. 1)
pp. 119-134
Kang Li, IEEE
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.

[1] U. Montanari, “On the Optimal Detection of Curves in Noisy Pictures,” Comm. ACM, vol. 14, pp. 335-345, May 1971.
[2] A. Martelli, “Edge Detection Using Heuristic Search Methods,” Computer Graphics and Image Processing, vol. 1, pp. 169-182, Aug. 1972.
[3] A. Martelli, “An Application of Heuristic Search Methods to Edge and Contour Detection,” Comm. ACM, vol. 19, pp. 73-83, Feb. 1976.
[4] D. Pope, D. Parker, P. Clayton, and D. Gustafson, “Left Ventricular Border Detection Using a Dynamic Search,” Radiology, vol. 155, pp. 513-518, May 1985.
[5] A. Schenk, G. Prause, and H.-O. Peitgen, “Local Cost Computation for Efficient Segmentation of 3D Objects with Live Wire,” Proc. SPIE Int'l Symp. Medical Imaging: Image Processing, vol. 4322, pp. 1357-1364, 2001.
[6] M. Sonka, X. Zhang, S. DeJong, S. Collins, and C. McKay, “Segmentation of Intravascular Ultrasound Images: A Knowledge-Based Approach,” IEEE Trans. Medical Imaging, vol. 14, pp. 719-732, Aug. 1995.
[7] A.X. Falcão, J.K. Udupa, and F.K. Miyazawa, “An Ultra-Fast User-Steered Image Segmentation Paradigm: Live Wire on the Fly,” IEEE Trans. Medical Imaging, vol. 19, Jan. 2000.
[8] D. Thedens, D. Skorton, and S. Fleagle, “A Three-Dimensional Graph Searching Technique for Cardiac Border Detection in Sequential Images and Its Application to Magnetic Resonance Image Data,” Computers in Cardiology, pp. 57-60, Sept. 1990.
[9] D.R. Thedens, D.J. Skorton, and S.R. Fleagle, “Methods of Graph Searching for Border Detection in Image Sequences with Applications to Cardiac Magnetic Resonance Imaging,” IEEE Trans. Medical Imaging, vol. 14, no. 1, pp. 42-55, 1995.
[10] R. Frank, “Optimal Surface Detection Using Multi-Dimensional Graph Search: Applications to Intravascular Ultrasound,” master's thesis, Univ. of Iowa, 1996.
[11] A.X. Falcão and J.K. Udupa, “Segmentation of 3D Objects Using Live Wire,” Proc. SPIE Int'l Symp. Medical Imaging: Image Processing, vol. 3,034, pp. 228-235, Apr. 1997.
[12] A.X. Falcão and J.K. Udupa, “A 3D Generalization of User-Steered Live-Wire Segmentation,” Medical Image Analysis, vol. 4, pp. 389-402, Dec. 2000.
[13] X. Wu and D.Z. Chen, “Optimal Net Surface Problems with Applications,” Proc. 29th Int'l Colloquium Automata, Languages, and Programming (ICALP), pp. 1029-1042, July 2002.
[14] K. Li, X. Wu, D.Z. Chen, and M. Sonka, “Efficient Optimal Surface Detection: Theory, Implementation and Experimental Validation,” Proc. SPIE Int'l Symp. Medical Imaging: Image Processing, vol. 5370, pp. 620-627, May 2004.
[15] K. Li, X. Wu, D.Z. Chen, and M. Sonka, “Globally Optimal Segmentation of Interacting Surfaces with Geometric Constraints,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition (CVPR), vol. 1, pp. 394-399, June 2004.
[16] C. Zahn, “Graph-Theoretic Methods for Detecting and Describing Gestalt Clusters,” IEEE Trans. Computers, vol. 20, pp. 68-86, 1971.
[17] Y. Xu, V. Olman, and E. Uberbacher, “A Segmentation Algorithm for Noisy Images,” Proc. IEEE Int'l Joint Symp. Intelligence and Systems, pp. 220-226, Nov. 1996.
[18] Y. Xu and E.C. Uberbacher, “2-D Image Segmentation Using Minimum Spanning Trees,” Image and Vision Computing, vol. 15, no. 1, pp. 47-57, 1997.
[19] A. Jagannathan and E. Miller, “A Graph-Theoretic Approach to Multiscale Texture Segmentation,” Proc. Int'l Conf. Image Processing, vol. 2, pp. 777-780, Sept. 2002.
[20] P.F. Felzenszwalb and D.P. Huttenlocher, “Efficient Graph-Based Image Segmentation,” Int'l J. Computer Vision, vol. 59, pp. 167-181, Sept. 2004.
[21] J.K. Udupa and S. Samarasekera, “Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation,” Graphics Models and Image Processing, vol. 58, pp. 246-261, May 1996.
[22] P.K. Saha and J.K. Udupa, “Relative Fuzzy Connectedness among Multiple Objects: Theory, Algorithms, and Applications in Image Segmentation,” Computer Vision and Image Understanding, vol. 82, pp. 42-56, 2000.
[23] L.G. Nyul, A.X. Falcão, and J.K. Udupa, “Fuzzy-Connected 3D Image Segmentation at Interactive Speeds,” Graphical Models, vol. 64, pp. 259-281, Sept. 2002.
[24] A.X. Falcão, J. Stolfi, and R. de Alencar Lotufo, “The Image Foresting Transform: Theory, Algorithms, and Applications,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 1, pp. 19-29, Jan. 2004.
[25] J.H.C. Reiber, P.M.J. van der Zwet, C.D. von Land, G. Loois, I. Zorn, M. van den Brand, and J.J. Gerbrands, “On-Line Quantification of Coronary Angiograms with the DCI System,” Medicamundi, vol. 34, pp. 89-98, 1989.
[26] M. Sonka, M.D. Winniford, and S.M. Collins, “Robust Simultaneous Detection of Coronary Borders in Complex Images,” IEEE Trans. Medical Imaging, vol. 14, pp. 151-161, Mar. 1995.
[27] M. Sonka, V. Hlavac, and R. Boyle, Image Processing, Analysis, and Machine Vision, second ed. Brooks/Cole Publishing Company, 1999.
[28] Z. Wu and R. Leahy, “An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation,” IEEE Trans. Pattern Analysis Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, Nov. 1993.
[29] I. Cox, S. Rao, and Y. Zhong, “Ratio Regions: A Technique for Image Segmentation,” Proc. Int'l Conf. Pattern Recognition, vol. 2, pp. 557-564, Aug. 1996
[30] H. Ishikawa and D. Geiger, “Segmentation by Grouping Junctions,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 125-131, June 1998.
[31] I. Jermyn and H. Ishikawa, “Globally Optimal Regions and Boundaries as Minimum Ratio Cycles,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1075-1088, Oct. 2001.
[32] J. Shi and J. Malik, “Normalized Cuts and Image Segmentation,” IEEE Trans. Pattern Analysis Machine Intelligence, vol. 22, no. 8, pp. 888-905, Aug. 2000.
[33] Y. Boykov and M.-P. Jolly, “Interactive Organ Segmentation Using Graph Cuts,” Proc. Medical Image Computing and Computer-Assisted Intervention (MICCAI), pp. 276-286, 2000.
[34] Y.Y. Boykov and M.-P. Jolly, “Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images,” Proc. Int'l Conf. Computer Vision (ICCV), vol. 1, pp. 105-112, July 2001.
[35] S. Wang and J. Siskind, “Image Segmentation with Ratio Cut,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 675-690, June 2003.
[36] Y. Boykov and V. Kolmogorov, “An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 9, pp. 1124-1137, Sept. 2004.
[37] Y. Li, J. Sun, C.-K. Tang, and H.-Y. Shum, “Lazy Snapping,” ACM Trans. Graphics (TOG), vol. 23, pp. 303-308, Aug. 2004.
[38] J. Kim and R. Zabih, “A Segmentation Algorithm for Contrast-Enhanced Images,” Proc. IEEE Int'l Conf. Computer Vision, pp. 502-509, Oct. 2003.
[39] J. Sethian, Level Set Methods and Fast Marching Methods Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, second ed. Cambridge, U.K.: Cambridge Univ. Press, 1999.
[40] Geometric Level Set Methods in Imaging, Vision and Graphics, S. Osher and N. Paragios, eds. Springer, 2003.
[41] Y. Boykov, O. Veksler, and R. Zabih, “Fast Approximate Energy Minimization via Graph Cuts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222-1239, Nov. 2001.
[42] V. Kolmogorov and R. Zabih, “What Energy Functions Can Be Minimized via Graph Cuts?” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 2, pp. 147-159, Feb. 2004.
[43] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, Nov. 1984.
[44] L.R.J. Ford and D.R. Fulkerson, “Maximal Flow through a Network,” Canadian J. Math., vol. 8, pp. 399-404, 1956.
[45] A.V. Goldberg and R.E. Tarjan, “A New Approach to the Maximum-Flow Problem,” J. ACM, vol. 35, pp. 921-940, 1988.
[46] A.V. Goldberg and S. Rao, “Beyond the Flow Decomposition Barrier,” J. ACM, vol. 45, pp. 783-797, 1998.
[47] Y. Boykov and V. Kolmogorov, “Computing Geodesics and Minimal Surfaces Via Graph Cuts,” Proc. Int'l Conf. Computer Vision (ICCV), pp. 26-33, Oct. 2003.
[48] X. Zeng, L. Staib, R. Schultz, and J. Duncan, “Segmentation and Measurement of the Cortex from 3-D MR Images Using Coupled-Surfaces Propagation,” IEEE Trans. Medical Imaging, vol. 18, pp. 927-937, Oct. 1999.
[49] D. MacDonald, N. Kabani, D. Avis, and A. Evans, “Automated 3-D Extraction of Inner and Outer Surfaces of Cerebral Cortex from MRI,” NeuroImage, vol. 12, no. 3, pp. 340-356, Sept. 2000.
[50] R. Goldenberg, R. Kimmel, E. Rivlin, and M. Rudzsky, “Cortex Segmentation: A Fast Variational Geometric Approach,” IEEE Trans. Medical Imaging, vol. 21, pp. 1544-1551, Dec. 2002.
[51] L. Spreeuwers and M. Breeuwer, “Detection of Left Ventricular Epi- and Endocardial Borders Using Coupled Active Contours,” Computer Assisted Radiology and Surgery, pp. 1147-1152, June 2003.
[52] R. Goldenberg, R. Kimmel, E. Rivlin, and M. Rudzsky, “Fast Geodesic Active Contours,” IEEE Trans. Image Processing, vol. 10, pp. 1467-1475, Oct. 2001.
[53] X. Han, C. Xu, and J.L. Prince, “A Topology Preserving Level Set Method for Geometric Deformable Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 6, pp. 755-768, June 2003.
[54] T.F. Cootes, A. Hill, C.J. Taylor, and J. Haslam, “The Use of Active Shape Models for Locating Structures in Medical Images,” Proc. 13th Int'l Conf. Information Processing in Medical Imaging (IPMI), pp. 33-47, 1993.
[55] T. Cootes, G. Edwards, and C. Taylor, “Active Appearance Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, pp. 681-685, June 2001.
[56] S. Mitchell, B. Lelieveldt, R. van der Geest, H. Bosch, J. Reiber, and M. Sonka, “Multistage Hybrid Active Appearance Model Matching: Segmentation of Left and Right Ventricles in Cardiac MR Images,” IEEE Trans. Medical Imaging, vol. 20, pp. 415-423, May 2001.
[57] D. Hochbaum, “A New-Old Algorithm for Minimum-Cut and Maximum-Flow in Closure Graphs,” Networks, vol. 37, pp. 171-193, 2001.
[58] J. Picard, “Maximal Closure of a Graph and Applications to Combinatorial Problems,” Management Science, vol. 22, pp. 1268-1272, 1976.
[59] M. Sonka, G.K. Reddy, M.D. Winniford, and S.M. Collins, “Adaptive Approach to Accurate Analysis of Small-Diameter Vessels in Cineangiograms,” IEEE Trans. Medical Imaging, vol. 16, pp. 87-95, Feb. 1997.
[60] D. Mumford and J. Shah, “Optimal Approximation by Piecewise Smooth Functions and Associated Variational Problems,” Comm. Pure and Applied Math., vol. 42, pp. 577-685, 1989.
[61] T.F. Chan and L.A. Vese, “Active Contour without Edges,” IEEE Trans. Image Processing, vol. 10, no. 2, pp. 266-277, Feb. 2001.
[62] J. Tschirren, “Segmentation, Anatomical Labeling, Branch-Point Matching, and Quantitative Analysis of Human Airway in Volumetric CT Images,” PhD dissertation, Univ. of Iowa, Aug. 2003.
[63] K. Palágyi, E. Sorantin, E. Balogh, A. Kuba, C. Halmai, B. Erdohelyi, and K. Hausegger, “A Sequential 3D Thinning Algorithm and Its Medical Applications,” Proc. 17th Int'l Conf. Information Processing in Medical Imaging (IPMI), pp. 409-415, 2001.
[64] M. Unser, A. Aldroudi, and M. Eden, “B-Spline Signal Processing: Part I— Theory,” IEEE Trans. Signal Processing, vol. 41, pp. 821-833, Feb. 1993.
[65] M. Unser, A. Aldroubi, and M. Eden, “B-Spline Signal Processing: Part II— Efficient Design and Applications,” IEEE Trans. Signal Processing, vol. 41, no. 2, pp. 834-848, Feb. 1993.
[66] B. Cherkassky and A. Goldberg, “On Implementing Push-Relabel Method for the Maximum Flow Problem,” Algorithmica, vol. 19, pp. 390-410, 1997.
[67] X. Huang, D. Metaxas, and T. Chen, “Metamorphs: Deformable Shape and Texture Models,” Proc. IEEE CS Conf. Computer Vision and Pattern Recognition (CVPR), vol. 1, pp. 496-503, June 2004.
[68] F. Yang, G. Holzapfel, C. Schulze-Bauer, R. Stollberger, D. Thedens, L. Bolinger, A. Stolpen, and M. Sonka, “Segmentation of Wall and Plaque in in Vitro Vascular MR Images,” The Int'l J. Cardiac Imaging, vol. 19, pp. 419-428, Oct. 2003.
[69] I.G.H. Lerchs, “Optimum Design of Open-Pit Mines,” Trans. CIM, vol. 58, pp. 17-24, 1965.
[70] B. Denby and D. Schofield, “Genetic Algorithms: A New Approach to Pit Optimization,” Proc. 24th Int'l APCOM Symp., pp. 126-133, 1993.
[71] D. Hochbaum and A. Chen, “Improved Planning for the Open— Pit Mining Problem,” Operations Research, vol. 48, pp. 894-914, 2000.
[72] X. Zhang, C. McKay, and M. Sonka, “Tissue Characterization in Intravascular Ultrasound Images,” IEEE Trans. Medical Imaging, vol. 17, pp. 889-899, Dec. 1998.
[73] A.Ü. Coşkun, Y. Yeghiazarians, S. Kinlay, M.E. Clark, O.J. Ilegbusi, A. Wahle, M. Sonka, J.J. Popma, R.E. Kuntz, C.L. Feldman, and P.H. Stone, “Reproducibility of Coronary Lumen, Plaque, and Vessel Wall Reconstruction and of Endothelial Shear Stress Measurements In-Vivo in Humans,” Catheterization and Cardiovascular Interventions, vol. 60, no. 1, pp. 63-78, Sept. 2003.
[74] S. Mitchell, J. Bosch, B. Lelieveldt, R. van der Geest, J. Reiber, and M. Sonka, “3-D Active Appearance Models: Segmentation of Cardiac MR and Ultrasound Images,” IEEE Trans. Medical Imaging, vol. 21, pp. 1167-1178, Sept. 2002.
[75] R. Beichel, G. Gotschuli, E. Sorantin, F.W. Leberl, and M. Sonka, “Diaphragm Dome Surface Segmentation in CT Data Sets: A 3D Active Appearance Model Approach,” Proc. SPIE Int'l Symp. Medical Imaging: Image Processing, vol. 4,684, pp. 475-484, May 2002.

Index Terms:
Index Terms- Optimal surface, medical image segmentation, graph algorithms, graph cut, minimum s{\hbox{-}} t cut, geometric constraint.
Citation:
Kang Li, Xiaodong Wu, Danny Z. Chen, Milan Sonka, "Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 1, pp. 119-134, Jan. 2006, doi:10.1109/TPAMI.2006.19
Usage of this product signifies your acceptance of the Terms of Use.