期刊文献+

基于快速连通域分析的目标特征提取算法 被引量:12

Fast algorithm for target feature extraction based on connected component analysis
下载PDF
导出
摘要 基于子区域思想,提出了一种快速的连通域分析方法用于提取视频目标特征。算法只需对图像进行一遍扫描,就可以用一棵多叉树描述出连通域各子区域之间的等价关系,同时由多叉树支节点向根节点完成目标特征提取并将特征保存在多叉树的根节点中。算法占用内存小,具有很高的运行效率。 Based on the idea of sub-region,a fast algorithm for Connected Component Analysis(CCA) is proposed to extract features of video targets.Through scanning an image for only one time,the algorithm can describe the equivalences between sub-regions belonging to the same connected component with a muhi-tree.And at the same time,features of a target are extracted from leaf nodes to the root node and stored in the root node.It can be demonstrated that the proposed algorithm shows low space and high efficiency by analysis and experimentation.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第29期230-232,244,共4页 Computer Engineering and Applications
关键词 行程 子区域 特征提取 连通域分析 run-length sub-region feature extraction connected component analysis
  • 相关文献

参考文献9

  • 1孔斌.快速连通域分析算法及其实现[J].模式识别与人工智能,2003,16(1):110-115. 被引量:33
  • 2He Lifeng,Chao Yuyan,Suzuki Kenji.A run-based two--scan labeling algorithm[J].IEEE Transactions on Image Processing,2008,17(5).
  • 3Khanna V,Gupta P,Hwang C J.Maintenance of connected components in quadtree-based image representation [C]//International Conference on Information Technology,Coding and Computing, 2001 : 647-651.
  • 4Samet H.Connected component labeling using quadtrees[J].J ACM, 1981,28(3 ) :487-501.
  • 5Stefano D,Bulgarelli A.A simple and efficient connected components labeling algorithm[C]//International Conference on Image Analysis and Processing, 1999:27-29.
  • 6Gonzales R,Woods R.Digital image processing[M].[S.l.]:Addison Wesley, 1992: 42-45.
  • 7Klette R,Zamperoni P.Hand book of image processing operators[M]. New York:John Wiley & Sons,1996:314-319.
  • 8张桂林,陈益新,曹伟,李强.基于跑长码的连通区域标记算法[J].华中理工大学学报,1994,22(5):11-14. 被引量:27
  • 9Castleman K R.数字图像处理[M].朱志刚,译.北京:电子工业出版社,2006.

二级参考文献15

  • 1周冠雄,计算机学报,1986年,9卷,6期,441页
  • 2Rosenfeld A,KaK A C,著;李叔梁,等译.数字图像处理.北京:科学出版社,1983
  • 3Lumia R, Shapiro L, Zuniga O. A New Connected Components Algorithm for Virtual Memory Computers. Computer Vision, Graphics, and Image Processing, 1983, 22:287-300
  • 4Rosenfeld A, Pfaltz P. Sequential Operations in Digital Picture Processing. Journal of the Association for Computing Machinery,1966, 12:471 - 494
  • 5Haraliek R M. Some Neighborhood Operations. In: Once M, Preston K, Rosenfeld A, eds. Real Time/Parallel Computing Image Analysis, Plenum Press, New York, 1981
  • 6Dinstein I, Yen D W L, Flickner M D. Handling Memory Overflow in Connected Component Labeling Applications. IEEE Trans on Pattern Analysis and Machine Intelligence, 1985, 7 ( 1 ) : 116 - 121
  • 7Han Y J, Wagner R A. An Efficient and Fast Parallel-Connected Component Algorithm. Journal of the Association for Computing Machinery, 1990, 37(3) : 626 - 642
  • 8Yang X D. An Improved Algorithm for Labeling Connected Components of a Binary Image. In: Rosenfeld A, Shapiro L, eds. International Journal of Computer Vision, Graphics, and Image Processing, Special Volume: Progress in Computer Vision and Image Processing, Academic Press, 1992, 555- 569
  • 9Choudhary A, Thakur R. Connected Component Labeling on Coarse Grain Parallel Computers: An Experimental Study. Journal of Parallel and Distributed Computing, 1994, 20( 1 ): 78 -83
  • 10Suzuki K, Horiba I, Sugie N. Fast Connected-Component Labeling through Sequential Local Operations in the Course of Forward Raster Scan Followed by Backward Raster Scan. Trans of Information Processing Society of Japan, 2000, 41 ( 11 ) : 3070 - 3081

共引文献58

同被引文献98

引证文献12

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部