Cargando…
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-bas...
Autores principales: | Chang, Wan-Yu, Chiu, Chung-Cheng, Yang, Jia-Horng |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4610509/ https://www.ncbi.nlm.nih.gov/pubmed/26393597 http://dx.doi.org/10.3390/s150923763 |
Ejemplares similares
-
Decision Trees for Binary Subword-Closed Languages
por: Moshkov, Mikhail
Publicado: (2023) -
CUDT: A CUDA Based Decision Tree Algorithm
por: Lo, Win-Tsung, et al.
Publicado: (2014) -
Algorithms for Computing the Triplet Quartet Distances for Binary General Trees
por: Sand, Andreas, et al.
Publicado: (2013) -
Empirical Variational Mode Decomposition Based on Binary Tree Algorithm
por: Li, Huipeng, et al.
Publicado: (2022) -
Utilization of Decision Tree Algorithms for Supporting the Prediction of Intensive Care Unit Admission of Myasthenia Gravis: A Machine Learning-Based Approach
por: Chang, Che-Cheng, et al.
Publicado: (2022)