基于折线切分路径的粘连搭接字符切分算法的研究

针对粘连和搭接字符切分算法的不足,提出一种基于折线切分路径的字符切分算法。该算法利用投影法将粘连搭接字符与非粘连搭接字符分离开,而后结合粘连搭接字符独有的外形特征,通过引入惩罚权重的路径搜索算法快速而准确地得到粘连搭接字符间的折线切分路径;为了避免一些字符在以上的切分过程中被误切碎,利用识别反馈信息对一些字符子图像进行合并。实验结果表明,该算法对印刷体日英混排字符切分有很强的适应性,取得了较理想的切分效果。     

一种视频中字符的集成型切分与识别算法

视频文本行图像识别的技术难点主要来源于两个方面: 1)粘连字符的切分与识别问题; 2)复杂背景中字符的切分与识别问题. 为了能够同时切分和识别这两种情况中的字符, 提出了一种集成型的字符切分与识别算法. 该集成型算法首先对文本行图像二值化, 基于二值化的文本行图像的水平投影估计文本行高度. 其次根据字符笔划粘连的程度, 基于图像分析或字符识别对二值图像中的宽连通域进行切分. 然后基于字符识别组合连通域得到候选识别结果, 最后根据候选识别结果构造词图, 基于语言模型从词图中选出字符识别结果. 实验表明该集成型算法大大降低了粘连字符及复杂背景中字符的识别错误率.     

基于滑动窗口的印刷体数学公式中粘连字符的切分

在印刷体数学公式识别中，不能很好地切分粘连字符是造成识别错误的主要原因。针对这种情况，提出了一种基于滑动窗口切分粘连字符的方法。通过特征值比较．提取出粘连字符，然后对粘连字符切分。实验表明，这种方法使识别率得到了提高。     

手写中文信封的地址行字符切分算法

在手写体中文信封处理系统中,地址行字符切分是实现地址行识别的关键步骤。本文根据邮政信封地址行字符的特点,有针对性的提出了一种字符切分算法。首先对地址行图像利用投影、求连通区域、笔划穿越数分析等基于字符结构的方法进行初始切分,得到基本字段序列;然后通过对相邻的基本字段进行组合形成多条候选切分路径,再通过识别的可信度和邮政目标地址库的先验知识信息对路径进行评价分析,从而得到最优的切分路径。该算法经过邮政分拣机采集的实际信封图像测试,纯地址行识别正确率达到78.61%,地址行识别与邮政编码识别相结合的分拣正确率达到95.42%。     

多知识综合判决的字符切分算法

高性能的印刷体文字识别系统中,在单字识别技术比较成熟的条件下,字符切分成为比较关键的环节。字符切分可以看作是对字符边界正确切分位置的一个决策过程,该决策需要同时考虑字符局部的识别情况和全局的上下文关系。该文通过对中日韩三国文字字符切分的研究,提出一种基于多知识综合判决的字符切分算法。该算法成功应用于AsiaOCR项目,对于东方文字中常见的混排英文问题也能很好处理。实验结果表明,和以前的算法相比,新算法在中日韩三国文字识别系统中的切分错误率平均下降50%。     

一种有效的手写汉字多步分割方法

在字符识别系统中,字符的有效分割是识别的关键。针对手写汉字字间距及字内距无规则可循,字符间极易发生粘连、交错等现象,提出一种多步分割方法。该方法首先利用Viterbi算法将原字符串切分成互不连通的分割块,使非粘连汉字、交错汉字得到正确分割;对于其中宽度较大存在粘连字符的分割块,从候选分割点入手,用非线性分割路径将粘连部分分开;最后再应用A*算法找到全局最佳分割位置,使过分割的字符得到完整合并。实验结果表明,该方法对于手写汉字的分割是可行、有效的。     

高性能的多体印刷英文识别系统的实现

提高低质量文本图像的识别率是现今文字识别研究的重要方向。文章对倾斜文本行的切分算法,断裂、粘连、交叠字符的切分算法以及后处理作了较为深入的研究,提出一些新的算法。该系统能够识别多达260种字体,包括黑体、斜体等字体,对训练集的识别率达到98.5%,并在实际应用中取得了良好效果。     

基于连通域的汉字切分技术研究

字符切分技术已经成为汉字识别系统设计中的关键问题,对于质量较差的文本图像,用灰度图像取代传统的二值化黑白图像能够取得更好的切分效果,基于连通域的切分算法能够对灰度图像进行较好的切分,基于连通域的汉字切分算法能有效地对文本图像中汉字字符部件进行合并及对粘连字符进行分割。     

粘连字符切分综述

字符切分是字符识别系统的一个重要环节。粘连则是指字符图像问有笔画接触的情况，它普遍存在于手写和低质量的印刷文档中。然而普通切分算法很难处理粘连字符。本文综述了主要的粘连字符切分算法以及切分路径的评价方法，在详细介绍算法流程的基础上，对每种算法的优缺点以及粘连字符切分的未来工作进行了探讨。     

基于轮廓特征的印刷公式粘连符号的切分

在印刷体数学公式识别中,不能准确地切分粘连符号是造成识别错误的主要原因之一。针对这种情况,提出了一种基于轮廓特征切分粘连符号的方法。根据轮廓特征及宽高比形成切分路径,然后对粘连字符切分。实验表明,这种方法使识别率得到了明显提高。     

一种基于模糊规则的手写体粘连数字串分割

