基于几何特征点的身份证号码识别以及在二代身份证检证系统中的应用
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
  • 英文题名:Number Recognition Based on Geometrical Feature Points and Application to Quality Control of ID Card Manufacturing
  • 作者:王小芳
  • 论文级别:硕士
  • 学科专业名称:计算数学
  • 学位年度:2004
  • 导师:周蕴时 ; 张树功
  • 学科代码:070102
  • 学位授予单位:吉林大学
  • 论文提交日期:2004-04-01
摘要
模式识别(Pattern Recognition)技术是信号处理与人工智能的一个重要分支,是当代高科技研究与应用的主要领域之一。机器字符识别是计算机智能化人机接口的关键技术。数字字符识别作为机器字符识别的一个研究分支,有着重要理论意义和实际应用价值,其识别技术涉及到模式识别、图像处理、人工智能、信息论、计算机科学等多个学科,同时也与心理学等学科相关,是一门综合的技术。
    本文实现的算法主要用于二代身份证制证过程中的检证系统,满足了实时性和准确性两方面的要求。本文完成的主要工作有身份证卡片图像截取、身份证号码区域图像截取,身份证号码图像前处理,单个身份证号码图像分割、单个号码图像的光滑滤波、改进Hilditch细化算法、数字特征点的定义和提取、身份证号码识别。
    身份证卡面图像截取是身份证号码识别的前提,卡面能否准确获得是身份证号码能否开始识别的关键,它直接影响着身份证号码识别的拒识率。这里,我们采用了提取边缘直线算法截取身份证卡面图像,主要根据采样点求取一条最佳插值直线,该直线即为身份证卡片边缘,四条卡片边缘直线所界定的区域即为身份证卡面图像。在身份证边缘直线提取的同时,我们还可以判断身份证是否严重倾斜,如果严重倾斜则首先将图像扶正。
    根据身份证卡片图像的整体结构特征,我们可以粗略估计出身份证号码所在的大体区域,判断在感兴趣的区域中是否存在18个数字,若存在则转入下一步进行单个数字图像的分割,不存在则返回重新捕获感兴趣区域。在身份证号码区域图像截取过程中,我们必须考虑以下几方
    
    
    面的情况,如卡片是否翻转,采集的卡片图像是否经过镜像变换等等。
    单个身份证号码图像分割也是身份证号码识别的关键步骤。首先对不同灰度级别的身份证条码图像进行自适应的二值化处理,然后对二值化图像分别进行横向和纵向投影,具体做法是:如果扫描点判断为前景点,则横向、纵向投影曲线上该点处的值分别加1,若扫描点为背景点,则继续下一点的判断。这样对整幅图像进行扫描之后,我们得到两条投影曲线,分别求取两条曲线的局部支集边界,就可确定出18个身份证号码的上下左右边界,下一步对界定的数字图像分别进行处理识别。
    针对我们已经得到18个身份证号码数字的二值化图像,首先需要对二值化图像进行光滑滤波处理,去除数字边缘毛刺。这里我们考虑了数字的宽度信息,以及数字走向曲线,借助于方向滤波对图像进行处理,处理后的图像消除了边缘毛刺,为细化后图像质量提供保证。
    数字的大部分信息都集中在骨架线上,所以在细线化图像上提取特征信息,不仅可以大大提高运行速度,而且还能简化算法。本文中用于识别数字的特征点包括端点和三叉点,所采用的特征点信息包括端点、三叉点的个数以及它们的位置,端点的方向信息等等,借助于这些信息能完全将每个数字分开。首先我们对传统的Hilditch细化算法进行改进,利用改进的Hilditch细化算法对光滑的二值化数字图像进行细化处理,细化后的图像就可以直接提取特征。具体做法是在细化图上逐行进行扫描,分析每个黑色像素点的八连通区域,提取上述所有的特征点信息。
    本文中我们针对不同数字的特点采用不同的识别方法,已经取得了令人满意的效果。首先,数字1是一个狭长的结构体,我们可以借助于截取图像的宽和高的比值进行识别;其次,针对4和X形状结构的特殊性,对4和X建立细线图像模板矩阵,对传入的二值化图像与细线化
    
    
    模板图像进行比较,如果二值图和细线图上都是黑色的点,则计数器加1,扫描完毕后就得到细线图和二值图均为黑色像素的点的个数,同时也记录了细线图黑像素点的个数,公共的黑点数与模板细线图像黑点数的比值如果大于给定的阈值,则认为是识别结果,通过这种方法可以完全正确识别4和X。最后,我们根据特征提取的结果进行分类识别,如果没有端点、没有三叉点,则识别结果为0;如果无端点,两个三叉点,则识别结果为8;如果只有一个端点、一个三叉点,则识别结果可能为6或9,这时只需考虑端点的位置,即可将6和9区分开来;如果有两个端点、无三叉点,则识别结果可能为2、3、5、7,这时需要加入端点的位置和方向辅助判断。本文中还针对数字断线的情况进行了补救,利用端点的方向信息将断开线相连接,进而进行识别。
    在数字识别的应用中,人们往往很关心的两个指标是“识别精度”和“识别速度”,“识别精度”是指在所有识别的字符中,除去拒识字符,正确识别的比例有多大,我们定义:识别精度P=A/(A+S)*100%,其中, S=误识率=误识样本数/全部样本数*100%,A=正确识别率=正确识别样本数/全部样本数*100%。在北京市公安局二代身份证制证中心的质检系统试行生产线上,经过连续两周测试无拒识无误识,完全满足用户的需求,准确度达到实际需求,同时本算法识别速度较快,在PⅢ 1.0G, 256 MB机器上测试,平均识别时间10.8毫秒左右,加上图像的前处理和识别的后校验,识别时间共200毫秒左右。算法完全满足了实际应用中实时性和准确性方面的要求,现在该算法已经在二代身份证检证系统中广泛使用。
