期刊文献+

用于位图激光打标的数字曲线多边形逼近算法 被引量:2

Polygonal approximating algorithm of digital curves for bitmap laser marking
下载PDF
导出
摘要 为了弥补激光打标系统中传统的位图打标方式的不足,提出了一种基于位图矢量化技术来实现位图激光打标的方法。该方法首先以数字曲线的形式提取出位图的骨架或边缘特征,然后采用多边形逼近的方法实现数字曲线的矢量化,最后再利用连续打标方式完成矢量化数据的打标输出。重点讨论了其中的数字曲线多边形逼近算法,分别对Freeman链码生成算法,近似数字直线段提取算法,以及多边形逼近算法进行了研究。结果表明,该逼近算法具有良好的逼近效果。该打标方法极大地提高了位图打标的速率和精度。 A bitmap laser marking method based on bltmap vectorizafion was developed to overcome the difficulties of traditional bitmap marking method used in a laser marking system. In this method, the edge or skeleton of the bitmap was extracted in the form of digital curves firstly, then the polygonal approximating method was adopted to vectorize above digital curves, finally the vectorlzed data was engraved by means of continuous marking method. The involved algorithm of polygonal approximation of digital curves, consisting of Freeman chain code generating, approximate digital straight line segments extracting and polygonal approximating, was emphatically discussed. The experimental resuhs show that the approximating algorithm works well. The practical application shows that the precision and the speed of bitmap marking can be largely improved with this marking method.
出处 《激光技术》 CAS CSCD 北大核心 2011年第3期372-375,397,共5页 Laser Technology
关键词 激光技术 位图矢量化 数字曲线 多边形逼近 FREEMAN链码 laser technique bitmap vectorization digital curves polygonal approximation Freeman chain code
  • 相关文献

参考文献12

  • 1GU B. Review-40 years of laser marking-industrial applications [ J ]. Proceedings of SPIE ,2006,6106 : 1-7.
  • 2宁国勤,朱中煜,朱绍文,肖毅.激光打标中图形、图像的处理[J].激光技术,2002,26(4):295-296. 被引量:16
  • 3LACROIX V. Raster-to-vector conversion : problems and tools towards a solution a map segmentation application [ C ]//Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition. Washington D C:IEEE Computer Society, 2009:318-321.
  • 4ZHANG Y Y, JING X J, WANG X Y. An approach to improve the ZS thinning algorithm [ C ]//Proceedings of 2009 IEEE International Conference on Network Infrastructure and Digital Content. Beijing: IEEE IC-NIDC, 2009:750-753 ( in Chinese).
  • 5JIA H J, ZHANG L. One-pixel wide edge detection algorithm based on local accumulative histogram [ J ]. Proceedings of SPIE, 2002, 4875:283-290.
  • 6FREEMAN H. On the encoding of arbitrary geometric configurations [J]. IRE Transactions on Electronic Computers, 1961, 10(2) :260- 268.
  • 7KLETTE R, ROSENFELD A. Digital geometry: geometric methods for digital image analysis [ M]. Amsterdam: Elsevier, MorganKaufmann, 2004 :40-41.
  • 8HASAN H, HARON H, HASHIM S Z. Freeman chain code extraction using differential evolution (DE) and particle swarm optimization (PSO) [ C ]//Proceedings of the 2009 International Conference of Soft Computing and Pattern Recognition. Washington D C:IEEE Computer Society, 2009:77-81.
  • 9ROSENFELD A. Digital straight line segments[ J ]. IEEE Transactions on Computers, 1974,23 ( 12 ) : 1264-1268.
  • 10BHOWMICK P, BHAqq'ACHARYA B B. Fast polygonal approximation of digital curves using relaxed straightness properties [ J ]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007,29(9):1590-1602.

二级参考文献1

共引文献15

同被引文献10

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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