Piecewise linear approximation of n-dimensional parametric curves using particle swarms

Authors:
Christopher Wesley Cleghorn;Andries P. Engelbrecht
Affiliations:
Department of Computer Science, University of Pretoria, South Africa;Department of Computer Science, University of Pretoria, South Africa
Venue:
ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence
Year:
2012

Citing 6
Cited 0

Optimum Uniform Piecewise Linear Approximation of Planar Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Population structure and particle swarm performance

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Polygonal Approximations by Newton's Method

IEEE Transactions on Computers
A Recursive Descent Algorithm for Finding the Optimal Minimax Piecewise Linear Approximation of Convex Functions

WCECS '08 Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.