A Run-Based Two-Scan Labeling Algorithm

We present an efficient run-based two-scan algorithm for labeling connected components in a binary image. Unlike conventional label-equivalence-based algorithms, which resolve label equivalences between provisional labels, our algorithm resolves label equivalences between provisional label sets. At any time, all provisional labels that are assigned to a connected component are combined in a set, and the smallest label is used as the representative label. The corresponding relation of a provisional label and its representative label is recorded in a table. Whenever different connected components are found to be connected, all provisional label sets concerned with these connected components are merged together, and the smallest provisional label is taken as the representative label. When the first scan is finished, all provisional labels that were assigned to each connected component in the given image will have a unique representative label. During the second scan, we need only to replace each provisional label by its representative label. Experimental results on various types of images demonstrate that our algorithm outperforms all conventional labeling algorithms.

[1]  Yoshiaki Shirai,et al.  High-Speed Algorithm for Component Labeling , 1990, Systems and Computers in Japan.

[2]  Julio Martín-Herrero,et al.  Hybrid object labelling in digital images , 2007, Machine Vision and Applications.

[3]  Der-Chyuan Lou,et al.  Parallel Execution of a Connected Component Labeling Operation on a Linear Array Architecture , 2003, J. Inf. Sci. Eng..

[4]  Chun-Jen Chen,et al.  A linear-time component-labeling algorithm using contour tracing technique , 2004, Comput. Vis. Image Underst..

[5]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[6]  Sartaj Sahni,et al.  Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..

[7]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[8]  Seong-Dae Kim,et al.  A new chain-coding algorithm for binary images using run-length codes , 1988, Comput. Vis. Graph. Image Process..

[9]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[10]  Hanan Samet,et al.  Efficient octree conversion by connectivity labeling , 1984, SIGGRAPH.

[11]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[12]  Xue Dong Yang,et al.  Design of fast connected components hardware , 2011, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[13]  Hanan Samet,et al.  Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Christian Ronse,et al.  Book-Review - Connected Components in Binary Images - the Detection Problem , 1984 .

[15]  T. Hattori.  A high-speed pipeline processor for regional labelling based on a new algorithm , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[16]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[17]  N. Otsu.  A threshold selection method from gray level histograms , 1979 .

[18]  Prabir Bhattacharya.  Connected component labeling for binary images on a reconfigurable mesh architecture , 1996, J. Syst. Archit..

[19]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[20]  E. Dubois,et al.  Digital picture processing , 1985, Proceedings of the IEEE.

[21]  Rajeev Thakur,et al.  Connected Component Labeling on Coarse Grain Parallel Computers: An Experimental Study , 1994, J. Parallel Distributed Comput..

[22]  Kesheng Wu,et al.  Optimizing two-pass connected-component labeling algorithms , 2009, Pattern Analysis and Applications.

[23]  Toshiyuki Gotoh,et al.  Component Labeling Algorithm For Video Rate Processing , 1987, Other Conferences.

[24]  Ronald Lumia,et al.  A new three dimensional connected components algorithm , 1982, Comput. Graph. Image Process..

[25]  Shahram Latifi,et al.  An Algorithm with Reduced Operations for Connected Components Detection in ITU-T Group 3/4 Coded Images , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[26]  Sung-Il Chien,et al.  Detecting fingerprint minutiae by run length encoding scheme , 2006, Pattern Recognit..

[27]  R. M. Haralick.  Some Neighborhood Operators , 1981 .

[28]  Viktor K. Prasanna,et al.  Parallel Architectures and Algorithms for Image Component Labeling , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[30]  Qingmao Hu,et al.  Fast connected-component labelling in three-dimensional binary images based on iterative recursion , 2005, Comput. Vis. Image Underst..

[31]  Raj Acharya,et al.  Connected component labeling with linear octree , 1991, Pattern Recognit..

[32]  Toshiyuki Gotoh,et al.  Video-Rate Labeling Processor , 1989, Other Conferences.

[33]  Stephan Olariu,et al.  Fast component labelling and convex hull computation on reconfigurable meshes , 1993, Image Vis. Comput..

[34]  Linda G. Shapiro,et al.  A new connected components algorithm for virtual memory computers , 1983, Comput. Vis. Graph. Image Process..

[35]  Masashi Koga,et al.  A high-speed algorithm for propagation-type labeling based on block sorting of runs in binary images , 1990, [1990] Proceedings. 10th International Conference on Pattern Recognition.

[36]  George Nagy,et al.  DOCUMENT ANALYSIS WITH AN EXPERT SYSTEM , 1986 .

[37]  M. MANOHAR,et al.  Connected component labeling of binary images on a mesh connected massively parallel processor , 1989, Comput. Vis. Graph. Image Process..

[38]  Mahesh Viswanathan,et al.  Two complementary techniques for digitized document analysis , 2000, DOCPROCS '88.

[39]  C. J. Nicol,et al.  A Systolic Approach for Real Time Connected Component Labeling , 1995, Comput. Vis. Image Underst..

[40]  Kesheng Wu,et al.  Fast connected-component labeling , 2009, Pattern Recognit..

[41]  Kenji Suzuki,et al.  Linear-time connected-component labeling based on sequential local operations , 2003, Comput. Vis. Image Underst..

[42]  Hanan Samet,et al.  A general approach to connected-component labeling for arbitrary image representations , 1992, JACM.

[43]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[44]  Hanan Samet,et al.  Computing Geometric Properties of Images Represented by Linear Quadtrees , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[45]  Emanuele Trucco,et al.  Computer and Robot Vision , 1995 .

[46]  RosenfeldAzriel,et al.  Sequential Operations in Digital Picture Processing , 1966 .

[47]  Linda G. Shapiro,et al.  Computer and Robot Vision , 1991 .

[48]  R. Bergevin,et al.  Registering range views of multipart objects , 1995 .