loading...
Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan
Barcelona, Spain September 03-September 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.90610515th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proportional to the number of pixels in connected components in an image. By comparative evaluations, it has been shown that the efficiency of the proposed algorithm is superior to those of the conventional algorithms.
Citation:
Kenji Suzuki, Isao Horiba, Noboru Sugie, "Fast Connected-Component Labeling Based on Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan," icpr, vol. 2, pp.2434, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 2, 2000
Usage of this product signifies your acceptance of the Terms of Use.