Skip to main content

Liver Segmentation in CT Images for Intervention Using a Graph-Cut Based Model

  • Conference paper
Book cover Abdominal Imaging. Computational and Clinical Applications (ABD-MICCAI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 7029))

Abstract

Liver segmentation in computerized tomography (CT) images has been widely studied in recent years, of which the graph cut models demonstrate a great potential with the advantage of global optima and practical efficiency. In this paper, a graph-cut based model for liver CT segmentation is presented. The image is interpreted as a graph, that the segmentation problem is then casted as an optimal cut on the graph. An energy function is then formulated for minimization, which combines both regional properties and boundary smoothness. The prior knowledge on liver is unified into the energy function via fuzzy similarity measure. Finally, the optimal cut can be computed through the max-flow algorithm. Experiments on a variety of CT images show its effectiveness and efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Casiraghi, E., Lombardi, G., Pratissoli, S., Rizzi, S.: 3D α-Expansion and Graph Cut Algorithms for Automatic Liver Segmentation from CT Images. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol. 4692, pp. 421–428. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Heimann, T., van Ginneken, B., Styner, M., et al.: Comparison and Evaluation of Methods for Liver Segmentation from CT Datasets. IEEE Trans. Med. Imaging 28, 1251–1265 (2009)

    Article  Google Scholar 

  3. Esneault, S., Hraiech, N., Delabrousse, E., Dillenseger, J.L.: Graph Cut Liver Segmentation for Interstitial Ultrasound Therapy. In: IEEE Conference on Engineering in Medicine and Biology Society, pp. 5247–5250. IEEE Press, Lyon (2007)

    Google Scholar 

  4. Massoptier, L., Casciaro, S.: Fully Automatic Liver Segmentation through Graph-Cut Technique. In: IEEE Conference on Engineering in Medicine and Biology Society, pp. 5243–5246. IEEE Press, Lyon (2007)

    Google Scholar 

  5. Zhang, X., Tian, J., Deng, K., Wu, Y., Li, X.: Automatic Liver Segmentation Using a Statistical Shape Model with Optimal Surface Detection. IEEE Trans. Biomed. Eng. 57, 2622–2626 (2010)

    Article  Google Scholar 

  6. Campadelli, P., Casiraghi, E., Esposito, A.: Liver Segmentation from Computed Tomography Scans: a Survey and a New Algorithm. Artificial Intelligence in Medicine 45, 185–196 (2009)

    Article  Google Scholar 

  7. Delong, A., Osokin, A., Isack, H.N., Boykov, Y.: Fast Approximate Energy Minimization with Label Costs. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE Press, San Francisco (2010)

    Google Scholar 

  8. Chen, Y., Zhao, W., Wang, Z.: Level Set Segmentation Algorithm Based on Image Entropy and Simulated Annealing. In: International Conference on Bioinformatics and Biomedical Engineering, pp. 999–1003. IEEE Press, Wuhan (2007)

    Chapter  Google Scholar 

  9. Stawiaski, J., Decenciere, E., Bidault, F.: Interactive Liver Tumor Segmentation Using Graph-cuts and Watershed. The MIDAS Journal - Grand Challenge Liver Tumor Segmentation, MICCAI Workshop (2008), http://hdl.handle.net/10380/1416

  10. Boykov, Y., Kolmogorov, V.: Computing Geodesics and Minimal Surfaces via Graph Cuts. In: IEEE International Conference on Computer Vision, pp. 26–33. IEEE Press, Nice (2003)

    Chapter  Google Scholar 

  11. Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 1124–1137 (2004)

    Article  Google Scholar 

  12. Xu, N., Ahuja, N., Bansal, R.: Object Segmentation Using Graph Cuts Based Active Contours. Computer Vision and Image Understanding 107, 210–224 (2007)

    Article  Google Scholar 

  13. Chittajallu, D.R., Brunner, G., Kurkure, U., Yalamanchili, R.P., Kakadiaris, I.A.: Fuzzy-cuts: A Knowledge-Driven Graph-Bases Method for Medical Image Segmentation. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 715–722. IEEE Press, Miami (2009)

    Chapter  Google Scholar 

  14. Boykov, Y., Funka-Lea, G.: Graph Cuts and Efficient N-D Image Segmentation. International Journal of Computer Vision 70, 109–131 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Zhao, W., Wu, Q., Wang, Z., Hu, J. (2012). Liver Segmentation in CT Images for Intervention Using a Graph-Cut Based Model. In: Yoshida, H., Sakas, G., Linguraru, M.G. (eds) Abdominal Imaging. Computational and Clinical Applications. ABD-MICCAI 2011. Lecture Notes in Computer Science, vol 7029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28557-8_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28557-8_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28556-1

  • Online ISBN: 978-3-642-28557-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics