Polygonal approximating algorithm of digital curves for bitmap laser marking
-
1.
School of Optoelectronic Information, University of Electronic Science and Technology of China, Chengdu 610054, China;
-
2.
Chengdu Interlock Technology Co.Ltd., Chengdu 610051, China
-
Corresponding author:
WU Yun-feng, yfwu-72@163.com
;
-
Received Date:
2010-06-07
Accepted Date:
2010-06-30
-
Abstract
A bitmap laser marking method based on bitmap vectorization 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 vectorized 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 results 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.
-
-
References
|
[1]
|
GU B.Review-40 years of laser marking-industrial applications[J].Proceedings of SPIE,2006,6106:1-7. |
|
[2]
|
NING G Q,ZHU Zh Y.Figure and image processing in laser marking[J].Laser Technology,2002,26(4):295-297(in Chinese). |
|
[3]
|
LACROIX 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. |
|
[4]
|
ZHANG 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). |
|
[5]
|
JIA H J,ZHANG L.One-pixel wide edge detection algorithm based on local accumulative histogram[J].Proceedings of SPIE,2002,4875:283-290. |
|
[6]
|
FREEMAN H.On the encoding of arbitrary geometric configurations[J].IRE Transactions on Electronic Computers,1961,10(2):260-268. |
|
[7]
|
KLETTE R,ROSENFELD A.Digital geometry:geometric methods for digital image analysis[M].Amsterdam:Elsevier,MorganKaufmann,2004:40-41. |
|
[8]
|
HASAN 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 Computers and Pattern Recognition.Washinggton D C:IEEE Computer Society,2009:77-81 |
|
[9]
|
ROSENFELD A.Digital straight line segments[J].IEEE Transactions on Computers,1974,23(12):1264-1268. |
|
[10]
|
BHOWMICK P,BHATTACHARYA 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. |
|
[11]
|
ROSIN P L.Techniques for assessing polygonal approximation of curves[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1997,19(6):659-666. |
|
[12]
|
WALL K,DANIELSSON P E.A fast sequential method for polygonal approximation of digitized curves[J].Computer Vision,Graphics,and Image Processing,1984,28(3):220-227. |
-
-
Proportional views
-
Map
DownLoad: