节点文献

一种改进的支持向量机在手写体汉字识别中的研究与应用

The Research of an Improved SVMs Applied in Hand-Writing Character Recognition

【作者】 袁异

【导师】 朱宁波;

【作者基本信息】 湖南大学 , 计算机应用技术, 2008, 硕士

【摘要】 模式识别是一种人工智能信息处理技术,在近年来广泛应用于文字、指纹和遥感图像识别等领域。模式识别大致分为三个过程:预处理、特征提取、识别。预处理完成的是前期工作,对获取的待识别图像进行二值化、平滑、细化等图像规范化操作使得更易进行下步的识别操作。特征提取过程将输入对象的识别特征作为特征空间的一个点或一个特征矢量提取出来。识别完成最后的分类,这个过程将前面提取出来的特征矢量用分类器进行分类,通过决策函数得到最后的分类结果。本文主要研究的是识别过程中近年来应用较为广泛的一种分类器:支持向量机(SVM)。支持向量机是在统计学习理论的基础上发展而来的一种机器学习方法,在解决小样本、非线性及高维模式识别问题中表现出了许多特有的优势,但是传统的SVM存在很多亟待解决的问题:1)SVM核函数及其参数的选择没有固定的标准;2)SVM只能解决二类样本问题,无法解决实际情况中的多类分类问题。遗传算法(GA)是一种搜索寻优算法,摒弃了传统优化方法的搜索方式,模拟自然界生物进化过程,采用人工进化的方式对目标空间进行随机化搜索。遗传算法对求解问题本身一无所知,所需要的仅是对算法产生的每个个体进行评价,通过作用于个体上的基因,寻找更好的个体来求解问题。遗传算法这种进化搜索的优点,能在多代搜索中寻求最适合的SVM核函数参数,较好的解决了SVM参数没有固定标准的问题。同时,将SVM用正态树形层次集成起来,进行多次二类分类,从而达到多类分类的目的。汉字识别是用计算机自动辨识印刷在纸上或人写在纸上的汉字,学科上属于模式识别和人工智能的范畴。在当今信息发展一日千里的时代,越来越多时候面临将手写文字录入计算机系统处理的需要,这就迫使手写字符识别成为一个亟待解决的问题。本文结合遗传算法和正态二叉树改进支持向量机构成GA-SVMs,将这种改进的支持向量机应用在手写体汉字识别上,开发出一套手写体汉字识别系统。GA-SVMs摒弃了传统的SVM参数不确定的缺陷,能快速的搜寻最优SVM,在分类正确率上有一定的提高,同时改进了传统SVM只能二类识别的不足。实验证明,GA-SVMs对整个识别功能及结果来说有较好的表现,对传统的SVM有较好的改进。

【Abstract】 Pattern recognition is an information processing technique of artificial intelligen -ce, which is recently widely applied in many fields such as letter recognition, finger mark recognition and remote sensing image recognition. The process of pattern recognition is approximately divided into three steps: preprocessing, character distilling and recognition. Preprocessing finishes the prophase job to make it easier to do the following recognizing work, which includes binarization, smoothness and refinement such image standardization operations. Character distilling distills recognizing character of the input object as a point or a character vector. Recognition completes the classification which classifies the above-mentioned character vector by classifier which gets the final result by decision-making function.The paper mainly researches a traditional classifier: support vector machine (SVM) which is diffusely used in recent years. Support vector machine is a machine learning method developing from the basic of statistic learning theory, which shows special superiorities in dealing problems of small sample, nonlinear and multidimen -sional recognitions. But there are many problems that need to be settled immediately in the traditional SVM: 1) There are no fixed standardizations in the selection of kernel functions and parameters of SVM; 2) SVM can only deal with the two-sample problem and can do nothing for the multi-classification problem. Genetic algorithm (GA) is a useful algorithm to search the optimal solution which imitates the natural evolution process of life and searches randomly in the objective space with artificial evolution mode, discarding the traditional optional search method. Genetic algorithm demands nothing for question itself but need to estimate every object generated by algorithm and to search the optimal object to settle problems through gene effecting on object. The evolutional searching advantage of genetic algorithm can help search the appropriate kernel function parameters of SVM in the multi-generation search that best resolves the problem of no fixed standardization for SVM parameters. At the same time, we can get the result of multi-classification by integrating SVM to normal trees mode.Chinese character recognition identifies the characters by computer that is printed or written down on paper, which belongs to the field of pattern recognition and artificial intelligence. Nowadays with the information technique developing so fast, more and more hand-writing characters are needed to be handled by computer system which makes it a serious problem to find a best way to recognize hand-writing characters.The paper presents GA-SVMs combining GA algorithm and normal tree and develops a hand-writing recognition system which applies this improved SVM. GA-SVMs can quickly find the optimal SVM parameters which enhances the accuracy of classification. Totally speaking, GA-SVMs represent elevation in accuracy of classification by study and experiments.

  • 【网络出版投稿人】 湖南大学
  • 【网络出版年期】2008年 12期
  • 【分类号】TP391.41
  • 【被引频次】2
  • 【下载频次】218
节点文献中: 

本文链接的文献网络图示:

本文的引文网络