Connected filtering based on multivalued component-trees - Université de Reims Champagne-Ardenne Access content directly
Journal Articles IEEE Transactions on Image Processing Year : 2014

Connected filtering based on multivalued component-trees


In recent papers, a new notion of component-graph was introduced. It extends the classical notion of component-tree initially proposed in mathematical morphology to model the structure of gray-level images. Component-graphs can indeed model the structure of any—gray-level or multivalued—images. We now extend the antiextensive filtering scheme based on component-trees, to make it tractable in the framework of component-graphs. More precisely, we provide solutions for building a component-graph, reducing it based on selection criteria, and reconstructing a filtered image from a reduced component-graph. In this paper, we first consider the cases where component-graphs still have a tree structure; they are then called multivalued component-trees. The relevance and usefulness of such multivalued component-trees are illustrated by applicative examples on hierarchically classified remote sensing images.
Fichier principal
Vignette du fichier
Kurtz_TIP_2014.pdf (1.67 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01694358 , version 1 (01-03-2018)



Camille Kurtz, Benoît Naegel, Nicolas Passat. Connected filtering based on multivalued component-trees. IEEE Transactions on Image Processing, 2014, 23 (12), pp.5152-5164. ⟨10.1109/TIP.2014.2362053⟩. ⟨hal-01694358⟩
213 View
141 Download



Gmail Facebook Twitter LinkedIn More