Stereo matching cost computation based on nonsubsampled contourlet transform

A new matching cost computation method based on nonsubsampled contourlet transform (NSCT) for stereo image matching is proposed in this paper. Firstly, stereo image is decomposed into high frequency sub-band images at different scales and along different directions by NSCT. Secondly, by utilizing coefficients in high frequency domain and grayscales in RGB color space, the computation model of weighted matching cost between two pixels is designed based on the gestalt laws. Lastly, two types of experiments are carried out with standard stereopairs in the Middlebury benchmark. One of the experiments is to confirm optimum values of NSCT scale and direction parameters, and the other is to compare proposed matching cost with nine known matching costs. Experimental results show that the optimum values of scale and direction parameters are respectively 2 and 3, and the matching accuracy of the proposed matching cost is twice higher than that of traditional NCC cost.     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

Efficient Collocation Schemes for Singular Boundary Value Problems

We discuss an error estimation procedure for the global error of collocation schemes applied to solve singular boundary value problems with a singularity of the first kind. This a posteriori estimate of the global error was proposed by Stetter in 1978 and is based on the idea of Defect Correction, originally due to Zadunaisky. Here, we present a new, carefully designed modification of this error estimate which not only results in less computational work but also appears to perform satisfactorily for singular problems. We give a full analytical justification for the asymptotical correctness of the error estimate when it is applied to a general nonlinear regular problem. For the singular case, we are presently only able to provide computational evidence for the full convergence order, the related analysis is still work in progress. This global estimate is the basis for a grid selection routine in which the grid is modified with the aim to equidistribute the global error. This procedure yields meshes suitable for an efficient numerical solution. Most importantly, we observe that the grid is refined in a way reflecting only the behavior of the solution and remains unaffected by the unsmooth direction field close to the singular point.     

Banach空间二阶非线性微分方程的弱Carathéodory解

本文定义了二阶微分方程的弱 Carathéodory解 ,在不涉及紧型条件的情形下 ,直接用迭代法证明了 Banach空间二阶非线性常微分方程两点边值问题存在唯一解 ,并给出逼近解迭代序列的误差估计 ,对周期边值问题得到类似的结果     

Aggregate error locator and error value computation in AG codes

The aggregate error locator is defined and a computation method is given. The aggregate error locator is then used in a type of Forney algorithm to compute the error values in the received words of a Ca,b algebraic geometry code.     

不完全信息群体决策专家权重的集结

本文对于属性权重信息和属性效用信息都不完全的群体多属性决策问题，通过构造属性值区间和运用系统聚类分析法，对群体决策中的专家进行分类，并确定每位专家的权重．     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

Bit-parallel approximate string matching algorithms with transposition

Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms.     

四阶非线性边值问题解的存在性与上下解方法

该文讨论四阶常微分方程边值问题u^(4)(t)=f(t,u,u″), t∈［0,1］,u(0)=u(1)=u″(0)=u″(1)=0解的存在性, 其中f(t,u,v):［0,1］×R×R→R为Carathéodory函数. 在不限制f关于u,v的增长阶, 不假定f关于u,v的单调性的一般情形下, 用上下解方法获得了解的存在性结果,并讨论了单调迭代求解的有效性.     

级数小于1的亚纯函数的Borel例外值

证明了当超越亚纯函数的级小于1时，其Norel例外值最多只有一个．由于存在任何级的整函数，因此一个例外值总可达到，故所得结果不能再改进。