New optimal controller tuning method for an AVR system using a simplified Ant Colony Optimization with a new constrained Nelder–Mead algorithm

In this paper, an optimal gain tuning method for PID controllers is proposed using a novel combination of a simplified Ant Colony Optimization algorithm and Nelder–Mead method (ACO-NM) including a new procedure to constrain NM. To address Proportional-Integral-Derivative (PID) controller tuning for the Automatic Voltage Regulator (AVR) system, this paper presents a meta-analysis of the literature on PID parameter sets solving the AVR problem. The investigation confirms that the proposed ACO-NM obtains better or equivalent PID solutions and exhibits higher computational efficiency than previously published methods. The proposed ACO-NM application is extended to realistic conditions by considering robustness to AVR process parameters, control signal saturation and noisy measurements as well as tuning a two-degree-of-freedom PID controller (2DOF-PID). For this type of PID, a new objective function is also proposed to manage control signal constraints. Finally, real time control experiments confirm the performance of the proposed 2DOF-PIDs in quasi-real conditions. Furthermore, the efficiency of the algorithm is confirmed by comparing its results to other optimization algorithms and NM combinations using benchmark functions.     

一种含参数的双线性有理插值的图像缩放方法

通过一种基于函数值的分母与分子均为一次的线性有理插值函数构造出带参数的叹线性有理插值函数,该函数形式简单,灵活度高。利用该函数提出了一种新的图像插值算法,实验表明,该方法控制灵活,能有效实现图像的缩放。     

一种新的区域图像插值算法

针对传统的3种图像插值算法在插值后分别存在灰度不连续、轮廓模糊、计算量大等问题,提出了一种新的区域插值算法。该算法先对图像依据纹理平坦或复杂进行区域的相对划分,然后根据待插值点在源图像中所属的区域对应地使用不同的插值算法。与一些典型插值算法进行仿真比较,验证了该算法在基本不改变插值精度的前提下,可以有效地降低运算时间。     

多重网格方法求解两类Helmholtz方程

详细给出了多重网格方法的实现过程,借助正定Helmholtz方程及不定Helmholtz方程的求解来探讨多重网格方法的特性。对多重网格V环、W环以及F环三种不同迭代格式的收敛效果进行了对比。通过正定Helmholtz方程的求解,发现多重网格的确有很高的计算效率。对于不定Helmholtz方程,随着波数的增加,利用多重网格方法得到结果不收敛,原因出在细网格光滑和粗网格矫正过程。如何针对此问题对多重网格进行有效改进还有待进一步研究。     

切割线法圆弧插补新算法的设计与实现

插补运算速度、进给速度和插补精度是圆弧插补算法中最重要的指标,虽然圆弧插补算法有很多种,但在进给速度和插补精度上都不是很理想.现在提出了一种切割法圆弧插补新算法,这种圆弧插补算法计算简单,不仅插补运算速度明显提高,同时在保证插补精度的前提下,进给速度也得到了显著的提高.     

Constructing triangular patch by basic approximation operator plus additional interpolation operator

~~Constructing triangular patch by basic approximation operator plus additional interpolation operator1. Barahill, R. E., Birkhoff, G., Gordon, W. J., Smooth interpolation in triangles, J. Approx. Theory, 1973, 8: 114-128. 2. Gregory, J. A., Smooth interpolation without twist constraints, in Computer Aided Geometric Design (eds. Barn-hill, R. E., Riesenfeld, R. R), New York: Academic Press, 1974, 71-88. 3. Charrot, P., Gregory, J. A., A pentagonal surface patch for comput…     

Hermite interpolation with a pair of spirals

The Hermite interpolation problem in the plane considered here is to join two points and to match given unit tangent vectors and signed curvatures at the two points with various G² curves consisting of a pair of spirals. The rotation of the tangent vector of the interpolating curve from one point to the other is restricted to being less than π. The necessary and sufficient conditions for the existence of each of the various curves are given.     

Modified Nelder-Mead self organizing migrating algorithm for function optimization and its application

