Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
AbstractIn 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-based view and correlates a raster scan to select the necessary pixels generated by a block-based scan mask. We analyze the advantages of a sequential raster scan for the block-based scan mask, and integrate the block-connected relationships using two different procedures with binary decision trees to reduce unnecessary memory access. This greatly simplifies the pixel locations of the block-based scan mask. Furthermore, our algorithm significantly reduces the number of leaf nodes and depth levels required in the binary decision tree. We analyze the labeling performance of the proposed algorithm alongside that of other labeling algorithms using high-resolution images and foreground images. The experimental results from synthetic and real image datasets demonstrate that the proposed algorithm is faster than other methods. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Chang, W.-Y.; Chiu, C.-C.; Yang, J.-H. Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees. Sensors 2015, 15, 23763-23787.
Chang W-Y, Chiu C-C, Yang J-H. Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees. Sensors. 2015; 15(9):23763-23787.Chicago/Turabian Style
Chang, Wan-Yu; Chiu, Chung-Cheng; Yang, Jia-Horng. 2015. "Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees." Sensors 15, no. 9: 23763-23787.