Honey bee mating optimization algorithm for approximation of digital curves with line segments and circular arcs

  • Authors:
  • Shu-Chien Huang

  • Affiliations:
  • Department of Computer Science, National Pingtung University of Education, Pingtung City, Taiwan

  • Venue:
  • ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.