基于子词链的中文新闻广播故事自动分割*

提出了一种基于子词链的中文新闻广播故事自动分割方法。利用中文同音异形字众多、词典开放、分词多样和组词灵活等特点,在新闻广播的语音识别抄本上采用中文子词单元（汉字和音节）创建子词链,进行中文新闻广播故事的自动分割,有效地解决了在传统词链方法中由于语音识别错误（特别是词典未收录词汇）导致的相关联词之间无法匹配的问题。同时,利用各级词汇表示单元之间的互补性,如词的表义确定性和子词对语音识别错误的鲁棒性,对各级词汇进行融合,利用不同级别词汇表示单元的优势进一步提高中文新闻广播故事分割的性能。在TDT2中文标准新闻     

基于多尺度轮廓段的形状特征提取与识别

形状识别是计算机视觉与模式识别领域的重要研究内容。形状的特征选取与描述是形状识别的研究热点。针对现有识别方法的不足，提出一种通过对不同长度轮廓段进行描述，进行特征提取的方法。对每个形状均在6种尺度下进行特征提取，每种尺度选取5种轮廓段特征参数，实现了对形状的特征描述。在形状识别阶段，使用动态时间规整（DTW）算法度量形状描述子之间的匹配距离，实现形状识别。分别在Kimia99、Kimia216和MPEG-7数据库中进行算法验证，结果表明基于多尺度轮廓段的形状特征描述子具有旋转、缩放、平移和局部遮挡不变性，识别率优于现有算法。     

Farsi/Arabic handwritten digit recognition using quantum neural networks and bag of visual words method

Handwritten digit recognition has long been a challenging problem in the field of optical character recognition and of great importance in industry. This paper develops a new approach for handwritten digit recognition that uses a small number of patterns for training phase. To improve performance of isolated Farsi/Arabic handwritten digit recognition, we use Bag of Visual Words (BoVW) technique to construct images feature vectors. Each visual word is described by Scale Invariant Feature Transform (SIFT) method. For learning feature vectors, Quantum Neural Networks (QNN) classifier is used. Experimental results on a very popular Farsi/Arabic handwritten digit dataset (HODA dataset) show that proposed method can achieve the highest recognition rate compared to other state of the arts methods.     

基于多尺度的轮廓匹配方法

物体的形状轮廓是计算机视觉中一个重要的特征。该文提出了一种基于多尺度下局部特征的描述和动态规划的形状匹配和识别方法。考虑到轮廓在不同尺度下特征点的变化,给出了形状的多尺度描述方法。在轮廓分段匹配过程中,根据噪声和形变的程度不同对局部轮廓分别采用不同尺度滤波,避免了局部形变及噪声导致错误的匹配结果。该算法对于噪声、形变和适度的遮挡有较好鲁棒性,用于行人识别上取得了较好的效果。     

基于子字单元的维吾尔语语音识别研究

为提高维吾尔语语音识别的识别率,在分析维吾尔语特点的基础上,设计一种基于子字单元的维吾尔语语音识别总体结构,指出维吾尔语单词的发音模型,给出构建子字发音字典的方法,及其以子字单元为基础构建语言模型与声学模型的方法。在一个语音库上进行实验,采用一种非监督的词切分方法对维吾尔语单词进行词切分,生成子字。实验结果表明,基于子字单元的维吾尔语语音识别可以获得更好的识别结果。     

A new benchmark on the recognition of handwritten Bangla and Farsi numeral characters

The recognition of Indian and Arabic handwriting is drawing increasing attention in recent years. To test the promise of existing handwritten numeral recognition methods and provide new benchmarks for future research, this paper presents some results of handwritten Bangla and Farsi numeral recognition on binary and gray-scale images. For recognition on gray-scale images, we propose a process with proper image pre-processing and feature extraction. In experiments on three databases, ISI Bangla numerals, CENPARMI Farsi numerals, and IFHCDB Farsi numerals, we have achieved very high accuracies using various recognition methods. The highest test accuracies on the three databases are 99.40%, 99.16%, and 99.73%, respectively. We justified the benefit of recognition on gray-scale images against binary images, compared some implementation choices of gradient direction feature extraction, some advanced normalization and classification methods.     

