知网与同义词词林的信息融合研究

本文主要探讨了将知网(HowNet) 和同义词词林进行信息融合的方法。我们针对知网对词的概念描述和同义词词林对词的语义分类的特点,提出了一种词典信息融合的方法:首先为词林的每个词集确定一个与知网中DEF 类似的概念描述,在此基础上对两部词典中同时收录且均只有一个义项的词语进行双向意义联结,最后根据分类算法对两部词典中同时收录非单一义项的词语进行双向意义联结。实验表明,本文提出的处理策略达到了93 %的信息融合正确率,融合后形成的新词典兼有词林的分类学信息和知网的概念描述信息。     

一种基于GOP的MPEG-2媒体流动切割与合并方法

MPEG-2视频编码技术由于其较高的压缩比和高质量图像，在数字电视及电影等方面具有重要应用。由于编码算法相对较为复杂，迫切需要解决MPEG-2媒体流的切割和合并问题，从而实现有效的节目制作。本文正是针对MPEG-2媒体流，提出了一种基于GOP的压缩域视频分割与合并方法。通过分析媒体流的数据结构，详细蛤出了算法的原理和实现过程。最后，还通过实验证明了该方法的可行性和高效率。     

基于IEEE 1588实现变电站过程总线采样值同步新技术

介绍并分析了网络测量和控制系统的精确时钟同步协议IEEE1588,通过与目前应用广泛的网络时间协议(NTP)相比较,指出其高精度时钟同步实现机制的特殊性。针对IEC61850所定义的过程总线上采样值高精度同步要求,提出了一种基于IEEE1588的合并单元同步实现的新方案。在此方案中,利用现场可编程门阵列(FPGA)对IEEE1588同步报文时标生成点进行精确确定,IEEE1588同步协议的实现利用微控制器完成。     

A hybrid method for robust car plate character recognition

Image-based car plate recognition is an indispensable part of an intelligent traffic system. The quality of the images taken for car plates, especially for Chinese car plates, however, may sometimes be very poor, due to the operating conditions and distortion because of poor photographical environments. Furthermore, there exist some “similar” characters, such as “8” and “B”, “7” and “T” and so on. They are less distinguishable because of noises and/or distortions. To achieve robust and high recognition performance, in this paper, a two-stage hybrid recognition system combining statistical and structural recognition methods is proposed. Car plate images are skew corrected and normalized before recognition. In the first stage, four statistical sub-classifiers recognize the input character independently, and the recognition results are combined using the Bayes method. If the output of the first stage contains characters that belong to prescribed sets of similarity characters, structure recognition method is used to further classify these character images: they are preprocessed once more, structure features are obtained from them and these structure features are fed into a decision tree classifier. Finally, genetic algorithm is employed to achieve optimum system parameters. Experiments show that our recognition system is very efficient and robust. As part of an intelligent traffic system, the system has been in successful commercial use.     

PAC-Bayesian Compression Bounds on the Prediction Error of Learning Algorithms for Classification

We consider bounds on the prediction error of classification algorithms based on sample compression. We refine the notion of a compression scheme to distinguish permutation and repetition invariant and non-permutation and repetition invariant compression schemes leading to different prediction error bounds. Also, we extend known results on compression to the case of non-zero empirical risk.We provide bounds on the prediction error of classifiers returned by mistake-driven online learning algorithms by interpreting mistake bounds as bounds on the size of the respective compression scheme of the algorithm. This leads to a bound on the prediction error of perceptron solutions that depends on the margin a support vector machine would achieve on the same training sample.Furthermore, using the property of compression we derive bounds on the average prediction error of kernel classifiers in the PAC-Bayesian framework. These bounds assume a prior measure over the expansion coefficients in the data-dependent kernel expansion and bound the average prediction error uniformly over subsets of the space of expansion coefficients.Editor Shai Ben-David     

Class-specific feature polynomial classifier for pattern classification and its application to handwritten numeral recognition

The polynomial classifier (PC) that takes the binomial terms of reduced subspace features as inputs has shown superior performance to multilayer neural networks in pattern classification. In this paper, we propose a class-specific feature polynomial classifier (CFPC) that extracts class-specific features from class-specific subspaces, unlike the ordinary PC that uses a class-independent subspace. The CFPC can be viewed as a hybrid of ordinary PC and projection distance method. The class-specific features better separate one class from the others, and the incorporation of class-specific projection distance further improves the separability. The connecting weights of CFPC are efficiently learned class-by-class to minimize the mean square error on training samples. To justify the promise of CFPC, we have conducted experiments of handwritten digit recognition and numeral string recognition on the NIST Special Database 19 (SD19). The digit recognition task was also benchmarked on two standard databases USPS and MNIST. The results show that the performance of CFPC is superior to that of ordinary PC, and is competitive with support vector classifiers (SVCs).     

基于信息论的连续属性离散化

使用信息论的方法进行连续属性的离散化，引入Hellinger偏差HD（Hellinger Divergence)作为每个区间对决策的信息量度量，从而定义切分点的信息熵，最终的离散化结果是使各区间的信息量尽可能平均，分析了HD度量在两种离散化方法中的作用，说明它在划分算法中运用比较理想，而在归并算法中则有局限。     

The Relaxed Online Maximum Margin Algorithm

We describe a new incremental algorithm for training linear threshold functions: the Relaxed Online Maximum Margin Algorithm, or ROMMA. ROMMA can be viewed as an approximation to the algorithm that repeatedly chooses the hyperplane that classifies previously seen examples correctly with the maximum margin. It is known that such a maximum-margin hypothesis can be computed by minimizing the length of the weight vector subject to a number of linear constraints. ROMMA works by maintaining a relatively simple relaxation of these constraints that can be efficiently updated. We prove a mistake bound for ROMMA that is the same as that proved for the perceptron algorithm. Our analysis implies that the maximum-margin algorithm also satisfies this mistake bound; this is the first worst-case performance guarantee for this algorithm. We describe some experiments using ROMMA and a variant that updates its hypothesis more aggressively as batch algorithms to recognize handwritten digits. The computational complexity and simplicity of these algorithms is similar to that of perceptron algorithm, but their generalization is much better. We show that a batch algorithm based on aggressive ROMMA converges to the fixed threshold SVM hypothesis.