一种改进的各向异性扩散去噪模型

为了既能有效地去除噪声,又能够较好地保持图像的边缘以及重要的细节信息,在Perona和Malik提出的各向异性扩散模型(P-M模型)的基础上,通过对扩散方程中扩散函数的改进,提出了一种具备自适应性的去噪扩散模型,该模型对图像去噪处理更加高效。改进的扩散函数在梯度较小时为一个常数,大于某个阈值后变为单调递减函数,直至某个梯度时递减为零。以上扩散函数特性使各向异性扩散模型能够达到在同质区加速平滑、在边缘区停止平滑的目的。实验结果表明,改进的扩散模型是一种更为理想的保边缘平滑模型。     

基于优化Prewitt的高速夜间车道检测算法

针对夜间高速公路,提出识别车道标志线的新型检测算法.该算法采用改进的中值法滤波,基于光密度差的4方向模板对数Prewitt边缘检测预处理图像,得到二值化阈值T. ROI和左右车道线的确定大大减少运算量,结合车道线宽度去除伪车道,采用临时轨迹策略排除光线变化和前方车辆的干扰,最后得到完整清晰的车道线.实验证明该车道检测方法具有快速性、稳定性、准确性.     

Tool path smoothing of a redundant machine: Application to Automated Fiber Placement

Automated Tape Laying and Fiber Placement of composite materials are the two principal automated processes used for fabrication of large composite structures in aeronautical industry. The aluminum parts produced by High Speed Machining tend to be replaced by carbon fiber composite parts realized with these processes. However, structural parts present reinforcement zones which disturb the tool path follow-up and generate an increase of the manufacturing time. Thus, this paper deals with the optimization of tool paths of a 7-axis machine tool of Fiber Placement with the objective of reducing the manufacturing time while ensuring the requested quality of the final part. In this paper, two complementary methods are detailed. The first method takes advantage of the degree of redundancy of the machine tool to decrease the kinematic loads of the control joints. The second method aims to smooth the orientation of the machine head along the tool path while ensuring quality constraints. These two methods are then applied on a test tool path and bring to a significant decrease of the manufacturing time (32.9%).     

Instability in leapfrog and forward–backward schemes: Part II: Numerical simulations of dam break

Following Sun’s approach [17], Shuman smoothing instead of conventional diffusion terms is used in a simple two-time step semi-implicit finite volume scheme to simulate dam break. When the Courant number is less than one, the absolute value of amplification factor of the 1D linearized shallow-water equations is 1 in this new scheme. Compared with the characteristic-based semi-Lagrangian schemes and the Riemann solver, this scheme produces excellent results of free water depth and speed of the shock. Numerical simulations show that the water inside the dam initially moves away radially until water almost depletes near the center; then the water moves back to the center and forms a vertical water column there. This paper proves that Shuman smoothing can be used not only in the linearized shallow-water equations discussed in Sun [17] but also in the nonlinear wave equations to control instability around shocks.     

Segmentation of ultrasound images of the carotid using RANSAC and cubic splines

A new algorithm is proposed for the semi-automatic segmentation of the near-end and the far-end adventitia boundary of the common carotid artery in ultrasound images. It uses the random sample consensus method to estimate the most significant cubic splines fitting the edge map of a longitudinal section. The consensus of the geometric model (a spline) is evaluated through a new gain function, which integrates the responses to different discriminating features of the carotid boundary: the proximity of the geometric model to any edge or to valley shaped edges; the consistency between the orientation of the normal to the geometric model and the intensity gradient; and the distance to a rough estimate of the lumen boundary.A set of 50 longitudinal B-mode images of the common carotid and their manual segmentations performed by two medical experts were used to assess the performance of the method. The image set was taken from 25 different subjects, most of them having plaques of different classes (class II to class IV), sizes and shapes.The quantitative evaluation showed promising results, having detection errors similar to the ones observed in manual segmentations for 95% of the far-end boundaries and 73% of the near-end boundaries.     

改进的自适应中值滤波算法

中值滤波窗口大小影响滤波器性能,3×3滤波窗口可以很好地保持图像细节。提出一种新的自适应中值滤波方法。将3×3窗口中心的极值点作为候选噪声点,若候选噪声点仍然是7×7窗口的极值点,则该点即是噪声点。若以噪声点为中心的3×3滤波窗口的中值不是噪声,则噪声用中值替换。重复以上过程,直到没有噪声点被替换。如果图像中仍然存在大的噪声团块,则噪声用相邻的三个信号点的灰度均值替换。实验结果表明,该方法能够有效去除脉冲噪声,并在抑制噪声的同时很好地保护图像的细节。     

基于多级查找表的图像快速中值滤波算法

中值滤波是应用最广泛的滤波算法之一。它可以可有效去除脉冲噪声、保护细节信息,然而查找中值的耗时问题在一定程度上制约了中值滤波的应用。为提高查找中值的速度,提出了一种利用多级查找表进行快速中值滤波的方法。该方法针对图像存储的长度特点,最多设置了三级查找表,逐级缩小中值的查找范围。实验表明,该方法查找中值具有优良效果,尤其在大窗口滤波时,中值滤波的速度得到提高,从而增强了图像处理的实时性。     

Dividing Cubes算法生成的物体表面的法向量方向的光顺操作

在用DividingCubes算法提取的边界体素所构造的物体表面上,可能会存在法向量方向突变,使得物体表面光照图显示粗糙,文中提出了一种的领域加权平均法,对物体表面的法向量方向进行光顺处理,光顺操作只在相关边界体素间进行,并且对有多个等值面交汇的边界体素将不进行光顺操作,以避免模糊位于多个区域处的边界和保持物体表面光照图的细节,为避免在屏幕上产生孔洞,用光线投射法显示物体表面,文中所采用的光顺操作可以消除物体表面的法向量方向突变,使物体表面光照图光谱细腻,最后,给出一个医学图像的测试实例。     

Temporal aggregation, systematic sampling, and the Hodrick-Prescott filter

The time aggregation properties of the Hodrick-Prescott (HP) filter, which decomposes a time series into trend and cycle, are analyzed for the case of annual, quarterly, and monthly data. Aggregation of the disaggregate components cannot be obtained as the exact result from direct application of an HP filter to the aggregate series. Employing several criteria, HP decompositions for different levels of aggregation that provide similar results can be found. The aggregation is guided by the principle that the period associated with the frequency for which the filter gain is should not be altered. This criterion is intuitive and easy to apply. It is shown that it is approximated, to the first order, by an already proposed empirical rule and that alternative, more complex criteria yield similar results. Moreover, the values of the smoothing parameter of the HP filter that provide results which are approximately consistent under aggregation are considerably robust with respect to the ARIMA model of the series. Aggregation is found to perform better for the case of temporal aggregation than for systematic sampling. The desirability of exact aggregation consistency is investigated. A clarification concerning the supposed spuriousness of the cycles obtained by the HP filter is discussed.     

A non-monotone inexact regularized smoothing Newton method for solving nonlinear complementarity problems

In the paper [S.P. Rui and C.X. Xu, A smoothing inexact Newton method for nonlinear complementarity problems, J. Comput. Appl. Math. 233 (2010), pp. 2332–2338], the authors proposed an inexact smoothing Newton method for nonlinear complementarity problems (NCP) with the assumption that F is a uniform P function. In this paper, we present a non-monotone inexact regularized smoothing Newton method for solving the NCP which is based on Fischer–Burmeister smoothing function. We show that the proposed algorithm is globally convergent and has a locally superlinear convergence rate under the weaker condition that F is a P ₀ function and the solution of NCP is non-empty and bounded. Numerical results are also reported for the test problems, which show the effectiveness of the proposed algorithm.