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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Teh, C.H., Chin, R.T.: On the Detection of Dominant Points on Digital Curves. IEEE Transactions on Pattern Analysis and Machine Intelligence 11, 859–872 (1989)
Ray, B.K., Ray, K.S.: Determination of Optimal Polygon from Digital Curve using L1 Norm. Pattern Recognition 26, 505–509 (1993)
Ho, S.Y., Chen, Y.C.: An Efficient Evolutionary Algorithm for Accurate Polygonal Approximation. Pattern Recognition 34, 2305–2317 (2001)
Yin, P.Y.: A New Method for Polygonal Approximation Using Genetic Algorithms. Pattern Recognition Letters 19, 1017–1026 (1998)
Yin, P.Y.: Ant Colony Search Algorithms for Optimal Polygonal Approximation of Plane Curves. Pattern Recognition 36, 1783–1797 (2003)
Wang, J., Kuang, Z., Xu, X., Zhou, Y.: Discrete Particle Swarm Optimization based on Estimation of Distribution for Polygonal Approximation Problems. Expert Systems with Applications 36, 9398–9408 (2009)
Pei, S.C., Horng, J.H.: Optimum Approximation of Digital Planar Curves Using Circular Arcs. Pattern Recognition 29, 383–388 (1996)
Horng, J.H., Li, J.T.: A Dynamic Programming Approach for Fitting Digital Planar Curves with Line Segments and Circular Arcs. Pattern Recognition Letters 22, 183–197 (2001)
Sarkar, B., Singh, L.K., Sarkar, D.: Approximation of Digital Curves with Line Segments and Circular Arcs Using Genetic Algorithms. Pattern Recognition Letters 24, 2585–2595 (2003)
Dorigo, M., Gambardella, L.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Claudio, A.P., Aravena, C.M., Vallejos, J.I., Estevez, P.A., Held, C.M.: Face and Iris Localization Using Templates Designed by Particle Swarm Optimization. Pattern Recognition Letters 31, 857–868 (2010)
Fathian, M., Amiri, B., Maroosi, A.: Application of Honey Bee Mating Optimization Algorithm on Clustering. Applied Mathematics and Computation 190, 1502–1513 (2007)
Amiri, B., Fathian, M.: Integration of Self Organizing Feature Maps and Honey Bee Mating Optimization Algorithm for Market Segmentation. Journal of Theoretical and Applied Information Technology 3, 70–86 (2007)
Horng, M.H.: A Multilevel Image Thresholding Using the Honey Bee Mating Optimization. Applied Mathematics and Computation 215, 3302–3310 (2010)
Afshar, A., Haddad, O.B., Marino, M.A., Adams, B.J.: Honey-Bee Mating Optimization (HBMO) Algorithm for Optimal Reservoir Operation. Journal of the Franklin Institute 344, 452–462 (2007)
Horng, M.H., Liou, R.J., Wu, J.: Parametric Active Contour Model by Using the Honey Bee Mating Optimization. Expert Systems with Applications 37, 7015–7025 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, SC. (2010). Honey Bee Mating Optimization Algorithm for Approximation of Digital Curves with Line Segments and Circular Arcs. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2010. Lecture Notes in Computer Science(), vol 6422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16732-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-16732-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16731-7
Online ISBN: 978-3-642-16732-4
eBook Packages: Computer ScienceComputer Science (R0)