手写数字串切分是手写数字OCR系统中必不可少的组成部分.实际应用中一般用框格对数字的书写范围进行约束,切分过程比较容易,如果没有框格约束,手写数字串的切分就成为一个难题.针对无约束的手写数字串切分的难点,提出了一种新的粘连数字串切分方法.该方法先使用主曲线实现字符模板的笔画抽取,然后依据字符笔画的模糊特征处理笔画,最后以字符识别器提供的置信度为依据完成切分过程.为验证该新切分方法的效果.对从银行实地采集的3 000份真实支票进行了切分实验,其中363张支票存在粘连现象,切分正确率为89.68%.实验结果表明,该算法能够有效地切分多字粘连的手写体数字串.     

Segmentation-recognition algorithm for zip code field recognition

This paper describes a recognition algorithm for zip code field recognition. The algorithm consists of an initial character segmentation algorithm and a connected-numeral splitting algorithm. The initial character segmentation algorithm employs connected component analysis with component merge technique based on proximity. The numeral splitting algorithm consists of a slant splitting algorithm based on discriminant analysis and two postprocessing algorithms based on local shape analysis. The splitting algorithm is integrated with a statistical classifier to form a segmentation-recognition algorithm to resolve the ambiguity of connected numeral splitting. The performance is tested by recognition experiments on zip code fields collected from real USPS mail envelopes.     

A genetic framework using contextual knowledge for segmentation and recognition of handwritten numeral strings

For the first time, a genetic framework using contextual knowledge is proposed for segmentation and recognition of unconstrained handwritten numeral strings. New algorithms have been developed to locate feature points on the string image, and to generate possible segmentation hypotheses. A genetic representation scheme is utilized to show the space of all segmentation hypotheses (chromosomes). For the evaluation of segmentation hypotheses, a novel evaluation scheme is introduced, in order to improve the outlier resistance of the system. Our genetic algorithm tries to search and evolve the population of segmentation hypotheses, and to find the one with the highest segmentation/recognition confidence. The NIST NSTRING SD19 and CENPARMI databases were used to evaluate the performance of our proposed method. Our experiments showed that proper use of contextual knowledge in segmentation, evaluation and search greatly improves the overall performance of the system. On average, our system was able to obtain correct recognition rates of 95.28% and 96.42% on handwritten numeral strings using neural network and support vector classifiers, respectively. These results compare favorably with the ones reported in the literature.     

中文日期词的分割与识别

非限定性手写汉字串的分割与识别是当前字符识别领域中的一个难点问题.针对手写日期的特点,提出了整词识别和定长汉字串分割识别相结合的组合识别方法.整词识别将字符串作为一个整体进行识别,无需复杂的字符串分割过程.在定长汉字串分割过程中,首先通过识别来预测汉字串的长度,然后通过投影和轮廓分析确定候选分割线,最后通过识别选取最优分割路径.这两种分割识别方法通过规则进行组合,大大提高了系统的性能.在真实票据图像上的实验表明了该方法的有效性,分割识别正确率达到了93.3%.     

SEPARATION OF SINGLE-TOUCHING HANDWRITTEN NUMERAL STRINGS BASED ON STRUCTURAL FEATURES

In this paper, we develop a new method to separate single-touching handwritten numeral strings with two numerals using structural features. A binary image of a single-touching handwritten numeral string is preprocessed with an efficient algorithm for smoothing, linearization and detection of structural points of image contours. The touching region of a single-touching handwritten numeral string is determined based on distribution of the structural points in the handwritten numeral string. A candidate touching point is preselected based on the geometrical information of a special structural point in the touching region. In some cases, the left or right lateral numeral of a single-touching handwritten numeral string can be recognized. The recognition information can be utilized to correct the position of the candidate touching point. We have tested our method on image samples taken from the U.S. National Institute of Science and Technology (NIST) database. We used 500 sample images for training and obtained a correct separation rate of 99.1%. For 3287 test samples not used for training the correct separation rate was 97.2%.     

Multi-oriented touching text character segmentation in graphical documents using dynamic programming

The touching character segmentation problem becomes complex when touching strings are multi-oriented. Moreover in graphical documents sometimes characters in a single-touching string have different orientations. Segmentation of such complex touching is more challenging. In this paper, we present a scheme towards the segmentation of English multi-oriented touching strings into individual characters. When two or more characters touch, they generate a big cavity region in the background portion. Based on the convex hull information, at first, we use this background information to find some initial points for segmentation of a touching string into possible primitives (a primitive consists of a single character or part of a character). Next, the primitives are merged to get optimum segmentation. A dynamic programming algorithm is applied for this purpose using the total likelihood of characters as the objective function. A SVM classifier is used to find the likelihood of a character. To consider multi-oriented touching strings the features used in the SVM are invariant to character orientation. Experiments were performed in different databases of real and synthetic touching characters and the results show that the method is efficient in segmenting touching characters of arbitrary orientations and sizes.     

一种新的货运列车车号分割算法

在对现有的货运列车车号分割算法及相关字符分割算法对比研究的基础上,文中提出并实现了一种新的货运列车车号分割算法。根据上下轮廓特征初步确定车号字符串图像的候选分割位置,然后根据字符尺寸比例和数字的弧特征,对断裂字符进行合并和对粘连字符进行再分割。该方法巧妙地避免了传统的投影分析分割法中处理粘连字符的难题,也避免了噪声对连通域的影响。与传统方法相比,具有较好的鲁棒性,达到了较高的精度和运行效率,为整个车号识别系统的精确性和稳定性提供了保障。     

质量退化的车牌字符分割方法

提出一种车牌字符分割方法．首先，进行光照不均校正、对比度增强和倾斜校正；其次，对字符外轮廓垂直距离采用尺度自适应三次B样条小波变换进行字符的粗分割；最后，应用基于目标占有率模板匹配的字符识别反馈进行字符的精分割．实验结果表明，文中方法对光照不均、对比度较小、倾斜、污迹、字符粘连和断裂等严重退化的车牌图像具有很好的字符分割性能．