Skip to main content

Surface–Region Context in Optimal Multi-object Graph-Based Segmentation: Robust Delineation of Pulmonary Tumors

  • Conference paper
Information Processing in Medical Imaging (IPMI 2011)

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

Abstract

Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target objects of arbitrary shape mutually interact with terrain-like surfaces, which widely exists in the medical imaging field. The approach incorporates context information used during simultaneous segmentation of multiple objects. The object–surface interaction information is encoded by adding weighted inter-graph arcs to our graph model. A globally optimal solution is achieved by solving a single maximum flow problem in a low-order polynomial time. The performance of the method was evaluated in robust delineation of lung tumors in megavoltage cone-beam CT images in comparison with an expert-defined independent standard. The evaluation showed that our method generated highly accurate tumor segmentations. Compared with the conventional graph-cut method, our new approach provided significantly better results (p < 0.001). The Dice coefficient obtained by the conventional graph-cut approach (0.76±0.10) was improved to 0.84±0.05 when employing our new method for pulmonary tumor segmentation.

This work was supported in part by NSF grants CCF-0830402 and CCF-0844765, and NIH grants R01-EB004640 and K25-CA123112.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Delong, A., Boykov, Y.: Globally optimal segmentation of multi-region objects. In: ICCV (2009)

    Google Scholar 

  2. Han, D., Bayouth, J., Song, Q., Taurani, A., Sonka, M., Buatti, J., Wu, X.: Globally optimal tumor segmentation in PET-CT images: A graph-based co-segmentation method. In: Székely, G., Hahn, H.K. (eds.) IPMI 2011. LNCS, vol. 6801, pp. 245–270. Springer, Heidelberg (2011), (this volume)

    Google Scholar 

  3. Han, D., Wu, X., Sonka, M.: Optimal multiple surfaces searching for video/image resizing - a graph-theoretic approach. In: ICCV (2009)

    Google Scholar 

  4. Li, K., Wu, X., Chen, D.Z., Sonka, M.: Optimal surface segmentation in volumetric images - a graph-theoretic approach. IEEE TPAMI 28(1), 119–134 (2006)

    Article  Google Scholar 

  5. Chen, M., Siochi, R.A.: A clinical feasibility study on respiratory sorted megavoltage cone beam CT. In: International Workshop on Pulmonary Image Analysis (2010)

    Google Scholar 

  6. Chen, M., Siochi, R.A.: Diaphragm motion quantification in megavoltage cone-beam CT projection images. Medical Physics 37, 2312–2320 (2010)

    Article  Google Scholar 

  7. Schaap, M., Neefjes, L., Metz, C., van der Giessen, A., Weustink, A., Mollet, N., Wentzel, J., van Walsum, T., Niessen, W.: Coronary lumen segmentation using graph cuts and robust kernel regression. In: Prince, J.L., Pham, D.L., Myers, K.J. (eds.) IPMI 2009. LNCS, vol. 5636, pp. 528–539. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Morin, O., Gillis, A., Chen, J., Aubin, M., Bucci, M., Roach, M., Pouliot, J.: Megavoltage cone-beam CT: system description and clinical applications. Medical Dosimetry 31(1), 51–61 (2006)

    Article  Google Scholar 

  9. Song, Q., Wu, X., Liu, Y., Haeker, M., Sonka, M.: Simultaneous searching of globally optimal interacting surfaces with shape priors. In: CVPR (2010)

    Google Scholar 

  10. Song, Q., Liu, Y., Liu, Y., Saha, P.K., Sonka, M., Wu, X.: Graph search with appearance and shape information for 3-D prostate and bladder segmentation. In: Jiang, T., Navab, N., Pluim, J.P.W., Viergever, M.A. (eds.) MICCAI 2010. LNCS, vol. 6363, pp. 172–180. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Wu, X., Chen, D.Z.: Optimal net surface problems with applications. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 1029–1042. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Boykov, Y., Funka-Lea, G.: Graph cuts and efficient N-D image segmentation. IJCV 70(2), 109–131 (2006)

    Article  Google Scholar 

  13. Yin, Y., Zhang, X., Williams, R., Wu, X., Anderson, D., Sonka, M.: LOGISMOS - Layered Optimal Graph Image Segmentation of Multiple Objects and Surfaces: Cartilage segmentation in the knee joints. IEEE Trans. Medical Imaging 29(12), 2023 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Song, Q., Chen, M., Bai, J., Sonka, M., Wu, X. (2011). Surface–Region Context in Optimal Multi-object Graph-Based Segmentation: Robust Delineation of Pulmonary Tumors. In: Székely, G., Hahn, H.K. (eds) Information Processing in Medical Imaging. IPMI 2011. Lecture Notes in Computer Science, vol 6801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22092-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22092-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22091-3

  • Online ISBN: 978-3-642-22092-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics