Skip to main content

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

Abstract

In this paper the notion of hyperconnectivity, which is an extension of connectivity is explored in the lattice theoretical framework. It is shown that a fourth axiom is needed when moving from connections to hyperconnections, in order to define hyperconnected components meaningfully, which is important for the definition of, e.g., viscous levellings. New hyperconnectivity openings, which are the hyperconnected equivalents of connectivity openings are then defined. It then shown that all algebraic openings which are translation and grey-scale invariant can be described as hyperconnected attribute filters. This means that hyperconnectivity lies at the heart of a vast range of morphological filters.

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. Braga-Neto, U., Goutsias, J.: A multiscale approach to connectivity. Comp. Vis. Image Understand 89, 70–107 (2003)

    Article  MATH  Google Scholar 

  2. Crespo, J.: Adjacency stable connected operators and set levelings. Image Vis. Comput. 28(10), 1483–1490 (2010)

    Article  Google Scholar 

  3. Markowsky, G.: Chain-complete posets and directed sets with applications. Algebra Universalis 6, 53–68 (1976), http://dx.doi.org/10.1007/BF02485815

    Article  MathSciNet  MATH  Google Scholar 

  4. Nempont, O., Atif, J., Angelini, E., Bloch, I.: A new fuzzy connectivity measure for fuzzy sets. J. Math. Imag. Vis. 34, 107–136 (2009)

    Article  MATH  Google Scholar 

  5. Ouzounis, G.K., Wilkinson, M.H.F.: Hyperconnected attribute filters based on k-flat zones. IEEE Trans. Pattern Anal. Mach. Intell. 33(2), 224–239 (2011)

    Article  Google Scholar 

  6. Ronse, C., Serra, J.: Geodesy and connectivity in lattices. Fundamenta Informaticae 46(4), 349–395 (2001)

    MathSciNet  MATH  Google Scholar 

  7. Serra, J.: Introduction to morphological filters. In: Serra, J. (ed.) Image Analysis and Mathematical Morphology. Theoretical Advances, vol. II, ch. 5, pp. 101–114. Academic Press, London (1988)

    Google Scholar 

  8. Serra, J.: Connectivity on complete lattices. J. Math. Imag. Vis. 9(3), 231–251 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  9. Serra, J.: Viscous lattices. J. Math. Imag. Vis. 22(2-3), 269–282 (2005)

    Article  MathSciNet  Google Scholar 

  10. 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 

  11. 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 

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

Wilkinson, M.H.F. (2011). Hyperconnections and Openings on Complete Lattices. 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_7

Download citation

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

  • 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