Skip to main content

Openings and Closings by Reconstruction Using Propagation Criteria

  • Conference paper
  • First Online:
Book cover Computer Analysis of Images and Patterns (CAIP 2001)

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

Included in the following conference series:

Abstract

In this paper, a class of openings and closings is investigated using the notion of propagation criteria. The main goal in studying these transformations consists in eliminating some inconveniences of the morphological opening (closing) and the opening (closing) by reconstruction. The idea in building these new openings and closings comes from the notions of morphological filters by recontruction and levelings. Morphological filters by reconstruction extract, from an image, the connected components that are marked. The reconstruction process of the input image is achieved using geodesic dilation (or erosion) until stability. However, since thin connections exist, these filters reconstructs too much and sometimes it is impossible to eliminate some undesirable regions. Because of this inconvenience, propagation criteria must be introduced.

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. Meyer, F.: From connected operators to levelings. In: Heijmans, H., Roerdink, J. (eds.): Mathematical Morphology and Its Applications to Image and Signal Processing. Kluwer (1998) 191–198

    Google Scholar 

  2. Serra, J., Salembier, Ph.: Connected operators and pyramids. Proc. SPIE Image Algebra Math. Morphology, San Diego, CA, SPIE, 2030 (1993) 65–76

    Google Scholar 

  3. Crespo, J., Serra, J, Schafer, R.: Theoretical aspects of morphological filters by reconstruction. Signal Process. 47 (1995) 201–225

    Article  Google Scholar 

  4. Serra, J.: Connectivity on Complete Lattices. J. of Mathematical Imaging and Vision 9 (1998) 231–251

    Article  MATH  MathSciNet  Google Scholar 

  5. Vincent, L.: Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Transactions on Image Processing 2 (1993) 176–201

    Article  Google Scholar 

  6. Meyer, F.: Levelings. In: Heijmans, H., Roerdink, J. (eds.): Mathematical Morphology and Its Applications to Image and Signal Processing. Kluwer (1998) 199–206

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Terol-Villalobos, I.R., Vargas-Vázquez, D. (2001). Openings and Closings by Reconstruction Using Propagation Criteria. In: Skarbek, W. (eds) Computer Analysis of Images and Patterns. CAIP 2001. Lecture Notes in Computer Science, vol 2124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44692-3_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-44692-3_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42513-7

  • Online ISBN: 978-3-540-44692-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics