Combination of Multiple Classifiers for Chinese Recognition多分类器组合分类器在中文识别中的研究.ppt

下载文档 降价啦

1
0
约1.68万字
约 23页
2016-12-30 发布于上海
举报
版权申诉
保障服务

Combination of Multiple Classifiers for Chinese Recognition多分类器组合分类器在中文识别中的研究.ppt

1、本文档共23页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

Template-Based Classification Method forChinese Character Recognition Presenter: Tienwei Tsai Department of Informaiton Management, Chihlee Institute of Technology Date:2005/12/10 Outline Introduction The proposed classification approach Experiments and Discussions Conclusions 1. Introduction Paper documents - Computer codes OCR(Optical Character Recognition) The design of classification systems consists of two subproblems: Feature extraction Classification Classification Classification of objects (or patterns) into a number of predefined classes has been extensively studied in wide variety of applications such as Optical character recognition (OCR) Speech recognition Face recognition Feature extraction Features are functions of the measurements that enable a class to be distinguished from other classes. It has not found a general solution in most applications. Our purpose is to design a general classification scheme, which is less dependent on domain-specific knowledge. Two philosophies of classification Statistical The measurements that describe an object are treated only formally as statistical variables, neglecting their “meaning” Structural Regard objects as compositions of structural units, usually called primitives. Template matching “Template matching” is one of the most popular techniques for visual pattern recognition. We can store a template in the computer for each distinct class of characters to be recognized, and to compare the unknown characters with the stored set to find the best matching. Suppose that the character images are two-tone – all black on white backgrounds. The matching degree can be calculated by counting their matching bits, which is known as the Hamming distance criterion. However, this kind of global Boolean template is unreliable. It is because the bits along the edge of a character image are often subject to unpredictable variations and noises. This paper presents a template-based classification approach