期刊文献+

一种利用方向链码重建二值图象的新方法 被引量:4

A Method for Restoration of Binary Image Based on Chain Coding
在线阅读 下载PDF
导出
摘要 由于实际应用中 ,仅有边缘轮廓信息并不足以准确、有效地描述被检测物体 ,所以如何根据边缘的方向链码来重建二值图象是图象处理应用中的一类常见问题 .人们已经研究过许多不同的方法 ,例如奇偶检测法、种子法等等 .但这些方法或者由于计算量大 ,或者可能出现判别错误的现象 ,因而不能满足实际需求 .为了准确、快速地解决这一类问题 ,因此在方向链码的基础上 ,先将边缘点按照区域填充法则进行分类 ,进而提出了一种依据方向链码和边缘点分类 ,来重建二值图象的新方法 .实践证明 ,该方法可以很好地克服其它算法的缺点 ,并可得到较好的检测效果 ,而且具有准确、快速、计算量小、无漏检等优点 .现已被应用于作者所开发的“电力工业用射线探伤辅助识别系统”中 . Edge extraction is an usual method in the field of image processing. But it's not enough to exactly describe the detected object only using edge information in the practical applications. So how to restore the binary image according to the direction chain codes is an important problem in image processing field. A binary image can be described by using one or several direction chain codes that record the contour of this binary image. Many methods heve been proposed in the literature, but there still exist the drawbacks such as large computation and inaccurate restoration. In this paper, a new and fast method for restoration of binary image is presented to solve the problems, which is based on the sort of edge points and the chain coding of the boundaries. Experimental results show that this method is computationally faster than the previous methods and does not miss any part of the interior. It's a good restoration method, and already has been used in the practical application.
出处 《中国图象图形学报(A辑)》 CSCD 2000年第6期474-478,共5页 Journal of Image and Graphics
基金 国家自然科学基金!( 69672 0 14 ) 国家"九五"重点科技项目
关键词 方向代码 方向链码 图象处理 二值图像重建 Direction code, Chain coding, Filling algorithm, Filling point
  • 相关文献

参考文献8

  • 11,Pavlidis T. Filling algorithms for raster graphics. Comput. Gra-phics Image Process, 1979,(10): 126~141.
  • 22,T Pavlidis. Algorithms for graphic and image processing. Com-puter Science Press, Rockville, MD, 1982.
  • 33,Hitchcock D, Glasbey C A. Binary image restoration at subpixel resolution. Biometrics, 1997,53(3):1040.
  • 44,Su Xiao, Wang Tao, Xing Xiaoliang. Binary image restoration using neural network models. In:Proc 1993 IEEE Reg 10 Conf Comput Commun Control Power Eng (TENCON '93) Part 2 (of 5):906~909.
  • 55,Oikarinen, Jarkko. Using 2- and 2?-dimensional seed filling in view lattice to accelerate volumentric rendering. Computers & Graphics (Pergamon), 1998,22(6):745~757.
  • 66,H Freeman. The encoding of arbitrary geometric configurations. IRE. Trans. Elec. Comput. 1961, EC-10, 260~268.
  • 77,H Freeman. Boundary encoding and processing. In: Picture Processing and Psychopictorics, Lipkin B S, Rosenfeld A eds. New York:Academic Press,1970,241~266.
  • 8李华,朱光喜,朱耀庭.一种基于方向曲线的目标检测方法[J].中国图象图形学报(A辑),1999,4(7):590-594. 被引量:7

二级参考文献2

共引文献6

同被引文献25

  • 1陈优广,张薇,顾国庆.矩形点阵上链码的转换算法[J].小型微型计算机系统,2005,26(12):2190-2193. 被引量:5
  • 2马岩,阿伦.MFLB构成机理及孔穴压缩变化率对其力学性能的影响[J].林业科学,2007,43(6):123-127. 被引量:6
  • 3苏鸿根.三维计算机图形学和OpenGL For Windows编程[M].北京:中国科学院研究生院出版社,1998-2002.
  • 4Pavlidis T.Filling Algorithms for Raster Graphics[J].Computer Graphics Image Process,1979,10(2):126-141.
  • 5Pavlidis T.Algorithms for Graphic and Image Processing[M].Rockville,MD:Computer Science Press,1982.
  • 6Freeman H.On the Encoding of Arbitrary Geometric Configu-ration[J].IRE Trans.on Electronic Computer,1961,10(2):260-268.
  • 7Chang L W,Leu K L.A Fast Algorithm for the Restoration of Images Based on Chain Codes Description and Its Application[C]//Proc.of Computer Vision & Graphic Image Processing Conference.1990:296-307.
  • 8Shih F Y,Wong W T.An Improved Fast Algorithm for the Restoration of Images Based on Chain Codes Description[C]//Proc.of Computer Vision & Graphic Image Processing Conference.1994:348-351.
  • 9Tang G Y.Region Filling with the Use of the Discrete Green Theorem[C]//Proc.of Computer Vision & Graphic Image Processing Conference.1988:297-305.
  • 10Ren M,Yang W,Yang J.A New and Fast Contour-filling Algorithm[J].Pattern Recognition,2005,38(12):2564-2577.

引证文献4

二级引证文献32

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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