Characterizing Images by the Gromov-Hausdorff Distances Between Derived Hierarchies

Abstract : A hierarchy is a series of nested partitions in which a coarser partition results from merging regions of finer ones. Each hierarchy derived from an image provides a particular structural description of the image content, depending upon the criteria for merging neighboring regions. Distinct hierarchies derived from a same image reflect its various facets and the distances between them nicely characterize its content. In this paper the hierarchies are constructed with the versatile stochastic watershed algorithm and their inter-distances are measured with the Gromov-Hausdorff distance. Experiments conducted on images simulated by dead leaves model illustrate the advantages of our approach in terms of learning efficiency and under-standability of the results.
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download
Contributor : Amin Fehri <>
Submitted on : Wednesday, January 9, 2019 - 12:29:59 PM
Last modification on : Wednesday, February 13, 2019 - 3:57:32 PM


  • HAL Id : hal-01823866, version 1


Amin Fehri, Santiago Velasco-Forero, Fernand Meyer. Characterizing Images by the Gromov-Hausdorff Distances Between Derived Hierarchies. International Conference on Image Processing (ICIP), Oct 2018, Athens, Greece. ⟨hal-01823866⟩



Record views


Files downloads