Polygonal Approximation Using an Artificial Bee Colony Algorithm

A polygonal approximation method based on the new artificial bee colony (NABC) algorithm is proposed in this paper. In the present method, a solution is represented by a vector, and the objective function is defined as the integral square error between the given curve and its corresponding polygon....

Full description

Bibliographic Details
Main Author: Shu-Chien Huang
Format: Article
Language:English
Published: Hindawi Limited 2015-01-01
Series:Mathematical Problems in Engineering
Online Access:http://dx.doi.org/10.1155/2015/375926
id doaj-5a29f4594917432aba342674eb82bfb6
record_format Article
spelling doaj-5a29f4594917432aba342674eb82bfb62020-11-24T22:04:50ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/375926375926Polygonal Approximation Using an Artificial Bee Colony AlgorithmShu-Chien Huang0Department of Computer Science, National Pingtung University, Pingtung City 90003, TaiwanA polygonal approximation method based on the new artificial bee colony (NABC) algorithm is proposed in this paper. In the present method, a solution is represented by a vector, and the objective function is defined as the integral square error between the given curve and its corresponding polygon. The search process, including the employed bee stage, the onlooker bee stage, and the scout bee stage, has been constructed for this specific problem. Most experiments show that the present method when compared with the DE-based method can obtain superior approximation results with less error norm with respect to the original curves.http://dx.doi.org/10.1155/2015/375926
collection DOAJ
language English
format Article
sources DOAJ
author Shu-Chien Huang
spellingShingle Shu-Chien Huang
Polygonal Approximation Using an Artificial Bee Colony Algorithm
Mathematical Problems in Engineering
author_facet Shu-Chien Huang
author_sort Shu-Chien Huang
title Polygonal Approximation Using an Artificial Bee Colony Algorithm
title_short Polygonal Approximation Using an Artificial Bee Colony Algorithm
title_full Polygonal Approximation Using an Artificial Bee Colony Algorithm
title_fullStr Polygonal Approximation Using an Artificial Bee Colony Algorithm
title_full_unstemmed Polygonal Approximation Using an Artificial Bee Colony Algorithm
title_sort polygonal approximation using an artificial bee colony algorithm
publisher Hindawi Limited
series Mathematical Problems in Engineering
issn 1024-123X
1563-5147
publishDate 2015-01-01
description A polygonal approximation method based on the new artificial bee colony (NABC) algorithm is proposed in this paper. In the present method, a solution is represented by a vector, and the objective function is defined as the integral square error between the given curve and its corresponding polygon. The search process, including the employed bee stage, the onlooker bee stage, and the scout bee stage, has been constructed for this specific problem. Most experiments show that the present method when compared with the DE-based method can obtain superior approximation results with less error norm with respect to the original curves.
url http://dx.doi.org/10.1155/2015/375926
work_keys_str_mv AT shuchienhuang polygonalapproximationusinganartificialbeecolonyalgorithm
_version_ 1725828584837218304