Skip to main content

A Lung Segmentation Method Based on an Improved Convex Hull Algorithm Combined with Non-uniform Rational B-Sample

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13345))

Included in the following conference series:

Abstract

Currently, tuberculosis (TB) remains one of the major threats to people’s health. Specifically, the problem of under-segmentation due to adhesion of pulmonary tuberculosis lesions to the pleura is a thorny problem in image segmentation. In this paper, An effective lung parenchyma patching method is proposed, which is composed of an improved convex hull algorithm with non-uniform rational B-splines. Our method is mainly divided into three parts. First, the temporal image processing method is used to preliminarily segment the lung parenchyma. Then, the lesion area was discriminated based on the convex hull algorithm and discrete point derivative frequency. Finally, the NURBS fitting method is introduced to complete the fitting of the defect contour. According to our experimental results, the completed lesion contour blends naturally with the original lung contour. Compared with some existing algorithms, our method performs better.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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

References

  1. Magnusson, K.E.G., Jaldén, J., Gilbert, P.M., Blau, H.M.: Global linking of cell tracks using the Viterbi algorithm. IEEE Trans. Med. Imaging 34(4), 911–929 (2014)

    Article  Google Scholar 

  2. Pulagam, A.R., Kande, G.B., Ede, V.K.R., Inampudi, R.B.: Automated lung segmentation from HRCT scans with diffuse parenchymal lung diseases. J. Digit. Imaging 29(4), 507–519 (2016)

    Article  Google Scholar 

  3. Shen, S., Bui, A.A.T., Cong, J., Hsu, W.: An automated lung segmentation approach using bidirectional chain codes to improve nodule detection accuracy. Comput. Biol. Med. 57, 139–149 (2015)

    Article  Google Scholar 

  4. Liu, C., Zhao, R., Pang, M.: Lung segmentation based on random forest and multi-scale edge detection. IET Image Process. 13(10), 1745–1754 (2019)

    Article  Google Scholar 

  5. Somasundaram, K., Kalavathi, P.: Medical image binarization using square wave representation. In: Balasubramaniam, P. (ed.) ICLICC 2011. CCIS, vol. 140, pp. 152–158. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19263-0_19

    Chapter  Google Scholar 

  6. Chudasama, D., Patel, T., Joshi, S., Prajapati, G.I.: Image segmentation using morphological operations. Int. J. Comput. Appl. 117(18) (2015)

    Google Scholar 

  7. Weng, M., Liu, Q., Guo, J.: MSER and connected domain analysis based algorithm for container code locating process. In: International Conference on Industrial Informatics-Computing Technology, pp. 83–86 (2017)

    Google Scholar 

  8. Bhargava, N., Trivedi, P., Toshniwal, A., Swarnkar, H.: Iterative region merging and object retrieval method using mean shift segmentation and flood fill algorithm. In: International Conference on Advances in Computing and Communications, pp. 157–160 (2013)

    Google Scholar 

  9. Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Info. Pro. Lett. 1, 132–133 (1972)

    Article  Google Scholar 

  10. Bingol, O.R., Krishnamurthy, A.: NURBS-python: an open-source, object-oriented NURBS modeling framework in python. SoftwareX 9, 85–94 (2019)

    Article  Google Scholar 

  11. Beccari, C.V., Casciola, G.: A Cox-de Boor-type recurrence relation for C1 multi-degree splines. Comput. Aided Geometr. Design 75(10), 17–84 (2019)

    MATH  Google Scholar 

  12. Ronneberger, O., Fischer, P., Brox, T.: U-net: convolutional networks for biomedical image segmentation. In: Navab, N., Hornegger, J., Wells, W.M., Frangi, A.F. (eds.) MICCAI 2015. LNCS, vol. 9351, pp. 234–241. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24574-4_28

    Chapter  Google Scholar 

  13. Li, C., Kao, C.-Y., Gore, J.C., Ding, Z.: Minimization of region-scalable fitting energy for image segmentation. IEEE Trans. Image Process. 17(10), 1940–1949 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

This work was supported by National Natural Science Foundation of China (No. 61876024), and partly by the higher education colleges in Jiangsu province (No. 21KJA510003), and Suzhou municipal science and technology plan project (No. SYG202129), and Natural Science Research Fund for colleges and universities in Jiangsu Province (No. 17KJB510002).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mingli Lu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shi, X., Liu, J., Xu, J., Lu, M. (2022). A Lung Segmentation Method Based on an Improved Convex Hull Algorithm Combined with Non-uniform Rational B-Sample. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2022. Lecture Notes in Computer Science, vol 13345. Springer, Cham. https://doi.org/10.1007/978-3-031-09726-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09726-3_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09725-6

  • Online ISBN: 978-3-031-09726-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics