Abstract
We present a fast, interactive method for separating bones that have been collectively segmented from a CT volume. Given user-provided seed points, the method computes the separation as a multi-way cut on a weighted graph constructed from the binary, segmented volume. By properly designing and weighting the graph, we show that the resulting cut can accurately be placed at bone-interfaces using only a small number of seed points even when the data is noisy. The method has been implemented with an interactive graphical interface, and used to separate the 12 human foot bones in 10 CT volumes. The interactive tool produced compatible result with a ground-truth separation, generated by a completely manual labelling procedure, while reducing the human interaction time from a mean of 2.4 hours per volume in manual labelling down to approximately 18 minutes.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Wang, L.I., Greenspan, M., Ellis, R.: Validation of bone segmentation and improved 3-D registration using contour coherency in ct data. IEEE Transactions On Medical Imaging 25(3), 324–334 (2006)
Westin, C.F., Warfield, S.K., Bhalerao, A., Mui, L., Richolt, J.A., Kikinis, R.: Tensor controlled local structure enhancement of ct images for bone segmentation. In: Wells, W.M., Colchester, A.C.F., Delp, S.L. (eds.) MICCAI 1998. LNCS, vol. 1496, pp. 1205–1212. Springer, Heidelberg (1998)
Kang, Y., Engelke, K., Kalender, W.A.: A new accurate and precise 3D segmentation method for skeletal structures in volumetric ct data. IEEE Trans. Med. Imaging 22(5), 586–598 (2003)
Elmooutaouakkil, A., Peyrin, F., Elkafi, J., Laval-Jeantet, A.M.: Segmentation of cancellous bone from high resolution computed tomography images: Influence on trabecular bone measurements. IEEE Trans. Med. Imaging 21(4), 354–362 (2002)
Commean, P.K., Ju, T., Liu, L., Sinacore, D.R., Hastings, M.K., Mueller, M.J.: Tarsal and metatarsal bone mineral density measurement using volumetric quantitative computed tomography. Journal of Digital Imaging (accepted, 2008)
Boykov, Y.Y., Jolly, M.P.: Interactive graph cuts for optimal boundary & region segmentation of objects in n-d images. In: ICCV 2001, p. 105 (2001)
Grady, L., Funka-Lea, G.: Multi-label image segmentation for medical applications based on graph-theoretic electrical potentials. In: ECCV Workshops CVAMIA and MMBIA, pp. 230–245 (2004)
Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics 8, 399–404 (1956)
Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23(4), 864–894 (1994)
Călinescu, G., Karloff, H., Rabani, Y.: An improved approximation algorithm for multiway cut. In: STOC 1998: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 48–52 (1998)
Karger, D.R., Klein, P.N., Stein, C., Thorup, M., Young, N.E.: Rounding algorithms for a geometric embedding relaxation of minimum multiway cut. In: Proceedings, ACM Symposium on Theory of Computing, pp. 668–678 (1999)
Boykov, M.Y., Kolmogorov, M.V.: An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124–1137 (2004)
Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vision Graph. Image Process 48(3), 357–393 (1989)
van Rijsbergen, C.J.: Information Retrieval. Butterworths, London (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, L. et al. (2008). Interactive Separation of Segmented Bones in CT Volumes Using Graph Cut. In: Metaxas, D., Axel, L., Fichtinger, G., Székely, G. (eds) Medical Image Computing and Computer-Assisted Intervention – MICCAI 2008. MICCAI 2008. Lecture Notes in Computer Science, vol 5241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85988-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-85988-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85987-1
Online ISBN: 978-3-540-85988-8
eBook Packages: Computer ScienceComputer Science (R0)