2017
DOI: 10.1007/978-3-319-57240-6_31
|View full text |Cite
|
Sign up to set email alerts
|

Attribute Profiles from Partitioning Trees

Abstract: International audienc

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
1

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3
1

Relationship

6
1

Authors

Journals

citations
Cited by 14 publications
(31 citation statements)
references
References 26 publications
0
30
1
Order By: Relevance
“…multi-and hyperspectral data) is not straightforward. That is why the authors in [21] have recently investigated and proposed to use the partition trees such as α-tree and ω-tree to compute the α-APs, ω-APs, respectively. These profiles have been proved to provide fair performance compared to the standard APs.…”
Section: B Tree Formationmentioning
confidence: 99%
“…multi-and hyperspectral data) is not straightforward. That is why the authors in [21] have recently investigated and proposed to use the partition trees such as α-tree and ω-tree to compute the α-APs, ω-APs, respectively. These profiles have been proved to provide fair performance compared to the standard APs.…”
Section: B Tree Formationmentioning
confidence: 99%
“…original APs), other implementations have been proposed using the tree of shapes [4], [5] (i.e. self-dual APs) or the partition trees (such as αtree and ω-tree to produce α-profiles, ω-profiles, respectively) [6]. In this work, we focus on the standard APs proposed in [2] using min-tree and max-tree.…”
Section: Morphological Attribute Profilesmentioning
confidence: 99%
“…For example, as the standard APs [2] were generated based on a mintree and a max-tree, some of these studies have focused on advanced implementations using other tree structures such as the tree of shapes [4], [5] or the partition trees (binary partition tree, α-tree, ω-tree, etc.) [6]. Other works have proposed to extract the histogram [7] or the first-order statistical features [8], [9] of the local patch around each AP sample for better characterization of textures within high resolution images.…”
Section: Introductionmentioning
confidence: 99%
“…Instead of calculating the APs based on both max-tree and min-tree image representation as in the original work [1], other implementations have been proposed using the inclusion tree (tree of shapes) [4] (i.e. selfdual APs or sd-APs) as well as the partition trees such as α-tree and ω-tree to produce α-APs, ω-APs, respectively [5]. The advantage of these trees is that their self-dual property enables the attribute filtering to simultaneously access and model both dark and bright regions from the image.…”
Section: Aps and Fps On Other Treesmentioning
confidence: 99%
“…The dimension of their APs is therefore reduced by half. Moreover, partition trees offer the possibility to work on multivariate images only using a single tree, which is not trivial by exploiting component or inclusion trees [5]. In this work, those different tree structures are also adopted for the implementation of FPs.…”
Section: Aps and Fps On Other Treesmentioning
confidence: 99%