Piecewise Bézier Curve Fitting by Multiobjective Simulated Annealing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Curve Fitting with Bézier Cubics

1. An image’s outline cannot be fitted by a single cubic Bézier curve piece if it contains corners. Corners are points In this paper, a new curve-fitting algorithm is presented. This algorithm can automatically fit a set of data points with at which the outline’s directions take a sharp turn, or the piecewise geometrically continuous (G) cubic Bézier curves. outlines have discontinuous tangent ...

متن کامل

Piecewise Cubic Curve Fitting Algorithm

We give a piecewise cubic curve fitting algorithm which preserves monotonicity of the data. The algorithm has a higher order of convergence than the Fritsch-Carlson algorithm and is simpler than the Eisenstat-Jackson-Lewis algorithm.

متن کامل

Bézier Curve Parametrization Using a Multiobjective Evolutionary Algorithm

Curve fitting is a classical problem in several areas, and the choice of parameters can drastically change the results obtained. Optimizing the parameters is a complex task, and there are many works in the literature applying nature inspired algorithms to solve this problem. A common observation in these works is that they minimize only the error of the curve and this can result in anomalies on...

متن کامل

A new method for video data compression by quadratic Bézier curve fitting

This paper presents a new and efficient method for video data compression using quadratic Bézier curve fitting. The method treats the luminance or color variations of a spatial location in a sequence of frames as input points in Euclidean space R1 or R3. The input points are approximated using quadratic Bézier least square fitting. The output data consists of quadratic Bézier control points and...

متن کامل

Pareto-based Cost Simulated Annealing for Multiobjective Optimization

In this paper, a multiobjective simulated annealing (MOSA) method is introduced and discussed with the multiobjective evolutionary algorithms (MOEAs). Though the simulated annealing is a very powerful search algorithm and has shown good results in various singleobjective optimization fields, it has been seldom used for the multiobjective optimization because it conventionally uses only one sear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2016

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2016.12.160