快速连通域分析算法及其实现

被引:31
作者
孔斌
机构
[1] 中国科学技术大学自动化系
关键词
连通域分析; 连通域标记; 行程; 链式等价机制; 指针;
D O I
暂无
中图分类号
TP391.41 [];
学科分类号
080203 ;
摘要
本文提出一种快速连通域分析算法,它对像素的行程进行操作,并将标号作为行程及连通域的特征之一,特征通过数据结构的指针与行程及连通域相联系。该算法运用了两个关键技术,一是设计了一种链式机制来表示和实现标号的等价关系,二是通过指针的传递来实现标号及其它特征的向下传递和逆向传播,特征在标号过程中动态修改。这样甚至能实现仅对图像一遍扫描便能完成连通域标记和常用特征量的计算。实验表明了本文算法的有效性。
引用
收藏
页码:110 / 115
页数:6
相关论文
共 14 条
[1]  
A new connected components algorithm for virtual memory computers. R Lumia,L Shapiro,O Zuniga. Computer Vision . 1983
[2]  
A Comparison of Parallel Algorithms for Connected Components. Greiner J. Proc of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures . 1994
[3]  
Some neighborhood operations. Haralick,R.H.,Onoe,M.,Preston,K.,Rosenfeld,A. Real Time/Parallel Computing Image Analysis . 1981
[4]  
An Efficient and Fast ParallelConnected Component Algorithm. Han YJ,Wagner R A. Journal of the Association forComputing Machinery . 1990
[5]  
An Improved Algorithm for Labeling Connected Components in a Binary Image. Yang,X.D. . 1989
[6]  
Evaluation of Connected Component Labeling Algorithms on Shared and Distributed Memory Multiprocessors. Choudhary A,Thakur R. Proc of the 6th International Parallel Processing Symposium . 1992
[7]  
Connected Components with Split and Merge. Kistler J J,Webb J A. Proc of the 5th International Parallel Processing Symposium . 1991
[8]  
Handling Memory Overflow in Connected Component Labeling Applications. Dinstein I,Yen D W L,Flickner M D. IEEE Transactions on Pattern Analysis and Machine Intelligence . 1985
[9]  
Connected componentlabeling on coarse grain parallel computers:an experi-mental study. CHOUDHARY A,THAKUR R. Journal of Parallel and DistributedComputing . 1994
[10]  
Fast Connected-component Labeling through Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan. K.Suzuki,I.zoriba,N.Sugie. Trans of information Processing Society of Japan . 2000