A Region of Interest Labeling Algorithm Using Three Mask Patterns
Labeling is one of the most basic and important processes in image analysis, which is used to identify detached objects by assigning the same number (labels) to all adjacent connected pixels in a binary image. Labeling algorithms have long been studied, and a variety of algorithms have been developed. Two scans method is easy to implement hardware. The two scans method requires memory for 1-D and 2-D tables to perform labeling. In this paper, three masks are used to assign label values to minimize memory usage, and an algorithm to increase computation speed by separating the inputted image into regions of interest and non-interest is proposed. As a result of experiment that is continuous image of 100 frames, Assigned provisional label is that conventional algorithm is 7657,  is 14665 and proposed algorithm is 5710. Processing times is required of conventional algorithm 341.6 ms,  621.328 ms, proposed algorithm 275.18 ms. To verify the performance of the proposed algorithm, an experiment has been performed using a variety of binary images.
KeywordsLabeling algorithm Connected component Component label Connected components Region labeling Object grouping
This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2012-0004551).
- 1.Haralick RM (1981) Some neighborhood operations, in real time/parallel computing image analysis. Plenum, New York, pp 11–35Google Scholar
- 2.Hashizume A et al (1990) An algorithm of automated RBC classification and its evaluation. Biomed Eng 28(1):25–32Google Scholar
- 3.Haralick RM (1981) Some neighborhood operations. In: Real time parallel computing image analysis, vol 1. Plenum Press, New York, pp 11–35Google Scholar
- 5.Haralick RM, Shapiro LG (1992) Computer and robot vision, vol 1. Addison-Wesley, Reading, pp 28–48Google Scholar
- 7.Lumia R (1983) A new three-dimensional connected components algorithm. Comput Vis Graph Image Process 23(2):207–217Google Scholar
- 8.Naoi S (1995) High-speed labeling method using adaptive variable window size for character shape feature. In: Proceedings of IEEE Asian conference on computer vision, vol 1, pp 408–411Google Scholar
- 9.Paralic M (2012) Fast connected component labeling in binary images. In: Telecommunications and signal processing (TSP), pp 706–709Google Scholar