期刊文献+

基于间隙边缘链码的矩快速算法

A FAST ALGORITHM FOR MOMENT COMPUTATION IN BINARY IMAGE BASED ON GAP EDGE CHAIN-CODE REPRESENTATION
原文传递
导出
摘要 本文提出了一种新的基于间隙边缘链码的二值图像矩的快速算法.文中定义了一种新的边缘链码—间隙边缘链码,基于此链码提出了二值图像的矩快速算法,同时引入了查表技术以加速矩的计算.此算法实时性好、计算结果精确、简单易懂,便于应用在实时性要求较高的系统中。 A fast algorithm of moment computing for image procesing is proposed in this paper, which is based on the representation of edge image using the chain code. A kind of new chain code-the gap edge chain code-is defined for representing a binary image firstly, and then a fast algorithm for the moment computation is proposed which is based on the new definition. Moreover, table technique is introduced for reducing the computing complexity. The new algorithm has some good features such as low time complexity, precise result, simply and easy to understand. It is particularly suitable for the real time vision system.
出处 《模式识别与人工智能》 EI CSCD 北大核心 1997年第3期206-212,共7页 Pattern Recognition and Artificial Intelligence
关键词 图像处理 快速算法 边缘链码 Image Processing, Moment Computation, Green's Theory, Dalta Method, Past Algorithm
  • 相关文献

参考文献2

  • 1Dai M,Pattern Recognit,1992年,25卷,10期,1119页
  • 2Li B C,Proc 7th Scandinavian Conf on Image Analysis,1991年

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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