Connected filtering based on multivalued component-trees

Abstract : 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.
Complete list of metadatas

Cited literature [42 references]  Display  Hide  Download

https://hal.univ-reims.fr/hal-01694358
Contributor : Nicolas Passat <>
Submitted on : Thursday, March 1, 2018 - 1:19:49 PM
Last modification on : Thursday, June 27, 2019 - 12:13:00 PM
Long-term archiving on : Wednesday, May 30, 2018 - 1:40:08 PM

File

Kurtz_TIP_2014.pdf
Files produced by the author(s)

Identifiers

Citation

Camille Kurtz, Benoît Naegel, Nicolas Passat. Connected filtering based on multivalued component-trees. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2014, 23 (12), pp.5152-5164. ⟨10.1109/TIP.2014.2362053⟩. ⟨hal-01694358⟩

Share

Metrics

Record views

242

Files downloads

89