Abstract
Curve fitting has many applications in lots of domains. The literature is full of fitting methods which are suitable for specific kinds of problems. In this paper we introduce a more general method to cover more range of problems. Our goal is to fit some cubic Bezier curves to data points of any distribution and order. The curves should be good representatives of the points and be connected and smooth. Theses constraints and the big search space make the fitting process difficult. We use the good capabilities of the coevolutionary algorithms in large problem spaces to fit the curves to the clusters of the data. The data are clustered using hierarchical techniques before the fitting process.
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.
Similar content being viewed by others
References
Renner, G., Ekart, A.: Genetic algorithms in computer aided design. Computer-Aided Design 35, 709–726 (2003)
Yoshimoto, F., Harada, T., Yoshimoto, Y.: Data fitting with a spline using a real-coded genetic algorithm. Computer-Aided Design 35, 751–760 (2003)
Manela, M., Thornhill, N., Campbell, J.: Fitting spline functions to noisy data using a genetic algorithm. In: Proceedings of the Fifth International Conference on Genetic Algorithms, pp. 549–556. Morgan Kaufmann Publishers Inc. (1993)
Markus, A., Renner, G., Vancza, J.: Spline interpolation with genetic algorithms. In: Proceedings of the International Conference on Shape Modeling and Applications, pp. 47–54. IEEE (2002)
Yin, P.: Polygonal approximation using genetic algorithms. Pattern Recognition, 838–838 (1999)
Gulsen, M., Smith, A., Tate, D.: A genetic algorithm approach to curve fitting. International Journal of Production Research 33, 1911–1924 (1995)
Yang, H., Wang, W., Sun, J.: Control point adjustment for B-spline curve approximation. Computer-Aided Design 36, 639–652 (2004)
Wang, H., Kearney, J., Atkinson, K.: Robust and efficient computation of the closest point on a spline curve, pp. 397–406 (2002)
Eiben, A., Smith, J.: Introduction to evolutionary computing. Springer, Heidelberg (2003)
Pei, S.C., Horng, J.H.: Fitting digital curve using circular arcs. Pattern Recognition 28, 107–116 (1995)
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)
Pal, S., Ganguly, P., Biswas, P.: Cubic Bézier approximation of a digitized curve. Pattern Recognition 40, 2730–2741 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afshar, N.A., Soryani, M., Rahmani, A.T. (2011). Curve Fitting Using Coevolutionary Genetic Algorithms. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-27242-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27241-7
Online ISBN: 978-3-642-27242-4
eBook Packages: Computer ScienceComputer Science (R0)