DocumentCode
1765034
Title
Connected Filtering Based on Multivalued Component-Trees
Author
Kurtz, Camille ; Naegel, Benoit ; Passat, Nicolas
Author_Institution
Lab. d´Inf. Paris Descartes, Univ. Paris Descartes, Paris, France
Volume
23
Issue
12
fYear
2014
fDate
Dec. 2014
Firstpage
5152
Lastpage
5164
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 anti extensive 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.
Keywords
filtering theory; image reconstruction; mathematical morphology; trees (mathematics); antiextensive filtering scheme; component-graph; connected filtering; filtered image reconstruction; gray-level images; mathematical morphology; multivalued component-trees; multivalued-images; remote sensing images; Context; Filtering; Image edge detection; Image segmentation; Mathematical model; Morphology; Component-graphs; antiextensive filtering; component-trees; connected operators; mathematical morphology; multivalued component-trees; partially ordered sets;
fLanguage
English
Journal_Title
Image Processing, IEEE Transactions on
Publisher
ieee
ISSN
1057-7149
Type
jour
DOI
10.1109/TIP.2014.2362053
Filename
6918496
Link To Document