In addition it proposes taboo search algorithm based on a new neighborhood search method,and the TS algorithms in the method are used as local search algorithm.

Secondly, the reciprocal of conditional operators of Hessian matrix was taken as the weighted matrix of Lucas-Kanade flow field. This method can eliminate the unreliable constrained points of local neighborhood, and increase the stability of the basic solution of the constrained equation. The experiment results showed that the proposed method can establish the optical flow field for human gait precisely

With the boundary key points of four neighborhood layers,three-dimensional solids between the two adjacent layers are produced according to 3D-Delaunay tetrahedron algorithm.

Like the truncations of the Taylor expansion, the truncations of a chromatic expansion at t = t0 of an analytic function f(t) approximate f(t) locally, in a neighborhood of t0.

It is available for the case that the sign of f(x) changes frequently or the derivative f'(x) does not exist in the neighborhood of the root, while the Newton method is hard to work.

One allows the appearance of eight limit cycles in the neighborhood of infinity, which is the first example that a polynomial differential system bifurcates eight limit cycles at infinity.

Neighborhood union of independent sets and hamiltonicity of claw-free graphs

Let G be a graph, for any u∈V(G), let N(u) denote the neighborhood of u and d(u)=|N(u)| be the degree of u.

In this paper, a new method for image smoothing——the modified neighborhood averaging method is presented. With this method, not only the noise can be smoothed efficiently, but also the blurred edge of an image be sharpened. It is simple in computation, requiring no a priori knowledge and predetermined parameters. In order to evaluate the performance of the proposed method quantitatively, a figure of merit for the test image generated by computer is defined and used as a measure of evaluation. The performance...

In this paper, a new method for image smoothing——the modified neighborhood averaging method is presented. With this method, not only the noise can be smoothed efficiently, but also the blurred edge of an image be sharpened. It is simple in computation, requiring no a priori knowledge and predetermined parameters. In order to evaluate the performance of the proposed method quantitatively, a figure of merit for the test image generated by computer is defined and used as a measure of evaluation. The performance of the method is also compared with that of the gradient inverse weighted smoothing method and median filtering by experiments. Finally, processed results of real world images are given.

This paper focuses on various algorithms for the distance graphs about 2-D raster image and their amount of calculation,the number of pass and di- fference from Euclidean distance.First,some definitions such as distance and distance graph etc.,are given by the present writer.It is then proposed that algorithm A be used to calculate the N-neighborhood’s or chamfer’s distance graphs and algorithm B be used to calculate the octagon’s distance graphs. And at the same time two groups of masks are utilized to...

This paper focuses on various algorithms for the distance graphs about 2-D raster image and their amount of calculation,the number of pass and di- fference from Euclidean distance.First,some definitions such as distance and distance graph etc.,are given by the present writer.It is then proposed that algorithm A be used to calculate the N-neighborhood’s or chamfer’s distance graphs and algorithm B be used to calculate the octagon’s distance graphs. And at the same time two groups of masks are utilized to describe these algorithms.At last,the amount of calculation,the number of pass and the difference between the Euclidean distance and the computed distances for some distance graphs are compared.

本文着重讨论和分析了二维栅格图象各种距离图的计算算法以及运算量、遍历次数和误差值等。作者首先定义了几个概念,包括距离和距离图,然后提出了用于计算 N—邻居距离图和对角线距离图的算法 A 和用于计算八边形距离图的算法 B,并用二组遍历蒙片直观地描述这了两个算法.最后,对各种距离图的计算量、遍历次数和误差值进行了详细的比较。

The following proposition are proved:Let P_0 be a point on the contour of a smooth surface withnegative gaussian curvature S,the asymptotic direction of P_0 on S is the critical direction for the visi-ble contour of S in the neighborhood of P_0.