基于SC特征的叶片图像识别研究

提出一种基于改进SC形状上下文描述子的叶片图像特征提取方法。利用颜色聚类分割图像,使用Ostu算子实现二值化处理,提取图像边缘轮廓,结合形状上下文(SC)描述子提取图像轮廓特征,计算匹配代价矩阵,利用匈牙利算法获得最小匹配代价。结果表明该算法具有较高的识别准确度。     

基于词根的中国手语识别方法

迄今为止，手语识别面临的最大问题是如何解决词汇集易扩充的连续识别，提出一种大词汇量连续中国手语识别方法，将词根作为识别基元，由于基元的数目是有限的，因此基于HMM的手语信号的训练和识别变得比较容易处理，可以实现更大词汇量的识别。除此之外，所提方法还有利于实现手势语和手指语的混合识别。从中国手语中共整理现2400多个词根，为每个词根建一个并行的HMM模型，对各数据流的HMM模型进行聚集，确定出手识别的基元。根据这些基元对手妫刻苦骊，并建立了树状搜索网络，使用状态垄点上高斯密度函数聚类、语言模型和N－Best方法提高系统的速度和精度。对5119个手语词做了实验，连续语句的识别率可在90％以上。     

基于特征点和最小面积的曲线描述和匹配

为了对关键特征点相同而子曲线曲率不同的曲线进行识别,提出一种新的平面曲线的描述和匹配方法。基于关键特征点进行粗匹配,根据精度要求设定最小面积阈值在子曲线上重新采样点,定义了一种新的采样点的识别向量,并根据子曲线上采样点的识别向量构造了新的识别向量矩阵,最后根据识别向量矩阵的差异度度量子曲线的相似性。通过对所有子曲线的识别实现对整条曲线的识别。该识别方法逐层筛选、由粗到精,避免了冗余操作。实验表明该方法高效、可行。     

结合轮廓与形状特征的仿射形状匹配

目的 针对仿射变换下形状匹配中存在的描述子对形状的描述能力不足,以及描述子计算耗时大的问题,改进基于所有图像点投影的方法,提出一种利用轮廓计算投影面积的仿射形状匹配算法。方法 该算法分为粗匹配和精匹配两个阶段。粗匹配阶段以CSS角点作为备选特征点,首先统计轮廓投影面积分布作为特征点描述子;然后利用动态规划蚁群算法匹配两幅图片公共特征点序列,并将匹配好的特征点序列记为对应的新特征点;最后采用该新特征点划分目标曲线,得到对应的轮廓曲线;这一阶段的目的是对形状的筛选以及寻找一致的轮廓特征点,同时完成轮廓曲线的划分。精匹配阶段,采用小波仿射不变描述子,对粗匹配阶段匹配代价最小的5%的目标进行对应曲线匹配,得到精匹配阶段的匹配代价,从而实现对仿射目标的识别;精匹配弥补了描述子对轮廓细节描述不足的问题。结果 算法的平均检索速度比传统基于形状投影分布描述子提高44.3%,在MPEG-7图像库上的检索效果为98.65%,在MPEG-7仿射图像库上的查准率与查全率综合评价指标比传统的基于形状投影分布描述子高3.1%,比形状上下文高25%。结论 本文算法匹配效果好,效率高,抗噪性强,解决了仿射描述子计算速度慢、描述能力不足的问题,能有效地应用于仿射形状匹配与检索领域。     

Lexicon-driven segmentation and recognition of handwritten character strings for Japanese address reading

This paper describes a handwritten character string recognition system for Japanese mail address reading on a very large vocabulary. The address phrases are recognized as a whole because there is no extra space between words. The lexicon contains 111,349 address phrases, which are stored in a trie structure. In recognition, the text line image is matched with the lexicon entries (phrases) to obtain reliable segmentation and retrieve valid address phrases. The paper first introduces some effective techniques for text line image preprocessing and presegmentation. In presegmentation, the text line image is separated into primitive segments by connected component analysis and touching pattern splitting based on contour shape analysis. In lexicon matching, consecutive segments are dynamically combined into candidate character patterns. An accurate character classifier is embedded in lexicon matching to select characters matched with a candidate pattern from a dynamic category set. A beam search strategy is used to control the lexicon matching so as to achieve real-time recognition. In experiments on 3,589 live mail images, the proposed method achieved correct rate of 83.68 percent while the error rate is less than 1 percent.     

Farsi/Arabic handwritten digit recognition based on ensemble of SVD classifiers and reliable multi-phase PSO combination rule

The problem of handwritten digit recognition has long been an open problem in the field of pattern classification and of great importance in industry. The heart of the problem lies within the ability to design an efficient algorithm that can recognize digits written and submitted by users via a tablet, scanner, and other digital devices. From an engineering point of view, it is desirable to achieve a good performance within limited resources. To this end, we have developed a new approach for handwritten digit recognition that uses a small number of patterns for training phase. To improve the overall performance achieved in classification task, the literature suggests combining the decision of multiple classifiers rather than using the output of the best classifier in the ensemble; so, in this new approach, an ensemble of classifiers is used for the recognition of handwritten digit. The classifiers used in proposed system are based on singular value decomposition (SVD) algorithm. The experimental results and the literature show that the SVD algorithm is suitable for solving sparse matrices such as handwritten digit. The decisions obtained by SVD classifiers are combined by a novel proposed combination rule which we named reliable multi-phase particle swarm optimization. We call the method “Reliable” because we have introduced a novel reliability parameter which is applied to tackle the problem of PSO being trapped in local minima. In comparison with previous methods, one of the significant advantages of the proposed method is that it is not sensitive to the size of training set. Unlike other methods, the proposed method uses just 15 % of the dataset as a training set, while other methods usually use (60–75) % of the whole dataset as the training set. To evaluate the proposed method, we tested our algorithm on Farsi/Arabic handwritten digit dataset. What makes the recognition of the handwritten Farsi/Arabic digits more challenging is that some of the digits can be legally written in different shapes. Therefore, 6000 hard samples (600 samples per class) are chosen by K-nearest neighbor algorithm from the HODA dataset which is a standard Farsi/Arabic digit dataset. Experimental results have shown that the proposed method is fast, accurate, and robust against the local minima of PSO. Finally, the proposed method is compared with state of the art methods and some ensemble classifier based on MLP, RBF, and ANFIS with various combination rules.     

一种基于轮廓特征点的图像检索方法

传统基于形状的图像检索方法检索效率较低,针对该问题,提出一种基于对象轮廓特征点的图像检索方法。利用Mean Shift算法提取感兴趣对象,以对象曲率的局部极值点作为特征点,并将对象表示为这些特征点的特征向量,定义检索对象与被检索对象特征向量间的距离匹配机制,实现对象的匹配或识别。实验结果表明,与传统方法相比,该方法具有较高的查全率和查准率。     

基于曲率匹配的细胞几何形状特征提取方法

细胞轮廓的几何形状是细胞学涂片判读的重要参考,对研究宫颈病变的计算机辅助诊断具有重要意义。针对现有基于形状模板匹配的几何形状识别方法鲁棒性较差的问题,提出了基于曲率匹配的几何形状特征提取方法,通过比较模板轮廓和待识别轮廓的曲率,计算曲率曲线之间的相似度,进而得到细胞轮廓的形状特征,并采用依次旋转轮廓选取最佳匹配的方法来解决轮廓方向不一致的问题,采用以面积等效圆的半径比作为放大比率进行轮廓缩放的方法来解决轮廓大小不一致的问题。通过相关实验证明了该方法所提取的几何形状特征具有尺度不变性和旋转不变性,并与改进Hausdorff距离进行了实验对比,结果表明提取的形状特征能更加准确地识别出细胞轮廓的几何形状。