彩色自然纹理分类识别的研究

为了建立描述彩色自然纹理的参数体系,选用木材纹理这种典型彩色自然纹理为研究对象,提取了木材图像颜色矩和高斯-马尔可夫特征参数,采用改进的模拟退火算法进行了特征优化筛选及特征级参数融合,得到纹理参数体系并进行分类识别实验,识别率为97.25％,明显高于融合前单参数体系.研究表明用该参数体系对彩色木材纹理进行分类识别是可行的,也可用于与其相近彩色自然纹理的分类识别.     

Multi-sensor information fusion estimators for stochastic uncertain systems with correlated noises

The information fusion estimation problems are investigated for multi-sensor stochastic uncertain systems with correlated noises. The stochastic uncertainties caused by correlated multiplicative noises exist in the state and observation matrices. The process noise and the observation noises are one-step auto-correlated and two-step cross-correlated, respectively. While the observation noises of different sensors are one-step cross-correlated. The optimal centralized fusion filter, predictor and smoother are proposed in the linear minimum variance sense via an innovative analysis approach. To enhance the robustness and flexibility, a distributed fusion filter is put forward, which requires the calculation of filtering error cross-covariance matrices between any two local filters. To avoid the calculation of cross-covariance matrices, another distributed fusion filter is also presented by using the covariance intersection (CI) fusion algorithm, which can reduce the computational cost. A simulation example is given to show the effectiveness of the proposed algorithms.     

基于特征参数归一化的鲁棒语音识别方法综述

目前,自动语音识别系统往往会因为环境中复杂因素的影响,造成训练环境和测试环境存在不匹配现象,使得识别系统性能大幅度下降,极大地限制了语音识别技术的应用范围。近年来,很多鲁棒语音识别技术成功地被提出,这些技术的目标都是相同的,主要是提高系统的鲁棒性,进而提高识别率。其中,基于特征的归一化技术简单而有效,常常被作为鲁棒语音识别的首选方法,它主要是通过对特征向量的统计属性、累积密度函数或功率谱的归一化来补偿环境不匹配产生的影响。该文主要对目前主流的归一化方法进行介绍,其中包括倒谱矩归一化方法、直方图均衡化方法以及调频谱归一化方法等。     

Face recognition using adaptively weighted patch PZM array from a single exemplar image per person

Though numerous approaches have been proposed for face recognition, little attention is given to the moment-based face recognition techniques. In this paper we propose a novel face recognition approach based on adaptively weighted patch pseudo Zernike moment array (AWPPZMA) when only one exemplar image per person is available. In this approach, a face image is represented as an array of patch pseudo Zernike moments (PPZM) extracted from a partitioned face image containing moment information of local areas instead of global information of a face. An adaptively weighting scheme is used to assign proper weights to each PPZM to adjust the contribution of each local area of a face in terms of the quantity of identity information that a patch contains and the likelihood of a patch is occluded. An extensive experimental investigation is conducted using AR and Yale face databases covering face recognition under controlled/ideal conditions, different illumination conditions, different facial expressions and partial occlusion. The system performance is compared with the performance of four benchmark approaches. The encouraging experimental results demonstrate that moments can be used for face recognition and patch-based moment array provides a novel way for face representation and recognition in single model databases.     

Faster ARMA maximum likelihood estimation

A new likelihood based AR approximation is given for ARMA models. The usual algorithms for the computation of the likelihood of an ARMA model require O(n) flops per function evaluation. Using our new approximation, an algorithm is developed which requires only O(1) flops in repeated likelihood evaluations. In most cases, the new algorithm gives results identical to or very close to the exact maximum likelihood estimate (MLE). This algorithm is easily implemented in high level quantitative programming environments (QPEs) such as Mathematica, MatLab and R. In order to obtain reasonable speed, previous ARMA maximum likelihood algorithms are usually implemented in C or some other machine efficient language. With our algorithm it is easy to do maximum likelihood estimation for long time series directly in the QPE of your choice. The new algorithm is extended to obtain the MLE for the mean parameter. Simulation experiments which illustrate the effectiveness of the new algorithm are discussed. Mathematica and R packages which implement the algorithm discussed in this paper are available [McLeod, A.I., Zhang, Y., 2007. Online supplements to “Faster ARMA Maximum Likelihood Estimation”, 〈http://www.stats.uwo.ca/faculty/aim/2007/faster/〉]. Based on these package implementations, it is expected that the interested researcher would be able to implement this algorithm in other QPEs.     

The Impact of Speculative Execution on SMT Processors

By executing two or more threads concurrently, Simultaneous MultiThreading (SMT) architectures are able to exploit both Instruction-Level Parallelism (ILP) and Thread-Level Parallelism (TLP) from the increased number of in-flight instructions that are fetched from multiple threads. However, due to incorrect control speculations, a significant number of these in-flight instructions are discarded from the pipelines of SMT processors (which is a direct consequence of these pipelines getting wider and deeper). Although increasing the accuracy of branch predictors may reduce the number of instructions so discarded from the pipelines, the prediction accuracy cannot be easily scaled up since aggressive branch prediction schemes strongly depend on the particular predictability inherently to the application programs. In this paper, we present an efficient thread scheduling mechanism for SMT processors, called SAFE-T (Speculation-Aware Front-End Throttling): it is easy to implement and allows an SMT processor to selectively perform speculative execution of threads according to the confidence level on branch predictions, hence preventing wrong-path instructions from being fetched. SAFE-T provides an average reduction of 57.9% in the number of discarded instructions and improves the instructions per cycle (IPC) performance by 14.7% on average over the ICOUNT policy across the multi-programmed workloads we simulate. This paper is an extended version of the paper, “Speculation Control for Simultaneous Multithreading,” which appeared in the Proceedings of the 18th International Parallel and Distributed Processing Symposium, Santa Fe, New Mexico, April 2004.     

一种新的基于Zernike正交矩亚像素边缘定位的直径测量方法

提出了一种新的基于亚像素边缘定位技术的棒状物体直径测量方法;该方法利用两个CCD摄像头,分别获得两张棒状物体横截面的椭圆特征图像,利用仿射变换将灰度椭圆特征图像变换成圆形特征图像,然后利用亚像素中的Zernike正交矩对边缘进行精确定位,进而分别计算出棒状物体的直径,再将两个测量数据加以平均融合,完成对直径的测量;实验结果表明,与像素级方法相比较,该方法定位精度高,测量误差小,能够达到提高测量精度的目的。     

基于椭圆曲线的盲数字签名及其身份识别

椭圆曲线密码体制以其特有的优越性被广泛用于进行数据加密和构建数字签名方案。同样,它也可以用来构建盲数字签名方案。介绍了椭圆曲线密码体制的相关知识,基于求解椭圆曲线离散对数问题的困难性,设计了一种基于椭圆曲线离散对数问题的盲数字签名方案,并在此基础上设计了一种身份识别协议,该方案可以同时满足盲数字签名的正确性、匿名性、不可伪造性和不可追踪性等特性要求。从理论上分析该方案是安全的,并具有一定的实用价值。     

Additional bending moment analysis of the trigeminal universal joint installed by single or twin radial bearing北大核心CSCD

To find out the causes of vibration and noise of the trigeminal universal joint which appeared in the installation and use process, the additional moment distribution with the varies of the input shaft angular and the deflection angle was analyzed. Kinematics diagrams of the trigeminal universal joint when the output shaft installed by single radial bearing or twin radial bearing were established. The system coordinates were established under the two installation ways, and the motion equations were established by the direction cosine matrix tools. It indicated that the trigeminal universal joint installed by the single radial bearing was an approximately isometric speed transmission, and was a constant velocity transmission with twin radial bearing installed. Furthermore, the additional moment component on the input shaft and the output shaft was analyzed under the two installation ways. According to the virtual displacement principle, the additional moment on the tripod universal joint when the output shaft installed by twin radial bearing and single radial bearing were determined. When installed by single radial bearing, the deflection moment exists and the vibration frequency of additional moment was three times of the input shaft as a sine curve. The variation trend of the additional moment was straight up with the increase of deflection angle. When installed by twin radial bearing, the deflection moment was zero and the additional moment increased gradually with the increase of deflection angle but did not fluctuate. The analysis revealed that additional moment existed in the trigeminal universal joint system under both installation ways would produce bending vibration. This study is of great significance to study the causes of vibration and determine the nonlinear dynamics of the system.     

Robust metric calibration of non-linear camera lens distortion

Camera lens distortion is crucial to obtain the best performance cameral model. Up to now, different techniques exist, which try to minimize the calibration error using different lens distortion models or computing them in different ways. Some compute lens distortion camera parameters in the camera calibration process together with the intrinsic and extrinsic ones. Others isolate the lens distortion calibration without using any template and basing the calibration on the deformation in the image of some features of the objects in the scene, like straight lines or circles. These lens distortion techniques which do not use any calibration template can be unstable if a complete camera lens distortion model is computed. They are named non-metric calibration or self-calibration methods.Traditionally a camera has been always best calibrated if metric calibration is done instead of self-calibration. This paper proposes a metric calibration technique which computes the camera lens distortion isolated from the camera calibration process under stable conditions, independently of the computed lens distortion model or the number of parameters. To make it easier to resolve, this metric technique uses the same calibration template that will be used afterwards for the calibration process. Therefore, the best performance of the camera lens distortion calibration process is achieved, which is transferred directly to the camera calibration process.