Approximation of a digital curve with line segments and analytic curve-pieces is an important technique in image analysis and pattern recognition. A new approximation approach is presented based on honey bee mating optimization. In this method, given the number of breakpoint, m, find an approximation with m breakpoints in such a manner that when line segments and circular arcs are appropriately fitted between all pairs of adjacent breakpoints, the approximation error is minimized. Experiments have shown promising results and fast convergence of the proposed method. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Huang, S. C. (2010). Honey bee mating optimization algorithm for approximation of digital curves with line segments and circular arcs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6422 LNAI, pp. 183–192). https://doi.org/10.1007/978-3-642-16732-4_20
Mendeley helps you to discover research relevant for your work.