Piecewise Linear Approximation of n-Dimensional Parametric Curves Using Particle Swarms

This paper derives a new algorithm for piecewise linear approximation of n-dimensional parametric curves, specifically to be used with particle swarm optimization. The aim of the algorithm is to find the optimal piecewise linear approximation for a predefined number of segments. The performance of this algorithm is evaluated on a set of functions of varying dimensionality.

[1]  G. Manis,et al.  Optimal piecewise linear approximation of digitized curves , 1997, Proceedings of 13th International Conference on Digital Signal Processing.

[2]  James George Dunham,et al.  Optimum Uniform Piecewise Linear Approximation of Planar Curves , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Andries Petrus Engelbrecht,et al.  Particle swarm optimization: Velocity initialization , 2012, 2012 IEEE Congress on Evolutionary Computation.

[4]  Isabel Beichl,et al.  A simple algorithm for efficient piecewise linear approximation of space curves , 1997, Proceedings of International Conference on Image Processing.

[5]  Luiz Velho,et al.  A Methodology for Piecewise Linear Approximation of Surfaces , 1997, J. Braz. Comput. Soc..

[6]  A. Imamoto,et al.  A Recursive Descent Algorithm for Finding the Optimal Minimax Piecewise Linear Approximation of Convex Functions , 2008, Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008.

[7]  Jack Sklansky,et al.  Fast polygonal approximation of digitized curves , 1980, Pattern Recognit..

[8]  Andries Petrus Engelbrecht,et al.  Using neighbourhoods with the guaranteed convergence PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[9]  H. Stone.  Approximation of curves by line segments , 1961 .

[10]  Karin Wall,et al.  A fast sequential method for polygonal approximation of digitized curves , 1984, Comput. Vis. Graph. Image Process..

[11]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[12]  Marc Salotti.  An efficient algorithm for the optimal polygonal approximation of digitized curves , 2001, Pattern Recognit. Lett..

[13]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[14]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[15]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[16]  J. Kennedy,et al.  Population structure and particle swarm performance , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  Theodosios Pavlidis,et al.  Polygonal Approximations by Newton's Method , 1977, IEEE Transactions on Computers.