Pattern Recognition technology is a significant branch of signal processing and artificial intelligence, which is also a main research and application field of current high-tech. Optical character recognition is the principal technology of computer intelligence man-machine interface. Number character recognition as a research branch of optical character recognition has very profound academic meaning and comprehensive application value in practice. The recognition technology consists of pattern recognition, image processing, artificial intelligence, communication theory, computer science, and so on. It, which is also relative to psychology, is a general technology.
    The arithmetic in this paper is used for detecting the second version ID card number in the course of ID card manufacturing and satisfies the real-time and accurate requirements. The accomplished work in this paper mainly include ID card image segmentation, ID card number image segmentation, pretreatment of ID card number image, the division of single number image, the number image filter and smoothness, Hildtch skelecton arithmetic’s modification, the definition and extraction of the feature points and the number recognition.
    ID card image segmentation is the premise of ID card number
    
    
    recognition. Whether ID card image is cut exactly is relative to ID card number recognition, and it directly influence the ratio of rejected recognition. Here, we cut the ID card image by dint of detecting the ID card boundary lines. Firstly, we sample some points and construct an optimal line through these sample points as much as possible. The line is just the boundary of ID card image. In the same time of detecting the four lines, we can make certain whether the ID card is inclined or not. And if the card is badly inclined, we can revise it immediately. By succession, we can get the rough location of the ID number block according to the whole structure of ID card, and we can estimate if there are 18 numbers in the interesting region. If there are 18 numbers in the region, we continue to recognize the numbers. If not, we will detect the ID card image again. During the course of getting ID card number image, we must consider the following instances, such as whether the ID card is reverse and whether the ID card image is a mirror image, and so on.
    The segmentation of ID card number image is also absolutely necessary to ID card number recognition. Firstly, we adopt a self-adaptive binary image method to process the different gray level images. Following this, we make the binary image vertical projection and horizontal projection. The detailed steps are as follows: Suppose that there are two vectors which are a vertical vector and a horizontal vector, one’s size is the Width of the image
    
    
    and the other’s size is the height of the image. In succession, we scan the whole image, if the scanned point is number point, the relative location of both the vertical vector and the horizontal vector add one, and otherwise, both the vertical vector and the horizontal vector keep invariable. After scanning the whole image, we can take two projection curves and the eighteen ID numbers can be got through computing the boundary points of the local support sets in the two curves. Thus we can process and recognize the eighteen numbers digital images.
    We need to filter the eighteen numbers in ID card binary image that we have gotten. Here, we consider the information of both the number’s width and the curvilinear directory of the number and then adopt the Gabor filter to process the images. The image that has been filtered is comparatively smooth. Thus, we can get much better skelecton images through these smooth binary images.
    Most of number character information is focus on the skeleton image, so we can get the character information easily on the skeleton images. It makes the arithmetic simple and the run-speed rapid by a long way. The character information used for recognizing the number includes end-points and trifurcate points, and we can distinguish the different
引文
[1]郭军,马跃等。发展中的汉字识别理论和技术,电子学报。Vol.23,No.10,1995,p184~187
    [2] 边肇祺,张学工等。模式识别,清华大学出版社,2000。
     [3]候继红,徐军。手写体数字识别技术的研究,电子计算机与外部设备。Vol.23,No.5,p24~26
    [4]阚伟,朱秋煜,一种改进的基于模板匹配的集装箱字符识别方法,计算机工程,Vol.26,No.12,p119~120
    [5]韩宏,杨精宇。神经网络分类器的组合,计算机研究与发展。Vol.37,No.12,2000,p1488~1492
    [6]赵明。手写印刷体汉字识别方法综述,计算机研究与发展。Vol.30,No.4,p59~64
    [7]朱小燕,史一凡,马少平。手写体字符识别研究,模式识别与人工智能。Vol.13,No.2,2000,p174~180
    [8]张得喜,马少平等,基于统计和神经元方法相结合的手写体相似字识别,中文信息学报,Vol.13,No.1,2000,p99~101
    [9]张炜,王庆,赵容椿。汽车牌照实时识别,信号处理。Vol.16,No.4,p372~375
    [10]路浩如,杨源远。手写体汉字识别问题综述,计算机应用与软件。Vol.11,No.2,1992,p1~8
    [11]郭宝兰,张彩录。光学字符识别技术发展综述,计算机世界报。Vol.10,No.14,1992
    [12]G.Nagy.Chinese character recognition a twenty-five-year
    
    
    retrospective, ICPR88: 9th Int Conf. On Pattern Recognition,1988,11(1): 163~166.
    [13]V. K. Govindan and A. P. Shivaprasad. Character Recognition- a review. Pattern Recognition,1990, 23(7): 671~683.
    [14]R. Casey, G. Nagy. Recognition of printed Chinese charater. IEEE T. Elec. Comput. 1996, 1(15): 91~100
    [15]N. Fujii, H. Sugawara, Y. Yamamato, C. Ito and T. Fujita. Some result on handprinted Kanji charater recognition using the feature extracted from multiple standpoint, Trans. IECE Japan, PRL81-32(1981).
    [16]张宏林。Visual C++数字图像模式识别技术及工程实现,人民邮电出版社

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700