In this paper, a modified Nelder Mead Self Organizing Migrating Algorithm (mNM-SOMA) has been presented for solving unconstrained optimization problems. It is based on the hybridization of self organizing migrating algorithm (SOMA) with modified Nelder Mead (mNM) Crossover Operator. SOMA is a low population based technique that has good exploration and exploitation qualities, but sometimes converges premature to local optima solution due to lack of diversity preserve mechanism. In this paper an attempt has been made to improve the efficiency of SOMA using a modified NM crossover operator (mNM) for maintaining the diversity in the search space. mNM-SOMA has been tested on a set of 15 test problems, taken form literature and results are compared with the results obtained by self organizing migrating genetic algorithm (SOMGA), SOMA, genetic algorithm (GA) and particle swarm optimization (PSO). For better presentation, results are also analyzed graphically using a Performance Index. Besides this, mNM-SOMA has also been used to solve Frequency Modulation Sounds Parameter Identification Problem. Analysis of numerical results infers mNM-SOMA as a less expensive robust technique.     

An alternative method of curve interpolation

Given a point data set that contains several fairly unevenly distributed random points, this paper presents a new paradigm of curve interpolation to fit a curve to the data with end tangent vector constraints. The method uses a base curve, which is subjected to constrained shape manipulations to achieve interpolation, while maintaining end point and end tangent constraints. The algorithm is not sensitive to the distribution or to the randomness of the data, as long as the points represent fairly simple shapes, as in reverse engineering of properly segmented points, or in shape design using simple segments. The method is iterative in nature and allows various forms of adjustments to achieve good results.     

A Multigrid Platform for Real-Time Motion Computation with Discontinuity-Preserving Variational Methods

Variational methods are among the most accurate techniques for estimating the optic flow. They yield dense flow fields and can be designed such that they preserve discontinuities, estimate large displacements correctly and perform well under noise and varying illumination. However, such adaptations render the minimisation of the underlying energy functional very expensive in terms of computational costs: Typically one or more large linear or nonlinear equation systems have to be solved in order to obtain the desired solution. Consequently, variational methods are considered to be too slow for real-time performance. In our paper we address this problem in two ways: (i) We present a numerical framework based on bidirectional multigrid methods for accelerating a broad class of variational optic flow methods with different constancy and smoothness assumptions. Thereby, our work focuses particularly on regularisation strategies that preserve discontinuities. (ii) We show by the examples of five classical and two recent variational techniques that real-time performance is possible in all cases—even for very complex optic flow models that offer high accuracy. Experiments show that frame rates up to 63 dense flow fields per second for image sequences of size 160 × 120 can be achieved on a standard PC. Compared to classical iterative methods this constitutes a speedup of two to four orders of magnitude.     

Point-tangent/point-normal B-spline curve interpolation by geometric algorithms

We introduce a novel method to interpolate a set of data points as well as unit tangent vectors or unit normal vectors at the data points by means of a B-spline curve interpolation technique using geometric algorithms. The advantages of our algorithm are that it has a compact representation, it does not require the magnitudes of the tangent vectors or normal vectors, and it has C² continuity. We compare our method with the conventional curve interpolation methods, namely, the standard point interpolation method, the method introduced by Piegl and Tiller, which interpolates points as well as the first derivatives at every point, and the piecewise cubic Hermite interpolation method. Examples are provided to demonstrate the effectiveness of the proposed algorithms.     

A new algorithm for a recursive construction of the minimal interpolation space

In this work, we introduce a new interpolation algorithm, based on a recursive method for computing Lagrange interpolants. This algorithm allows to construct recursively the minimal interpolation space (see [1]) with respect to a finite set of points. We also extend this recursive method to the osculatory interpolation problem.     

一种基于关键点的断层轮廓插值方法

为了实现断层图像之间的合理过渡,需要对断层间轮廓进行插值。提出了一种序列断层轮廓间线性插值的方法。该方法不仅对一般问题效果良好,而且可以根据实际情况需要调节插值轮廓线的精度,提高运行效率,减少计算量。     

On Hermite interpolation with B-splines

Polar forms are used to find the B-spline control points for Hermite interpolation.