在图像处理中对指纹识别的研究

该文从介绍指纹识别技术的原理和指纹识别算法入手,将指纹识别中分类和匹配过程相结合,提出了一种包含奇异点周边的方向场和细节点等特征的奇异点邻近结构。该结构利用奇异点周边识别信息集中的特点,大大减少了匹配的计算量,并能够同时作为指纹分类和比对的特征,直接应用于指纹的连续分类和快速匹配过程,实现对大容量指纹数据库的快速识别。该算法在保证自动识别指纹系统的识别准确性的同时,还使得指纹在线识别系统的1:N辨别速度有明显的提高。     

在图像处理中对指纹识别的研究

该文从介绍指纹识别技术的原理和指纹识别算法入手,将指纹识别中分类和匹配过程相结合,提出了一种包含奇异点周边的方向场和细节点等特征的奇异点邻近结构。该结构利用奇异点周边识别信息集中的特点,大大减少了匹配的计算量,并能够同时作为指纹分类和比对的特征,直接应用于指纹的连续分类和快速匹配过程,实现对大容量指纹数据库的快速识别。该算法在保证自动识别指纹系统的识别准确性的同时,还使得指纹在线识别系统的1：N辨别速度有明显的提高。     

指纹快速匹配算法研究

设计了指纹快速匹配算法。算法以分类时获取的奇异点为参考点对指纹进行定位,利用奇异点特殊邻近结构缩小细节点匹配规模,在可变界限盒的基础上设计合理匹配策略。该方法不仅可以提高计算速度,也能够适应指纹非线性形变的特点,增加算法鲁棒性。在FVC2000数据库上的测试结果显示,该算法在保证自动指纹识别系统识别准确性的同时,还使得指纹辨识速度有了显著的提高。     

一种新的指纹奇异点快速检测方法

作为指纹最重要的全局特征之一,奇异点在基于模型的方向场计算、人工合成指纹、指纹分类、指纹特征匹配等方面发挥了非常重要的作用.在指纹方向场分割的基础上提出了一种称之为方向丰富度的特征,并据此形成了一种新的指纹奇异点快速检测方法.该方法首先将指纹方向场分割为一系列互不重叠的同质区域;然后通过同质区域边缘检测及边缘端点提取实现了奇异点快速定位;最后依据奇异点处方向丰富度特性判断其类型.实验验证了文中算法的有效性.     

指纹识别中的自动分类研究

由指纹的唯一性和不变性决定了它在身份认证中的重要地位,然而时至今日人们多是用肉眼将指纹按奇异点(核点和三角点)的分布位置进行分类,然后在各类中进行细分或匹配.本文是通过计算机自动寻找各指纹的核点和三角点,而后由他们的分布位置将指纹分成6类,以完成指纹识别中自动分类问题.     

基于方向场特征的指纹图像奇异点检测

1　引言指纹是指端表面的纹路结构,由于具有不变性、唯一性以及易于采集的特性,指纹识别已经成为生物鉴定学的一个重要方面.指纹识别通常包括以下几个阶段:分割、图像增强、分类、细节提取以及匹配[1].在所有的处理过程中,一个有效的分类算法是至关重要的.奇异点数目的多少以及奇异点之间的相对位置关系,是指纹分类的重要依据之一.指纹的奇异点检测已经有很多种方法[2～4],这些方法要么不具有平移、旋转不变性,要么方法的精度和可靠性比较差.本文提出一种新的奇异点检测方法,利用指纹的方向场在奇异点附近的变化比较剧烈,而在其他地方的变化…     

基于奇异点区域方向场的指纹检索

为提高大型指纹数据库中指纹识别的速度和准确性,必须对其进行有效分类和快速检索。提出了一种基于奇异点区域方向场的指纹检索方法。首先利用支持向量机对指纹图像进行分割,并对分割出的图像的方向场进行多尺度平滑,得到可靠的平方复数点方向场估计,再对其进行复数滤波,利用滤波响应幅度信息确定奇异区范围及奇异点的位置和方向;然后根据所得奇异点个数及相对位置对指纹进行初次分类,最后利用奇异点区域的方向场构成指纹的特征向量,并通过比对特征向量进行指纹检索。实验结果表明,本文方法较文献的方法有明显的优势,能有效缩小待匹配指纹的数量。     

基于ARM9的指纹匹配算法

为了满足嵌入式指纹识别系统的实时性需求,论文提出了一种基于ARM9内核的指纹匹配算法.该算法通过构建特征点的三角结构向量,消除了指纹图像旋转、平移的影响,提高了系统的鲁棒性.同时算法采用两个等级进行指纹匹配,缩短了匹配时间,提高了匹配效率.通过在ARM920T主建的平台上进行识别测试,本算法完全可以满足嵌入式系统的要求.     

基于拓扑学及指纹分类的指纹匹配算法

随着计算机和网络的迅速发展,基于生物特征识别的智能身份认证技术正受到越来越多的关注。由于指纹识别技术是生物识别领域技术中最成熟的一门应用技术,使得指纹识别成为目前应用最广泛、可信度最高的个人身份认证技术之一。文中依据指纹图像中细节特征点之间的关联性给出了一种指纹识别算法。该算法首先基于指纹分类学的思想,利用中心点和三角点的数量信息对待识指纹图像进行初匹配,然后基于拓扑学思想用可靠性较高的分叉点方向场及其与中心点的方向场差寻找出基准点对,最后利用可变限界盒实现指纹匹配。实验中,该算法使匹配速度提高了40％,误识率和拒识率略有下降,约0．5％。实验结果表明,该算法能快速、准确地定位基准点对,有效地解决提取基准点时的噪声影响,正确有效地实现指纹匹配,同时提高匹配速度及精确度。     

