粘連字符驗(yàn)證碼的識(shí)別研究
[Abstract]:The 21 century is the era of information explosion. The rapid development of Internet technology has brought great convenience to people's life. At the same time, the abuse of various network resources has attracted great attention of researchers. The verification code mechanism has come into being and has been applied to various websites to prevent resources from maliciously occupied by computer programs and to protect the privacy of information. The research on the identification of the verification code can not only find the loophole in the design of the verification code to prevent the automatic attack of the program, but also promote the development of digital image processing, pattern recognition and machine learning technology. This paper focuses on the identification of adhesive character verification code. The main characteristics of this kind of code are that there is adhesion between characters, simple adhesion and complex adhesion. This paper selects six websites' login or mailbox registration verification code, which are CSDN, Zhihu, Sina mailbox, Sina Weibo and NetEase respectively, and puts forward the corresponding decoding algorithm according to their respective characteristics. The main research work and results of this paper are as follows: 1. Aiming at the problem of skew adhesion of characters in Bank of Communications, an improved projection segmentation algorithm is proposed, which mainly adds dynamic rotation to the projection segmentation algorithm. The accuracy of judging projection segmentation points is improved, and the projection segmentation is combined with character width and pixel points for the case of close adhesion of CSDN characters. In the end, the segmentation rate of both can reach nearly 100. 2. In order to solve the problem that the character contour is incomplete after binarization, a contour repair algorithm based on hierarchical region search is proposed, and the traditional connected domain segmentation algorithm is improved. In the case of character fragments, it can also be successfully partitioned. For the Sina certification code with curve noise, it directly utilizes the concavity and convexity of the connected domain block and the information of the peripheral pixels. The character fragment. 3 in the noise block is identified. Aiming at the segmentation problem of Sina Weibo's twisted oblique conglutination characters, an improved drip algorithm is proposed, which mainly adds the rotation clamping algorithm and vertical projection on the basis of the drop water algorithm. It can not only solve the problem of inclination but also successfully divide the adhesive characters. For the complex design of NetEase CAPTCA, it mainly combines three algorithms: connected domain segmentation, vertical projection and drip segmentation, and makes use of their respective segmentation characteristics. The characters were successfully separated from the picture step by step.
【學(xué)位授予單位】:南京理工大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:TP309
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 劉歡;邵蔚元;郭躍飛;;卷積神經(jīng)網(wǎng)絡(luò)在驗(yàn)證碼識(shí)別上的應(yīng)用與研究[J];計(jì)算機(jī)工程與應(yīng)用;2016年18期
2 陳義中;李松林;;一種注冊(cè)登錄系統(tǒng)圖片驗(yàn)證碼設(shè)計(jì)與實(shí)現(xiàn)[J];軟件導(dǎo)刊;2016年07期
3 陸穎;蘇智勇;;3D文本驗(yàn)證碼的破解技術(shù)研究[J];計(jì)算機(jī)技術(shù)與發(fā)展;2016年07期
4 藺佳哲;王茜;謝楠;;基于WEB開發(fā)技術(shù)的新型驗(yàn)證碼的設(shè)計(jì)研究[J];石家莊學(xué)院學(xué)報(bào);2016年03期
5 門濤;孫燕;;電子商務(wù)網(wǎng)站驗(yàn)證碼安全性分析及設(shè)計(jì)[J];樂山師范學(xué)院學(xué)報(bào);2015年08期
6 簡獻(xiàn)忠;曹樹建;郭強(qiáng);;SOM聚類與Voronoi圖在驗(yàn)證碼字符分割中的應(yīng)用[J];計(jì)算機(jī)應(yīng)用研究;2015年09期
7 劉華煜;蔣維;;用PHP實(shí)現(xiàn)的浮動(dòng)驗(yàn)證碼[J];電腦知識(shí)與技術(shù);2014年33期
8 尹龍;尹東;張榮;王德建;;一種扭曲粘連字符驗(yàn)證碼識(shí)別方法[J];模式識(shí)別與人工智能;2014年03期
9 李興國;高煒;;基于滴水算法的驗(yàn)證碼中粘連字符分割方法[J];計(jì)算機(jī)工程與應(yīng)用;2014年01期
10 左保河;石曉愛;謝芳勇;章拓;;基于神經(jīng)網(wǎng)絡(luò)的網(wǎng)絡(luò)驗(yàn)證碼識(shí)別研究[J];計(jì)算機(jī)工程與科學(xué);2009年12期
,本文編號(hào):2254529
本文鏈接:http://sikaile.net/shoufeilunwen/xixikjs/2254529.html