Skip to main content

Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images

  • Conference paper
Mathematical Morphology and Its Application to Signal and Image Processing (ISMM 2009)

Abstract

We present a programming framework for discrete mathematical morphology centered on the concept of genericity. We show that formal definitions of morphological algorithms can be translated into actual code, usable on virtually any kind of compatible images, provided a general definition of the concept of image is given. This work is implemented in Milena, a generic, efficient, and user-friendly image processing library.

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. Garcia, R., Järvi, J., Lumsdaine, A., Siek, J., Willcock, J.: A comparative study of language support for generic programming. In: Proc. of OOPSLA, pp. 115–134 (2003)

    Google Scholar 

  2. Cgal: Computational Geometry Algorithms Library (2008), www.cgal.org

  3. Siek, J.G., Lee, L.Q., Lumsdaine, A.: The Boost Graph Library: User Guide and Reference Manual, 1st edn. Addison Wesley Professional, Reading (2001)

    Google Scholar 

  4. Yoo, T.S. (ed.): Insight into Images: Principles and Practice for Segmentation, Registration, and Image Analysis. AK Peters Ltd. (2004)

    Google Scholar 

  5. Köthe, U.: STL-style generic programming with images. C++ Report Magazine 12(1), 24–30 (2000)

    Google Scholar 

  6. Enficiaud, R.: Algorithmes multidimensionnels et multispectraux en Morphologie Mathématique: approche par méta-programmation. PhD thesis, CMM, ENSMP, Paris, France (February 2007)

    Google Scholar 

  7. Vincent, L.: Graphs and mathematical morphology. Signal Processing 16(4), 365–388 (1989)

    Article  MathSciNet  Google Scholar 

  8. Heijmans, H., Vincent, L.: Graph morphology in image analysis. In: Dougherty, E. (ed.) Mathematical Morphology in Image Processing, pp. 171–203. M. Dekker, New York (1992)

    Google Scholar 

  9. Meyer, F., Angulo, J.: Micro-viscous morphological operators. In: Proc. of ISMM, pp. 165–176 (2007)

    Google Scholar 

  10. Cousty, J., Najman, L., Serra, J.: Some morphological operators in graph spaces. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds.) ISMM 2009. LNCS, vol. 5720, pp. 149–160. Springer, Heidelberg (2009)

    Google Scholar 

  11. Bertrand, G., Couprie, M., Cousty, J., Najman, L.: Ligne de partage des eaux dans les espaces discrets. In: Najman, L., Talbot, H. (eds.) Morphologie mathématique: approches déterministes, pp. 123–149. Hermes Sciences (2008)

    Google Scholar 

  12. Loménie, N., Stamon, G.: Morphological mesh filtering and α-objects. Pattern Recognition Letters 29(10), 1571–1579 (2008)

    Article  Google Scholar 

  13. Köthe, U.: Generic programming techniques that make planar cell complexes easy to use. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 17–37. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Kettner, L.: Designing a data structure for polyhedral surfaces. In: Proc. of SCG, pp. 146–154. ACM, New York (1998)

    Google Scholar 

  15. Berti, G.: GrAL: the grid algorithms library. FGCS 22(1), 110–122 (2006)

    Article  MATH  Google Scholar 

  16. Edmonds, J.: A combinatorial representation for polyhedral surfaces. Notices of the American Mathematical Society 7 (1960)

    Google Scholar 

  17. Bertrand, G., Couprie, M.: A model for digital topology. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 229–241. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. d’Ornellas, M.C., van den Boomgaard, R.: The state of art and future development of morphological software towards generic algorithms. International Journal of Pattern Recognition and Artificial Intelligence 17(2), 231–255 (2003)

    Article  Google Scholar 

  19. LRDE: The Olena image processing library (2009), http://olena.lrde.epita.fr

  20. Darbon, J., Géraud, T., Duret-Lutz, A.: Generic implementation of morphological image operators. In: Proc. of ISMM, Sydney, Australia, CSIRO, pp. 175–184 (2002)

    Google Scholar 

  21. Géraud, T., Levillain, R.: A sequel to the static C++ object-oriented programming paradigm (SCOOP 2). In: Proc. of MPOOL, Paphos, Cyprus (July 2008)

    Google Scholar 

  22. Goutsias, J., Heijmans, H.J.A.M.: Fundamenta morphologicae mathematicae. Fundamenta Informaticae 41(1-2), 1–31 (2000)

    MathSciNet  MATH  Google Scholar 

  23. Köthe, U.: Reusable software in computer vision. In: Jähne, B., Haussecker, H., Geißler, P. (eds.) Handbook of Computer Vision and Applications. Systems and Applications, vol. 3, pp. 103–132. Academic Press, San Diego (1999)

    Google Scholar 

  24. Alcoverro, M., Philipp-Foliguet, S., Jordan, M., Najman, L., Cousty, J.: Region-based 3D artwork indexing and classification. In: 3DTV, pp. 393–396 (2008)

    Google Scholar 

  25. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: Watershed cuts: minimum spanning forests and the drop of water principle. IEEE PAMI (to appear, 2009)

    Google Scholar 

  26. Meyer, F.: Un algorithme optimal de ligne de partage des eaux. In: Actes du 8e Congrès AFCET, Lyon-Villeurbanne, France, AFCET, pp. 847–857 (1991)

    Google Scholar 

  27. Cousty, J., Bertrand, G., Najman, L., Couprie, M.: On watershed cuts and thinnings. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol. 4992, pp. 434–445. Springer, Heidelberg (2008)

    Chapter  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

Levillain, R., Géraud, T., Najman, L. (2009). Milena: Write Generic Morphological Algorithms Once, Run on Many Kinds of Images. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds) Mathematical Morphology and Its Application to Signal and Image Processing. ISMM 2009. Lecture Notes in Computer Science, vol 5720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03613-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03613-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03612-5

  • Online ISBN: 978-3-642-03613-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics