An efficient run-based connected-component labeling algorithm for three-dimensional binary images

2010 ◽  
Author(s):  
Lifeng He ◽  
Yuyan Chao ◽  
Kenji Suzuki ◽  
Wei Tang ◽  
Zhenghao Shi ◽  
...  
Keyword(s):  
Three Dimensional ◽  
Connected Component ◽  
Binary Images ◽  
Connected Component Labeling ◽  
Labeling Algorithm

LOW-LATENCY CONNECTED COMPONENT LABELING USING AN FPGA

2010 ◽  
Vol 21 (03) ◽  
pp. 405-425 ◽  
Author(s):  
YASUAKI ITO ◽  
KOJI NAKANO
Keyword(s):  
Binary Image ◽  
Connected Components ◽  
Low Latency ◽  
Connected Component ◽  
Binary Images ◽  
Connected Component Labeling ◽  
Labeling Algorithm ◽  
Internal Storage

Connected component labeling is a process that assigns unique labels to the connected components of a binary image. The main contribution of this paper is to present a low-latency hardware connected component labeling algorithm for k-concave binary images designed and implemented in FPGA. Pixels of a binary image are given to the FPGA in raster order, and the resulting labels are also output in the same order. The advantage of our labeling algorithm is low latency and to use a small internal storage of the FPGA. We have implemented our hardware labeling algorithm in an Altera Stratix Family FPGA, and evaluated the performance. The implementation result shows that for a 10-concave binary image of 2048 × 2048, our connected component labeling algorithm runs in approximately 70ms and its latency is approximately 750µs.

scholarly journals A fast and memory-efficient two-pass connected-component labeling algorithm for binary images

2019 ◽  
pp. 1243-1259 ◽  
Author(s):  
BILAL BATAINEH
Keyword(s):  
High Performance ◽  
Individual Component ◽  
Connected Components ◽  
Connected Component ◽  
Huge Amount ◽  
Binary Images ◽  
Connected Component Labeling ◽  
Labeling Algorithm ◽  
Different Types ◽  
Memory Efficient

Connected-component labeling is an important process in image analysis and pattern recognition. It aims to deduct the connected components by giving a unique label value for each individual component. Many algorithms have been proposed, but they still face several problems such as slow execution time, falling in the pipeline, requiring a huge amount of memory with high resolution, being noisy, and giving irregular images. In this work, a fast and memory- efficient connected-component labeling algorithm for binary images is proposed. The proposed algorithm is based on a new run-base tracing method with a new resolving process to find the final equivalent label values. A set of experiments were conducted on different types of binary images. The proposed algorithm showed high performance compared to the other algorithms.

A connected component labeling algorithm for wheat root thinned image

2013 ◽  
Author(s):  
ShaoMin Mu ◽  
XuHeng Zha ◽  
HaiYang Du ◽  
QingBo Hao ◽  
TengTeng Chang
Keyword(s):  
Wheat Root ◽  
Connected Component ◽  
Connected Component Labeling ◽  
Labeling Algorithm

scholarly journals A New Connected-Component Labeling Algorithm

2015 ◽  
Vol E98.D (11) ◽  
pp. 2013-2016 ◽  
Author(s):  
Xiao ZHAO ◽  
Lifeng HE ◽  
Bin YAO ◽  
Yuyan CHAO
Keyword(s):  
Connected Component ◽  
Connected Component Labeling ◽  
Labeling Algorithm
Sign in / Sign up

Export Citation Format

Share Document