Skip to main content

Abstract

We propose a new class of hyper-connections in order to improve the consistency of hyper-connected filters and to simplify their design. Our idea relies on the principle that the decomposition of an image into h-components must be necessary and sufficient. We propose a set of three equivalent axioms to achieve this goal. We show that an existing h-connection already fulfils these properties and we propose a new h-connection based on flat functions that also fulfils these axioms. Finally we show that this new class brings several new interesting properties that simplify the use of h-connections and guarantee the consistency of h-connected filters as they ensure that: 1) every deletion of image components will effectively modify the filtered image 2) a deleted component can not re-appear in the filtered image.

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. Serra, J.: Connectivity on complete lattices. JMIV 9(3), 231–251 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Braga-Neto, U., Goutsias, J.: A theoretical tour of connectivity in image processing and analysis. JMIV 19(1), 5–31 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Wilkinson, M.H.F.: An axiomatic approach to hyperconnectivity. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 35–46. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Serra, J.: Image Analysis and Mathematical Morphology. Theoretical Advances, vol. II. Academic Press, London (1988)

    Google Scholar 

  5. Ouzounis, G.K.: Generalized Connected Morphological Operators for Robust Shape Extraction. PhD thesis, University of Groningen (2009)

    Google Scholar 

  6. Ouzounis, G.K., Wilkinson, M.: Hyperconnected attribute filters based on k-flat zones. IEEE TPAMI 33(2), 224–239 (2011), doi:10.1109/TPAMI.2010.74

    Article  Google Scholar 

  7. Nempont, O., Atif, J., Angelini, E., Bloch, I.: A new fuzzy connectivity measure for fuzzy sets. JMIV 34(2), 107–136 (2009)

    Article  MATH  Google Scholar 

  8. Wilkinson, M.H.F.: Hyperconnectivity, attribute-space connectivity and path openings: Theoretical relationships. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 47–58. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Perret, B., Lefèvre, S., Collet, C.: Hyperconnections and hierarchical representations for grayscale and multiband image processing. IEEE TIP (submitted, 2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perret, B., Lefèvre, S., Collet, C. (2011). Toward a New Axiomatic for Hyper-Connections. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds) Mathematical Morphology and Its Applications to Image and Signal Processing. ISMM 2011. Lecture Notes in Computer Science, vol 6671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21569-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21569-8_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21568-1

  • Online ISBN: 978-3-642-21569-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics