Skip to main content

Line Segment Based Watershed Segmentation

  • Conference paper
Computer Vision/Computer Graphics Collaboration Techniques (MIRAGE 2007)

Abstract

In this paper we present an overview of our novel line segment based watershed segmentation algorithm. Most of the existing watershed algorithms use the region label image as the main data structure for its ease of use. These type of watershed algorithms have a relatively large memory footprint and need unbounded memory access. For our new watershed algorithm we replaced the traditional region label image with a data structure that stores the regions in linked line segments. Consequently, the new algorithm has a much smaller memory footprint. Using the new data structure also makes it possible to create an efficient algorithm that only needs one scan over the input image and that only needs the last 3 lines and a small part of the data structure in memory.

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. Vincent, L., Soille, P.: Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13(6), 583–598 (1991)

    Article  Google Scholar 

  2. Beucher, S.: Segmentation d’images et morphologie mathématique. PhD thesis, School of Mines (1990)

    Google Scholar 

  3. De Smet, P., Pires, R.: Implementation and analysis of an optimized rainfalling watershed algorithm. In: Proc. Electronic Imaging, Science and Technology, Image and Video Communications and Processing, pp. 759–766 (2000)

    Google Scholar 

  4. De Bock, J., De Smet, P., Philips, W.: A fast sequential rainfalling watershed segmentation algorithm. In: Blanc-Talon, J., et al. (eds.) ACIVS 2005. LNCS, vol. 3708, pp. 477–484. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Philips, W.: Weakly separable segmented image coding: Theory, results and implementation aspects. Technical report, ELIS (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

André Gagalowicz Wilfried Philips

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

De Bock, J., Philips, W. (2007). Line Segment Based Watershed Segmentation. In: Gagalowicz, A., Philips, W. (eds) Computer Vision/Computer Graphics Collaboration Techniques. MIRAGE 2007. Lecture Notes in Computer Science, vol 4418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71457-6_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71457-6_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71456-9

  • Online ISBN: 978-3-540-71457-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics