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.     

双轴晶体主平面上倍频的相位匹配

从折射率椭球方程和折射率椭球面出发，讨论光束在双轴晶体中传播及偏振的特性、主平面倍频共线相位匹配（PM）问题，得到了双轴晶体主平面内激光所有可能PM倍频的8种偏振组合及其相应的PM角公式、有效非线性（NL）系数deff的一般表达式。结果表明：得到的公式简单，可大大简化PM参数计算及优化设计；折射率椭球面是单层曲面，比双层的折射率面简单；基于折射率椭球面寻找所有可能PM的类型、偏振组合的方法物理图像简明，易于理解，大大降低了双轴晶体PM问题分析的难度。     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

运动估计块匹配两级搜索算法

根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.     

Odd subgraphs and matchings

Let G be a graph and f : V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph if deg_H(x){1,3,…,f(x)} for all xV(H). If f(x)=1 for all xV(G), then a (1,f)-odd subgraph is nothing but a matching. A (1,f)-odd subgraph H of G is said to be maximum if G has no (1,f)-odd subgraph K such that |K|>|H|. We show that (1,f)-odd subgraphs have some properties similar to those of matchings, in particular, we give a formula for the order of a maximum (1,f)-odd subgraph, which is similar to that for the order of a maximum matching.     

Multiple factor analysis in environmental chemistry

In environmental chemistry studies, it may be necessary to analyze data sets constituted by different blocks of variables, possibly of different types, measured on the same samples. Multiple factor analysis (MFA) is presented as a tool for exploring such data. The most important features of MFA are shown on a real environmental data set, consisting of two blocks of data, namely heavy metals and polycyclic aromatic hydrocarbons, measured for sediment samples. They are discussed and compared to principal component analysis (PCA). The usefulness of the weighting scheme used in MFA as a preprocessing step for other chemometric methods, such as clustering, is also highlighted.     

超声换能器频率特性及匹配研究

超声换能器是一种强非线性时变系统,在不同的工作频率下其阻抗等特性差别很大.在超声换能器的应用中需要对超声换能器进行频率特性分析及阻抗匹配,以达到最高的传输效率和最佳的波形效果.详细分析了超声换能器的频率特性及匹配方式,并对超声换换能器参数进行了测试,根据测试参数设计了阻抗匹配电路.理论分析和实验测试表明,良好的频率及阻抗匹配电路有利于优化超声波发射波形,提高电声转化效率.     

一种新型基于运动补偿的自适应去隔行算法

去隔行是电视图像增强处理和视频格式转换的一项关键技术，传统的去隔行算法存在着难以克服的缺陷。文章提出了一种基于运动补偿的自适应去隔行算法，其中包括双向块匹配运动估计，消除块效应和自适应插值三个处理模块，实验证明本算法能够高质量且鲁棒地将场图像重建为帧。     

基于社会网络的语义Web服务发现模型

web服务发现模型是为了满足用户各种用途的web服务方式,以代码重入和松散耦合的方式以最优的组合实现可以提供用户需要的web服务模型。web服务发现模型是一种面向服务系统架构的一类基础性问题,但是又是解决用户不同需求十分有效的模型。通过对本体特性和发现模型的结构特点的研究,在本文中引入了本体解析的web服务标注算法和环境语义web发现模型。从而更好地实现web服务发现模型的选择用户所要求的服务的准确性,也为web服务的智能匹配做出了探索。