Skip to main content

Automatic Extraction of Graph-Like Structures from Binary Images

  • Conference paper
Computer Vision and Graphics (ICCVG 2008)

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

Included in the following conference series:

  • 1181 Accesses

Abstract

The paper describes a method for the analysis of the content of a binary image in order to find its structure. The class of images it deals with consists of images showing a groups of objects connected one to another forming a graph-like structure. Proposed method extracts automatically this structure from image bitmap and produces graph adjacency matrix describing it. The method is based on morphological image processing, skeletonization and labelling.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Iwanowski, M.: Binary Shape Characterization using Morphological Boundary Class Distribution Functions. In: Kurzynski, M., Puchala, E., Wozniak, M., Zolnierek, A. (eds.) Proc. of CORES 2007 Conference, October 22-25, 2007. Computer Recognition Systems 2 – Advances in Soft Computing, vol. 45. Springer, Heidelberg (2007)

    Google Scholar 

  2. Iwanowski, M.: Morphological Boundary Pixel Classification. In: Proc. of IEEE EUROCON Conference, Warsaw, pp. 146–150 (2007)

    Google Scholar 

  3. Soille, P.: Morphological image analysis. Springer, Heidelberg (1999) (2004)

    Book  MATH  Google Scholar 

  4. Vincent, L.: Morphological grayscale reconstruction in image analysis: applications and efficient algorithms. IEEE Trans. on Image Processing 2(2) (April 1993)

    Google Scholar 

  5. Serra, J., Vincent, L.: An overview of morphological filtering. Circuit systems Signal Processing 11(1) (1992)

    Google Scholar 

  6. Vincent, L.: Efficient computation of various types of skeletons. In: Loew, M. (ed.) Medical Imaging V: Image Processing. SPIE, vol. 1445, pp. 297–311 (1991)

    Google Scholar 

  7. Vincent, L.: Exact Euclidean distance function by chain propagations. In: Proc. IEEE Computer Vision and Pattern Recognition, pp. 520–525 (1991)

    Google Scholar 

  8. Kong, T., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing 48, 357–393 (1989)

    Article  Google Scholar 

  9. Serra, J.: Image analysis and mathematical morphology, vol. 1. Academic Press, London (1983)

    Google Scholar 

  10. Rosenfeld, A.: Connectivity in digital pictures. Journal of the ACM 17(1), 146–160 (1970)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwanowski, M. (2009). Automatic Extraction of Graph-Like Structures from Binary Images. In: Bolc, L., Kulikowski, J.L., Wojciechowski, K. (eds) Computer Vision and Graphics. ICCVG 2008. Lecture Notes in Computer Science, vol 5337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02345-3_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02345-3_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02344-6

  • Online ISBN: 978-3-642-02345-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics