基于Canny算子边缘检测的小波阈值去噪方法

本文研究了信号处理中图像去噪的问题.利用小波变换理论提出了一种基于Canny算子边缘检测的小波阈值去噪方法,实验结果表明,该方法在有效去除噪声的同时能够更好地保留图像的边缘.     

基于四点插值细分小波的SAR图像去噪

针对SAR图像去噪过程中存在降低相干斑与保持有效细节这一矛盾,提出了一种基于四点插值细分小波的SAR图像去噪算法,该方法将小波和细分方法相融合,将四点插值细分规则应用到细分小波中,提出了图像去噪的新方法.该算法先用四点插值细分小波对原始图像进行分解,然后用Bayes自适应阈值及阈值函数对图像进行去噪,最后对去噪的小波系数进行重构,并通过等效视数、边缘保持指数等评价指标对去噪结果进行了评价.实验结果表明,算法的等效视数、边缘保持指数都有所提高,去噪效果得到了优化.     

基于多带复数小波与最大后验概率估计法的图像去噪方法

提出一种基于多带复数小波与最大后验概率估计方法的图像去噪方法，与二带小波以及相应的去噪方法相比，性能具有明显改善。     

过抽样M通道小波星图去噪方法研究

小波图像去噪已经成为目前图像去噪的主要方法之一,在分析了小波变换的基本理论和小波变换的多尺度分析基础上,根据多尺度小波变换的多分辨特性,提出了过抽样M通道小波变换去噪方法,并将此方法用于星图降噪处理中,收到良好的效果.     

小波基的选取对图像去噪的影响

小波图像去噪方法是现代图像处理中的重要组成部分，小波基的不同选取直接影响到去噪的效果．本文在全局阈值的标准下，通过对噪声水平和图像纹理特征的估计，讨论了小波基的正交性和线性相位性对去噪结果的不同影响，提出了选取小波基的近似标准．     

基于小波变换的图像去噪方法的研究

小波变换能有效的去除高斯噪声,中值滤波能有效的去除脉冲噪声,两者结合可以更有效的去除高斯噪声和脉冲噪声的混合噪声.当医学图像去除混合噪声时,先进行中值滤波再进行小波去噪的方法优于先进行小波去噪后再进行中值滤波的方法,且去噪后图像视觉效果较好,而且图像均方误差(M SE)也较小.在图像去噪处理中这种方法具有实际应用价值.     

自适应非张量积小波紧框架图像去噪

本文研究了图像去噪的问题.利用光滑余因子协调法,构造了样条空间S_6~4(?_(mn)~(2))中的二元六次样条函数,以此作为尺度函数,并基于酉延拓定理,构造了非张量积小波紧框架.利用构造的非张量积小波紧框架,提出了基于香农熵自适应确定最优小波紧框架分解层数以及改进的Normal Shrink自适应阈值算法,并给出了图像去噪实例和结果分析,获得了理想的数值结果,显示了本文方法的有效性.     

偏微分方程在图像去噪中的应用

本文介绍用于图像去噪的偏微分模型、方法的发展历程．从理论上分析了线性模型、简单非线性模型、复杂非线性模型、多步处理模型出现的背景和优缺点，并从空域和频域上对偏微分方程模型的去噪原理进行了分析．最后，指出了偏微分方程去噪与小波去噪结合的途径，据此对偏微分方程未来的发展方向进行了展望．     

带有小波函数积分的外推加速算法

数值计算光滑函数与小波函数的内积,是小波在数值分析的应用中经常遇到的一个典型问题,本文给出了一种外推积分方法,可以行之有效地提高数值解精度,减少计算量     

经济时间序列的连续参数小波网络预测模型

本文利用连续小波变换方法,给出一种连续参数小波网络。网络参数的学习采用一种类似神经网络的后向传播学习算法的随机梯度算法。另外,提出了一种借助小波分析理论指导网络参数赋初值的方法。进一步,通过对中国进出口贸易额时间序列预测建模的研究和仿真预测,提出了用连续参数小波网络建立经济时间序列预测模型的一般步骤和方法。预测结果表明,此模型具有较好的泛化、学习能力,可以有效地在数值上逼近时间序列难以定量描述的相互关系,所以利用连续参数小波网络建立的时间序列预测模型有较高的预测精度。     

Adaptive Restart of the Optimized Gradient Method for Convex Optimization

First-order methods with momentum, such as Nesterov’s fast gradient method, are very useful for convex optimization problems, but can exhibit undesirable oscillations yielding slow convergence rates for some applications. An adaptive restarting scheme can improve the convergence rate of the fast gradient method, when the parameter of a strongly convex cost function is unknown or when the iterates of the algorithm enter a locally strongly convex region. Recently, we introduced the optimized gradient method, a first-order algorithm that has an inexpensive per-iteration computational cost similar to that of the fast gradient method, yet has a worst-case cost function rate that is twice faster than that of the fast gradient method and that is optimal for large-dimensional smooth convex problems. Building upon the success of accelerating the fast gradient method using adaptive restart, this paper investigates similar heuristic acceleration of the optimized gradient method. We first derive a new first-order method that resembles the optimized gradient method for strongly convex quadratic problems with known function parameters, yielding a linear convergence rate that is faster than that of the analogous version of the fast gradient method. We then provide a heuristic analysis and numerical experiments that illustrate that adaptive restart can accelerate the convergence of the optimized gradient method. Numerical results also illustrate that adaptive restart is helpful for a proximal version of the optimized gradient method for nonsmooth composite convex functions.     

A global convergent quasi-Newton method for systems of monotone equations

In this paper, we propose a quasi-Newton method for solving systems of monotone equations. The method is a combination of the Broyden method and the hyperplane projection method. Under appropriate conditions, we prove that the proposed method is globally convergent. Preliminary numerical results show that the proposed method is promising.     

On the limited memory BFGS method for large scale optimization

We study the numerical performance of a limited memory quasi-Newton method for large scale optimization, which we call the L-BFGS method. We compare its performance with that of the method developed by Buckley and LeNir (1985), which combines cycles of BFGS steps and conjugate direction steps. Our numerical tests indicate that the L-BFGS method is faster than the method of Buckley and LeNir, and is better able to use additional storage to accelerate convergence. We show that the L-BFGS method can be greatly accelerated by means of a simple scaling. We then compare the L-BFGS method with the partitioned quasi-Newton method of Griewank and Toint (1982a). The results show that, for some problems, the partitioned quasi-Newton method is clearly superior to the L-BFGS method. However we find that for other problems the L-BFGS method is very competitive due to its low iteration cost. We also study the convergence properties of the L-BFGS method, and prove global convergence on uniformly convex problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract DE-FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071.     

A COLUMN-SECANT UPDATE TECHNIQUE FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

In this paper,we present a column-secant modification of the SCC method,which is called the CSSCC method.The CSSCC method uses function values more efficiently than the SCC method,and it is shown that the CSSCC method has better local q-convergence and r-convergence rates than the SCC method.The numerical results show that the CSSCC method is competitive with some well known methods for some standard test problems.     

关于非等距序列建模过程的讨论

目的:怎样建立非等距序列的最佳数学模型.方法:讨论用灰色系统GM(1.1)模型和非线性回归方法建立非等距序列的数学模型的过程,找出产生问题的原因,寻求解决问题的方法.结果:接近于指数规律变化的非等距序列,用非线性回归方法建立的数学模型比用灰色系统GM(1.1)模型方法建立的数学模型的精度高;对于其他的非等距序列,用灰色系统GM(1.1)模型方法建立的数学模型比用非线性回归方法建立的数学模型的精度高.结论:在建立非等距序列的数学模型时,采用灰色系统GM(1.1)模型方法与非线性回归方法结合的策略,可以得到较佳的数学模型.     

一种新的改进Newton法(英文)

本文给出了求解非线性方程的一种新的改进方法.利用Newton法和Heron平均,将新改进方法与其它一些迭代法作比较.数值结果表明该方法具有一定的实用价值.     

一种求解非线性互补问题的方法及其收敛性

本文将Newton方法和外梯度方法相结合,提出了一种求解非线性互补问题的方法,证明了此方法的全局收敛性和超线性收敛性,在适当的条件下给出了一个有限终止结果。数值实验表明,此方法是有效的。     

Accelerated Imaginary-time Evolution Methods for the Computation of Solitary Waves

Two accelerated imaginary-time evolution methods are proposed for the computation of solitary waves in arbitrary spatial dimensions. For the first method (with traditional power normalization), the convergence conditions as well as conditions for optimal accelerations are derived. In addition, it is shown that for nodeless solitary waves, this method converges if and only if the solitary wave is linearly stable. The second method is similar to the first method except that it uses a novel amplitude normalization. The performance of these methods is illustrated on various examples. It is found that while the first method is competitive with the Petviashvili method, the second method delivers much better performance than the first method and the Petviashvili method.     

强单调对称非线性方程组的BFGS算法

提出一种求解强单调非线性方程组的BFGS算法,该算法的一个明显优点是Bκ的条件数比Li-Fukushima^[3]提出的GNBFGS中Bκ的条件数小得多。且该算法是一种无需计算导数的下降算法。在一定的条件下,证明了算法的全局收敛性和超线性收敛性。最后进行数值试验,结果表明,本文算法具有较好的数值结果。而且验证了本文所提出的算法中Bκ的条件数要比GNBFGS算法的条件数小得多。     

Modelling on fuzzy control systems

A kind of modelling method for fuzzy control systems is first proposed here, which is called modelling method based on fuzzy inference (MMFI). It should be regarded as the third modelling method that is different from two well-known modelling methods, that is, the first modelling method, mechanism modelling method (MMM), and the second modelling method, system identification modelling method (SIMM). This method can, based on the interpolation mechanism on fuzzy logic system, transfer a group of fuzzy inference rules describing a practice system into a kind of nonlinear differential equation with variable coefficients, called HX equations, so that the mathematical model of the system can be obtained. This means that we solve the difficult problem of how to get a model represented as differential equations on a complicated or fuzzy control system.