Skip to Main content Skip to Navigation
Conference papers

Introducing the Dahu Pseudo-Distance

Abstract : The minimum barrier (MB) distance is defined as the minimal interval of gray-level values in an image along a path between two points, where the image is considered as a vertex-valued graph. Yet this definition does not fit with the interpretation of an image as an elevation map, i.e. a somehow continuous landscape. In this paper, based on the discrete set-valued continuity setting, we present a new discrete definition for this distance, which is compatible with this interpretation, while being free from digital topology issues. Amazingly, we show that the proposed distance is related to the morphological tree of shapes, which in addition allows for a fast and exact computation of this distance. That contrasts with the classical definition of the MB distance, where its fast computation is only an approximation.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Thierry Géraud Connect in order to contact the contributor
Submitted on : Friday, February 24, 2017 - 4:40:57 PM
Last modification on : Saturday, January 15, 2022 - 3:58:25 AM
Long-term archiving on: : Thursday, May 25, 2017 - 1:47:10 PM


Files produced by the author(s)



Thierry Géraud, yongchao Xu, Edwin Carlinet, Nicolas Boutry. Introducing the Dahu Pseudo-Distance. 13th International Symposium on Mathematical Morphology (ISMM), May 2017, Fontainebleau, France. ⟨10.1007/978-3-319-57240-6_5⟩. ⟨hal-01476258⟩



Record views


Files downloads