Multiobjective Local Search Techniques for Evolutionary Polygonal Approximation
Polygonal approximation is based on the division of a closed curve into a set of segments. This problem has been traditionally approached as a single-objective optimization issue where the representation error was minimized according to a set of restrictions and parameters. When these approaches try to be subsumed into more recent multi-objective ones, a number of issues arise. Current work successfully adapts two of these traditional approaches and introduces them as initialization procedures for a MOEA approach to polygonal approximation, being the results, both for initial and final fronts, analyzed according to their statistical significance over a set of traditional curves from the domain.
Unable to display preview. Download preview PDF.
- 1.Coello, C., Lamont, G., Van Veldhuizen, D.: Evolutionary algorithms for solving multi-objective problems. Springer-Verlag New York Inc. (2007)Google Scholar
- 2.Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley (1973)Google Scholar
- 3.Guerrero, J., Berlanga, A., Molina, J.: Fitness-aware operators for evolutionary polygonal approximation. In: Applied Computing, pp. 283–290. IADIS (2012)Google Scholar
- 4.Guerrero, J.L., Berlanga, A., Molina, J.M.: Initialization procedures for multiobjective evolutionary approaches to the segmentation issue. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, S.-B. (eds.) HAIS 2012, Part III. LNCS, vol. 7208, pp. 452–463. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 6.Heckbert, P., Garland, M.: Survey of polygonal surface simplification algorithms. In: Multiresolution Surface Modeling Course. ACM Siggraph Course notes (1997)Google Scholar
- 7.Keogh, E., Chu, S., Hart, D., Pazzani, M.: Segmenting time series: A survey and novel approach. Data Mining in time series databases, 1–21 (2004)Google Scholar
- 8.Kolesnikov, A., Franti, P., Wu, X.: Multiresolution polygonal approximation of digital curves. In: Proceedings of the 17th International Conference on Pattern Recognition, ICPR 2004, vol. 2, pp. 855–858. IEEE (2004)Google Scholar
- 14.Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the Strength Pareto Evolutionary Algorithm. In: EUROGEN 2001, pp. 95–100. International Center for Numerical Methods in Engineering (CIMNE), Athens (2001)Google Scholar