How to Make nD Functions Digitally Well-Composed in a Self-dual Way
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.
KeywordsWell-composed functions Equivalence of connectivities Cubical grid Digital topology Interpolation Self-duality
Unable to display preview. Download preview PDF.
- 2.Boutry, N., Géraud, T., Najman, L.: How to make nD images well-composed without interpolation (March 2015), http://hal.archives-ouvertes.fr/hal-01134166
- 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
- 10.Latecki, L.J.: Well-Composed Sets. In: Advances in Imaging and Electron Physics, vol. 112, pp. 95–163. Academic Press (2000)Google Scholar