On Making nD Images Well-Composed by a Self-dual Local Interpolation
Natural and synthetic discrete images are generally not well-composed, leading to many topological issues: connectivities in binary images are not equivalent, the Jordan Separation theorem is not true anymore, and so on. Conversely, making images well-composed solves those problems and then gives access to many powerful tools already known in mathematical morphology as the Tree of Shapes which is of our principal interest. In this paper, we present two main results: a characterization of 3D well-composed gray-valued images; and a counter-example showing that no local self-dual interpolation satisfying a classical set of properties makes well-composed images with one subdivision in 3D, as soon as we choose the mean operator to interpolate in 1D. Then, we briefly discuss various constraints that could be interesting to change to make the problem solvable in nD.
KeywordsDigital topology gray-level images well-composed sets well-composed images
- 1.Caselles, V., Monasse, P.: Geometric Description of Images as Topographic Maps. Lecture Notes in Mathematics, vol. 1984. Springer (2009)Google Scholar
- 2.Géraud, T.: Self-duality and discrete topology: Links between the morphological tree of shapes and well-composed gray-level images. Journée du Groupe de Travail de Géométrie Discrète (June 2013), http://jgeodis2013.sciencesconf.org/conference/jgeodis2013/program/JGTGeoDis2013Geraud.pdf
- 6.Latecki, L.J.: Well-composed sets. In: Advances in Imaging and Electron Physics, vol. 112, pp. 95–163. Academic Press (2000)Google Scholar