Connected Component Labeling Algorithm Based on Max-tree
基于Maxtree的连通区域标记新算法*

Based on the theory of Max-tree,a new connected component labeling algorithm is proposed in this paper.The proposed algorithm can label the connected components by scanning the binary image on time.By improving the traditional algorithm of 8-Neighbor Searching,the average Neighbor Searching times can be reduced from eight to four.An efficient implementation of ordered queue is also introduced in this paper.The experiments on diatom images identification have been done to test the performance of the proposed algorithm,which show that the new algorithm has better performance than the traditio-(nal) ones.