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 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

弹性-粘弹性复合结构随机响应的各阶谱矩的计算方法

提出了一种新的计算弹性-粘弹性复合结构随机响应的各阶谱矩的计算方法，它是一种时域复模态分析方法。利用此方法获得了弹性-粘弹性复合结构在白噪声、滤过白噪声等典型平稳随机激励下随机响应的各阶谱矩的解析表达式，分析了粘弹性对各阶谱矩的影响。此计算方法简便、易用，无论单自由度或多自由度系统均适用，为进一步研究弹性-粘弹性复合结构在随机激励下的可靠性打下良好基础。     

Bandpass filters using periodically loaded combline resonators

A novel combline filter is proposed for cellular‐radio base stations. The Q‐factor is significantly improved. The eigenvalue equation is expressed with the single‐team approximation in the gap region of the combline resonator. A two‐pole combline filter is designed. The calculation, simulation, and experiment results are presented and are in good agreement. © 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.     

冷轧带肋钢筋直径与拉丝机卷筒直径的匹配

采用被动式工艺生产冷轧带肋钢筋须经过减径、成型两台轧机连续轧制．要求钢材的秒流量相等，否则将造成断线停产或线材在拉丝机卷筒上打滑，致使卷筒严重磨损．用双层卷筒拉丝机提供动力生产冷轧带肋钢筋时，线材直径与卷筒直径的匹配是在一个小的调整范围，通过轧机拉力控制在一定范围变化，可保证成品尺寸符合公差要求而不产生打滑，从而避免了卷筒严重磨损．     

Empirical comparison of image retrieval color similarity methods with human judgment

It is important to verify assumptions and methods of image retrieval against actual human behavior. A study was conducted to compare similarity methods of color histograms against human assessment of similarity. The similarity methods tested include basic histogram intersection, center histogram matching, locality histogram matching, and size-weighted histogram matching. 161 subjects participated in the empirical study. The findings, based on Spearman correlation analysis, showed that both the basic histogram intersection method and size-weighted histogram are very close to human assessment of similarity (Spearman correlation coefficient of 0.915). The other two are not close to human judgment on similarity. This study illustrates an alternative approach to evaluating matching algorithms. Unlike the usual measures of recall and precision, this approach emphasizes human validation. Fewer images are required with the use of statistical testing.     

Salt-water up-coning during extraction of fresh water from a tropical island

Rainwater can collect in a lens-shaped region within the rock of a tropical island, and may be separated from the underlying salt water by a sharp interface. This paper presents a nonlinear theory for determining the shape of this interface. The island is assumed to be saturated with rain, and provision is made for the outflow of rain-water through the sides of the island. The effect of a bore well on the shape of the interface is investigated, and the problem is solved using a spectral method. An integral-equation method is also presented for the case when the island has infinite width.     

Bootstrapping the Local Periodogram of Locally Stationary Processes

Abstract. Locally stationary processes are non‐stationary stochastic processes the second‐order structure of which varies smoothly over time. In this paper, we develop a method to bootstrap the local periodogram of a locally stationary process. Our method generates pseudo local periodogram ordinates by combining a parametric time and non‐parametric frequency domain bootstrap approach. We first fit locally a time varying autoregressive model so as to capture the essential characteristics of the underlying process. A locally calculated non‐parametric correction in the frequency domain is then used so as to improve upon the locally parametric autoregressive fit. As an application, we investigate theoretically the asymptotic properties of the bootstrap method proposed applied to the class of local spectral means, local ratio statistics and local spectral density estimators. Some simulations demonstrate the ability of our method to give accurate estimates of the quantities of interest in finite sample situations and an application to a real‐life data‐set is presented.     

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.     

Shift-or string matching with super-alphabets

Given a text T[1…n] and a pattern P[1…m] over some alphabet Σ of size σ, we want to find all the (exact) occurrences of P in T. The well-known shift-or algorithm solves this problem in time O(n⌈m/w⌉), where w is the number of bits in machine word, using bit-parallelism. We show how to extend the bit-parallelism in another direction, using super-alphabets. This gives a speed-up by a factor s, where s is the number of characters processed simultaneously. The algorithm is implemented, and we show that it works well in practice too. The result is the fastest known algorithm for exact string matching for short patterns and small alphabets.