A simple corner detection algorithm for laser marking
-
1.
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
-
Corresponding author:
XIE Yuelei, ylxie_guet@126.com
;
-
Received Date:
2014-03-31
Accepted Date:
2014-05-04
-
Abstract
In order to improve corner detection probability and obtain satisfactory marking quality in laser marking systems, a corner detection algorithm based on slope difference was proposed and theoretical analysis and experimental verification were carried out. After calculating the slopes of adjacent points, the corner points were picked up in terms of slopes difference. The simulation results show that the proposed algorithm can achieve accurate corner points with less computation complexity compared with the traditional algorithms. This algorithm can solve inflection point processing problems in the traditional marking systems, save storage space and reduce the computational complexity in the process of extracting image inflection points.
-
-
References
|
[1]
|
KUANG Y, WU Y F, WU B, et al. Extraction and optimization of marking path in laser marking systems[J]. Laser Technology, 2012, 36(1): 131-134(in Chinese). |
|
[2]
|
PENG L Y, WANG X Y, ZHOU J T, et al. Polynomial fitting correction of galvanometer geometric distortion error in laser marking[J]. Laser Technology, 2013, 37(5): 601-604(in Chinese). |
|
[3]
|
ZHOU Y F, ZHAO H F, HUANG Z Q. Laser lithography system and its technological research[J]. Electronic Design Engineering, 2011, 19(2): 126-129(in Chinese). |
|
[4]
|
DIACI J, BRAČUN D, GORIČ A, et al. Rapid and flexible laser marking and engraving of tilted and curved surfaces[J]. Optics and Lasers in Engineering, 2011, 49(2): 195-199. |
|
[5]
|
TANG H B. Laser printer marking quality and marking quality assessment standard research[D]. Chengdu:University of Electronic Science and Technology of China,2012:1-12(in Chinese). |
|
[6]
|
LUO P, WU Y F, YUE S, et al.Polygonal approximating algorithm of digital curves for bitmap laser marking[J].Laser Technology, 2011, 35(3): 372-375(in Chinese). |
|
[7]
|
SUN C B,LI Y K,ZHANG Z H.The preliminary study of image segmentation based on douglas-peucker algorithm[J]. Geomatics & Spatial Information Technology, 2012,35(5):33-35(in Chinese). |
|
[8]
|
SONG X M, CHENG C X, ZHOU C H. An analysis and investigation of algorithms for identifying convexity-concavity of a simple polygon[J]. Remote Sensing for Land & Resources, 2011(3):25-31(in Chinese). |
|
[9]
|
SONG X, CHENG C, ZHOU C, et al. Gestalt-based douglas-peucker algorithm to keep shape similarity and area consistency of polygons[J]. Sensor Letters, 2013, 11(6/7): 6-7. |
|
[10]
|
MA J, XU S, PU Y, et al. A real-time parallel implementation of Douglas-Peucker polyline simplification algorithm on shared memory multi-core processor computers[C]//Computer Application and System Modeling (ICCASM), 2010 International Conference.New York,USA:IEEE, 2010:647-652. |
|
[11]
|
LI S, FANG Y M, XI W F.Rapid compression algorithm based on the No topological vector curve[J]. Science Technology and Engineering, 2011,11(18): 4324-4327(in Chinese). |
|
[12]
|
WANG H X, ZHU X G.Based on the slope change indirect algorithms to extract contour feature points[J].Software Guide,2010,9(11):66-67(in Chinese). |
-
-
Proportional views
-
Map
DownLoad: