How to Make nD Functions Digitally Well-Composed in a Self-dual Way

  • Nicolas Boutry
  • Thierry Géraud
  • Laurent Najman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9082)


Latecki et al. introduced the notion of 2D and 3D wellcomposed images, i.e., a class of images free from the “connectivities paradox” of digital topology. Unfortunately natural and synthetic images are not a priori well-composed. In this paper we extend the notion of “digital well-composedness” to nD sets, integer-valued functions (graylevel images), and interval-valued maps. We also prove that the digital well-composedness implies the equivalence of connectivities of the level set components in nD. Contrasting with a previous result stating that it is not possible to obtain a discrete nD self-dual digitally well-composed function with a local interpolation, we then propose and prove a selfdual discrete (non-local) interpolation method whose result is always a digitally well-composed function. This method is based on a sub-part of a quasi-linear algorithm that computes the morphological tree of shapes.


Well-composed functions Equivalence of connectivities Cubical grid Digital topology Interpolation Self-duality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Boutry, N., Géraud, T., Najman, L.: On making nD images well-composed by a self-dual local interpolation. In: Barcucci, E., Frosini, A., Rinaldi, S. (eds.) DGCI 2014. LNCS, vol. 8668, pp. 320–331. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  2. 2.
    Boutry, N., Géraud, T., Najman, L.: How to make nD images well-composed without interpolation (March 2015),
  3. 3.
    Evako, A.V., Kopperman, R., Mukhin, Y.V.: Dimensional properties of graphs and digital spaces. Journal of Mathematical Imaging and Vision 6(2-3), 109–119 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Géraud, T., Carlinet, E., Crozet, S.: Self-duality and digital topology: Links between the morphological tree of shapes and well-composed gray-level images. In: Benediktsson, J.A., Chanussot, J., Najman, L., Talbot, H. (eds.) ISMM 2015. LNCS, vol. 9082, Springer, Heidelberg (2015)Google Scholar
  5. 5.
    Géraud, T., Carlinet, E., Crozet, S., Najman, L.: A quasi-linear algorithm to compute the tree of shapes of n-D images. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 98–110. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  6. 6.
    Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B.: 3D well-composed polyhedral complexes. Discrete Applied Mathematics 183, 59–77 (2015)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Kong, T.Y., Rosenfeld, A.: Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing 48(3), 357–393 (1989)CrossRefGoogle Scholar
  8. 8.
    Latecki, L.: 3D well-composed pictures. Graphical Models and Image Processing 59(3), 164–172 (1997)CrossRefGoogle Scholar
  9. 9.
    Latecki, L., Eckhardt, U., Rosenfeld, A.: Well-composed sets. Computer Vision and Image Understanding 61(1), 70–83 (1995)CrossRefGoogle Scholar
  10. 10.
    Latecki, L.J.: Well-Composed Sets. In: Advances in Imaging and Electron Physics, vol. 112, pp. 95–163. Academic Press (2000)Google Scholar
  11. 11.
    Mazo, L., Passat, N., Couprie, M., Ronse, C.: Digital imaging: A unified topological framework. Journal of Mathematical Imaging and Vision 44(1), 19–37 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Najman, L., Géraud, T.: Discrete set-valued continuity and interpolation. In: Hendriks, C.L.L., Borgefors, G., Strand, R. (eds.) ISMM 2013. LNCS, vol. 7883, pp. 37–48. Springer, Heidelberg (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Nicolas Boutry
    • 1
    • 2
  • Thierry Géraud
    • 1
  • Laurent Najman
    • 2
  1. 1.EPITA Research and Development Laboratory (LRDE)ParisFrance
  2. 2.LIGM, Équipe A3SI, ESIEEUniversité Paris-EstParisFrance

Personalised recommendations