一种基于局部结构信息的指纹伪特征滤除算法

自动指纹识别系统中，灰度指纹图象经过预处理过程得到细化二值图象，其中往往含有大量的伪特征，这将对后续的分类、匹配等操作造成不良影响，导致系统识别率下降，为此首先提出一种新的快速纹线跟踪算法——8邻域编码纹线跟踪算法，然后提出一种基于局部结构信息的指纹伪特征滤除算法，该伪特征滤除算法是在纹线跟踪的基础上，提取指纹特征点的若干属性，并结合特征点的局部结构信息，对各种伪特征结构进行识别和滤除，实验结果表明，本方法可以快速、准确、彻底地滤除这些伪特征结构，效果令人满意。     

A combination fingerprint classifier

Fingerprint classification is an important indexing method for any large scale fingerprint recognition system or database as a method for reducing the number of fingerprints that need to be searched when looking for a matching print. Fingerprints are generally classified into broad categories based on global characteristics. This paper describes novel methods of classification using hidden Markov models and decision trees to recognize the ridge structure of the print, without needing to detect singular points. The methods are compared and combined with a standard fingerprint classification algorithm and results for the combination are presented using a standard database of fingerprint images. The paper also describes a method for achieving any level of accuracy required of the system by sacrificing the efficiency of the classifier. The accuracy of the combination classifier is shown to be higher than that of the two state-of-the-art systems tested under the same conditions     

Fingerprint image analysis for automatic identification

Most of the papers on fingerprints deal with classification of fingerprint images. Fingerprint databases being large (in the range of millions), the effort in matching of fingerprints within a class or when the class is unknown, is very significant. This requires fingerprint image analysis and extraction of the “minutiae” features, which are used for matching FPs. In this paper a scheme of preprocessing and feature extraction of fingerprint images for automatic identification is presented, which works even if the pattern class is unknown. The identification of fingerprints is based on matching the minutiae features of a given finger-print against those stored in the database. The core and delta information is used for classification and for registration while matching. These algorithms have been tested for more than 10,000 fingerprint images of different qualities. The results are manually verified and found to be very good for practical application. A few sample results are presented.     

Fingerprint classification based on decision tree from singular points and orientation field

In this study, a high accuracy fingerprint classification method is proposed to enhance the performance in terms of efficiency for fingerprint recognition system. The recognition system has been considered as a reliable mechanism for criminal identification and forensic for its invariance property, yet the huge database is the key issue to make the system obtuse. In former works, the pre-classifying manner is an effective way to speed up the process, yet the accuracy of the classification dominates the further recognition rate and processing speed. In this paper, a rule-based fingerprint classification method is proposed, wherein the two features, including the types of singular points and the number of each type of point are adopted to distinguish different fingerprints. Moreover, when fingerprints are indistinguishable, the proposed Center-to-Delta Flow (CDF) and Balance Arm Flow (BAF) are catered for further classification. As documented in the experimental results, a good accuracy rate can be achieved, which endorses the effectiveness of the fingerprint classification scheme for the further fingerprint recognition system.     

基于大尺度方向场描述子的指纹分类算法

指纹分类通过将指纹划分到一系列预定义的类别之中以极大降低指纹匹配的工作量,是指纹识别系统中一项非常关键的技术。受FingerCode分类特征启发,提出了一种称为大尺度方向场描述子的新的分类特征,该特征以指纹核心点(core点)为中心构造大尺度环形网状结构,通过抽取网状结构中节点处的方向来形成特征向量,以达到近似描述核心点周围的方向模式的目的。大量实验结果表明:相较于FingerCode特征,新特征在保证分类准确率的同时,由于特征提取方式更为简单、高效,分类速度也提高了近20倍。     

Latent fingerprint matching

Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.     

基于隐马尔可夫模型的指纹分类研究

指纹分类是针对大型指纹库的一个重要的索引方式，可以有效地提高指纹匹配的效率．指纹类型的不同表现为指纹纹理结构的差异，而指纹的方向场则可以有效地描述纹理结构的差异．同一类型指纹不同区域上方向角结构的差异以及相邻区域间方向角结构的联系可以视作一个马尔可夫随机场．本文利用嵌入式隐马尔可夫模型对指纹方向场进行建模分析，通过合理地抽取指纹的类型特征，构造观察向量、进行建模训练，然后利用训练好的马尔可夫模型进行匹配，最终提出并实现了一种新的鲁棒性强且精度较高的指纹分类方法．     

Fingerprint reference point identification based on chain encoded discrete curvature and bending energy

Reference point identification is important in automatic fingerprint recognition system as it can be used to align fingerprints in a correct orientation in spite of the possibility of different transformations in fingerprint images. It is also used in fingerprint classification, as it is desirable to classify fingerprint images for forensic type applications which require the input image to be verified against a large database. The important feature information useful for classification is centered near the reference point. Most of the current approaches for identifying the reference point either require determining ridge orientation or use some complex filters. These methods either operate on 2D (two dimensional) or are not robust to rotation or cannot be applied to every class of fingerprint image. This paper proposes a method to reliably identify unique reference point that operates in 1D (one dimensional). The method treats the fingerprint ridges as a non-overlapped sequence of chain code segments. A modified k-curvature method has been proposed to find the high-curvature area of fingerprint ridges. The reference point localization is based on the property of the ridge’s bending energy. The proposed method is tested on FVC2002 and FVC2004 standard datasets, and the experimental results show that the proposed algorithm can accurately locate reference point for all types of fingerprint images.