2019
DOI: 10.1007/s10851-019-00872-5
|View full text |Cite
|
Sign up to set email alerts
|

Component-Graph Construction

Abstract: Component-trees are classical tree structures for grey-level image modelling. Componentgraphs are defined as a generalization of componenttrees to images taking their values in any (totally or partially) ordered sets. Similarly to component-trees, component-graphs are a lossless image model; then, they can allow for the development of various image processing approaches. However, component-graphs are not trees, but directed acyclic graphs. This makes their construction non-trivial, leading to non-linear time c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…This may open the way to efficient construction strategies compared e.g. to the componenthypertree [29], the component-graph [40] or the braid of partitions [58], the construction of which remains complex and/or costly.…”
Section: Links Between Usual and New Hierarchiesmentioning
confidence: 99%
“…This may open the way to efficient construction strategies compared e.g. to the componenthypertree [29], the component-graph [40] or the braid of partitions [58], the construction of which remains complex and/or costly.…”
Section: Links Between Usual and New Hierarchiesmentioning
confidence: 99%
“…This should open the way to efficient construction strategies, compared, e.g. to the component-hypertree [12], the component-graph [16] or the braid of partitions [29], the construction of which remains complex and/or costly.…”
Section: Links With Other Treesmentioning
confidence: 99%
“…An undirected graph G is set to correspond to this adjacency matrix. According to the adjacency matrix of the undirected graph G, the connected components [16,17] of undirected graph G were obtained after the calculation.…”
Section: Solving the Weighted Average Of The Mean Functional Concentration Ratios Of Enzyme Reactionsmentioning
confidence: 99%