Skip to main content

Spatio-Temporal Segmentation for Radiotherapy Planning

  • Chapter
  • First Online:

Part of the book series: Mathematics in Industry ((TECMI,volume 15))

Summary

This paper presents a segmentation method of 3D time-series images for radiotherapy planning. The aim of this study is to propose some techniques for the segmentation of tumors surrounding or contained in the lungs. The 4D images are produced using a respiration gating procedure and computed tomography. The aim of the segmentation is to follow the tumor movement while the patient is breathing, so that he does not need to hold his respiration during the radiation treatment. The proposed technique is based on mathematical morphology and graph cuts. It uses a 4D watershed algorithm, combined with graph-based techniques to delineate the tumors in the time-series. The differences between different classical spatio-temporal segmentation algorithms will be highlighted, and conclusions on the related trade-offs between speed and precision will be drawn.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allène, C., Audibert, J., Couprie, M., Cousty, J., Keriven, R.: Some links between min-cuts, optimal spanning forests and watersheds. Proceedings 8th International Symposium on Mathematical Morphology, vol. 1, pp. 253–264. (2007)

    Google Scholar 

  2. Beucher, S., Meyer, F.: The morphological approach to segmentation: the watershed transformation. In: Dougherty, E.R. (ed.) Mathematical Morphology in Image Processing, pp. 433–481. (1993)

    Google Scholar 

  3. Boykov, Y., Kolmogorov, V.: Computing geodesics and minimal surfaces via graph cuts. Proceedings of the 9th International Conference on Computer Vision, Nice, France, vol. 1, pp. 26–33. (2003)

    Google Scholar 

  4. Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vis. 22, 61–79 (1997)

    Article  MATH  Google Scholar 

  5. Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput. 23, 864–894 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  6. Stawiaski, J., Decencière, E.: Computing approximate geodesics and minimal surfaces using watershed and graph-cuts. Proceedings of the The 8th International Symposium on Mathematical Morphology, Rio de Janeiro, Brazil, vol. 1, pp. 349–360. (2007)

    Google Scholar 

  7. Stawiaski, J., Decencière, E.: Combining graph-cuts and morphological segmentation. Image Anal. Stereol. 27(1), 39–46 (2008)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean Stawiaski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stawiaski, J., Decencière, E., Bidault, F. (2010). Spatio-Temporal Segmentation for Radiotherapy Planning. In: Fitt, A., Norbury, J., Ockendon, H., Wilson, E. (eds) Progress in Industrial Mathematics at ECMI 2008. Mathematics in Industry(), vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12110-4_31

Download citation

Publish with us

Policies and ethics