Optimization on Algorithm of Labeling Connected Components in Binary Images
An algorithm based on analysis of existing algorithms of labeling connected regions through scanning pixels in binary images is proposed.The algorithm has many advantages such as faster,simpler,and easier to realize than the others, and it has more preponderance in terms of multi-objects labeling and keeping the original edges.The algorithm could label background as objects, and it labels and merges exactly connected subcomponents of objects via the two scans through binary image and matrix of provisional Iabels.lt adopts sequential memory accesses instead of random memory, and runs more rapidly with more less memory than the other algorithm.The algorithm has been improved in according to the following strategy: 1 )reducing the number of neighboring pixels accessed as possible in first passing through the binary image;2) reducing the number of provisional labels accessed in the second passing through matrix of provisional labels;3)reducing the average time of accessing the neighbour of pixel and provisional labels.
binary images connected components scanning pixels labeling
Luo Zhizao Zhuo Yingwu Luo Zhishi
department of electronic engineering in Minjiang University ,Fuzhou 350108 Sanming City Electric Power Bureau 365000
国际会议
厦门
英文
797-804
2010-05-22（万方平台首次上网日期，不代表论文的发表时间）