2010
DOI: 10.1109/tip.2010.2044963
|View full text |Cite
|
Sign up to set email alerts
|

Optimized Block-Based Connected Components Labeling With Decision Trees

Abstract: In this paper, we define a new paradigm for eight-connection labeling, which employs a general approach to improve neighborhood exploration and minimizes the number of memory accesses. First, we exploit and extend the decision table formalism introducing OR-decision tables, in which multiple alternative actions are managed. An automatic procedure to synthesize the optimal decision tree from the decision table is used, providing the most effective conditions evaluation order. Second, we propose a new scanning t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
176
0
1

Year Published

2011
2011
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 155 publications
(181 citation statements)
references
References 25 publications
1
176
0
1
Order By: Relevance
“…The next step is the creation of area kernels, i.e., connected regions of common bathymorphon class. The area kernels are created by applying the connected components labeling algorithm (specifically, the Block Based with Decision Trees algorithm described in [36]) to the seafloor form-classified grid creating a bathy-morphometric map. This step of the algorithm scans the created map with bathymorphon classes, and groups its nodes into components based on node connectivity: all nodes in a connected component share same bathymorphon class and are connected with each other.…”
Section: Area Kernels Based On Landform Classificationmentioning
confidence: 99%
“…The next step is the creation of area kernels, i.e., connected regions of common bathymorphon class. The area kernels are created by applying the connected components labeling algorithm (specifically, the Block Based with Decision Trees algorithm described in [36]) to the seafloor form-classified grid creating a bathy-morphometric map. This step of the algorithm scans the created map with bathymorphon classes, and groups its nodes into components based on node connectivity: all nodes in a connected component share same bathymorphon class and are connected with each other.…”
Section: Area Kernels Based On Landform Classificationmentioning
confidence: 99%
“…Block-based labeling and efficient block processing with decision table were proposed in [2,3]. Block equivalence method based on "scan mask" was proposed [10].…”
Section: Related Workmentioning
confidence: 99%
“…With a focus on natural requirements such as consistency and conservativeness, incremental learning is analyzed both for learning from positive examples and for learning from positive and negative examples. In [19] authors introduced a novel form of decision tables, namely OR-Decision Tables, which allow including the representation of equivalent actions for a single rule. An heuristic to derive a decision tree for such decision tables was given, without guarantees on how good the derived tree was.…”
Section: B Evaluation Criteriamentioning
confidence: 99%