Adaptive knot placement using a GMM-based continuous optimization algorithm in B-spline curve approximation

doi:10.1016/j.cad.2011.01.015

Return

Adaptive knot placement using a GMM-based continuous optimization algorithm in B-spline curve approximation

2011-06-01

PRE

DOI：10.1016/j.cad.2011.01.015

Original

Save

Abstract

En 中文

One of the key problems in using B-splines successfully to approximate an object contour is to determine good knots. In this paper, the knots of a parametric B-spline curve were treated as variables, and the initial location of every knot was generated using the Monte Carlo method in its solution domain. The best km knot vectors among the initial candidates were searched according to the fitness. Based on the initial parameters estimated by an improved k-means algorithm, the Gaussian Mixture Model (GMM) for every knot was built according to the best km knot vectors. Then, the new generation of the population was generated according to the Gaussian mixture probabilistic models. An iterative procedure repeating these steps was carried out until a termination criterion was met. The GMM-based continuous optimization algorithm could determine the appropriate location of knots automatically. A set of experiments was then implemented to evaluate the performance of the new algorithm. The results show that the proposed method achieves better approximation accuracy than methods based on artificial immune system, genetic algorithm or squared distance minimization (SDM). Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

Keywords:

B-spline curve approximation

Knot placement

GMM

EDA

Contour