On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new method for polygonal approximation using genetic algorithms
Pattern Recognition Letters
Pattern Recognition Letters
Approximation of digital curves with line segments and circular arcs using genetic algorithms
Pattern Recognition Letters
Expert Systems with Applications: An International Journal
Face and iris localization using templates designed by particle swarm optimization
Pattern Recognition Letters
Parametric active contour model by using the honey bee mating optimization
Expert Systems with Applications: An International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
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.