Skip to main content

An Automatic Method for Aortic Segmentation Based on Level-Set Methods Using Multiple Seed Points

  • Conference paper
  • First Online:
  • 1161 Accesses

Part of the book series: Lecture Notes in Computational Vision and Biomechanics ((LNCVB,volume 27))

Abstract

Thoracic Aortic Aneurysm (TAA) is an enlargement of the aortic lumen at chest level. An accurate assessment of the geometry of the enlarged vessel is crucial when planning vascular interventions. This study developed an automatic method to extract aortic geometry and supra-aortic vessels from computerized tomography (CT) images. The proposed method consists of a fast-marching level-set method for detection of the initial aortic region from multiple seed points automatically selected along the pre-extracted vessel centerline, and a level-set method for extraction of the detailed aortic geometry from the initial aortic region. The automatic method was implemented inside Endosize (Therenva, Rennes), a commercially available software used for planning minimally invasive techniques. The performance of the algorithm was compare with the existing Endosize segmentation method (based on the region growing approach). For this comparison a CT dataset from an open source data file system (Osirix Advanced Imaging in 3D, 2016) was used. Results showed that, whilst the segmentation time increased (956 s for the new method, 0.308 s for the existing one), the new method produced a more accurate aortic segmentation, particularly in the region of supra-aortic branches. Further work to examine the efficacy of the proposed method should include a statistical study of performance across many datasets.

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   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

References

  1. Ziganshin, B.A., Elefteriades, J.A.: Treatment of Thoracic Aortic Aneurysm: role of earlier intervention. Semin. Thorac. Cardiovasc. Surg. 27(2), 135–143 (2015)

    Article  Google Scholar 

  2. Ramlawi, B., Stephen, H.L., Dipan, S.: When to replace the ascending aorta? Methodist DeBakey Cardiovasc. J. 7(3), 39–42 (2011)

    Article  Google Scholar 

  3. Figueroa, C.A., Taylor, C.A., Chiou, A.J., Yeh, V., Zarins, C.K.: Magnitude and direction of pulsatile displacement forces acting on thoracic aortic endografts. J. Endovasc. Ther. 16(3), 350–358 (2009)

    Article  Google Scholar 

  4. Johnson, H.J., McCormick, M,M,, Ibanez, L.: The ITK Software Guide: ITK 4.7. Kitware, Clifton Park (2015)

    Google Scholar 

  5. Avila, L.: The VTK user’s guide: updated for VTK version 5. Kitware, Inc. (2006)

    Google Scholar 

  6. Whitaker, R.T., Xue, X.: Variable-conductance, Level-set Curvature for Image Denoising. In: International Conference on Image Processing, vol. 3, pp. 142–145. IEEE (2001)

    Google Scholar 

  7. Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93(4), 1591–1595 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Deriche, R.: Recursively implementing the Gaussian and its derivatives. Dissertation INRIA (1993)

    Google Scholar 

  9. Prados, E., Camilli, F., Faugeras, O.: A viscosity solution method for shape-from-shading without image boundary data. Math. Model. Numer. Anal. 40(2), 393–412 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12–49 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Nodes, T., Gallagher, N.: Median filters: some modifications and their properties. IEEE Trans. Acoust. Speech Sig. Process. 30(5), 739–746 (1982)

    Article  Google Scholar 

  12. Yang, X., Hee, C.Y., Younggeun, C., Wonsup, L., Baojian, W., Jaedo, Y., Hongpil, H., Ji, H.K., Jisoo, S., Baik, H.C., You, H.: A hybrid semi-automatic method for liver segmentation based on level-set methods using multiple seed points. Comput. Meth. Programs Biomed. 113(1), 69–79 (2014)

    Article  Google Scholar 

  13. Antiga, L., Piccinelli, M., Botti, L., Ene-Iordache, B., Remuzzi, A., Steinman, D.A.: An image-based modeling framework for patient-specific computational hemodynamics. Med. Biol. Eng. Comput. 46(11), 1097–1112 (2008)

    Article  Google Scholar 

Download references

Acknowledgments

This work is funded by the European Commission through the H2020 Marie Sklodowska-Curie European VPH-CaSE Training Network (www.vph-case.eu), GA No. 642612.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Massimiliano Mercuri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Mercuri, M., Narracott, A.J., Hose, D., Göksu, C. (2018). An Automatic Method for Aortic Segmentation Based on Level-Set Methods Using Multiple Seed Points. In: Tavares, J., Natal Jorge, R. (eds) VipIMAGE 2017. ECCOMAS 2017. Lecture Notes in Computational Vision and Biomechanics, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-319-68195-5_95

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-68195-5_95

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-68194-8

  • Online ISBN: 978-3-319-68195-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics