基于主曲线的指纹细节特征提取方法

要提高指纹识别的识别率,关键是指纹特征的提取。主曲线是主成份分析的非线性推广,它是通过数据分布“中间’’并满足“自相合”的光滑曲线,较好地反映了数据分布的结构特征。本文尝试使用主曲线这种新的方法来提取指纹的细节特征。实验结果表明利用主曲线来提取指纹的结构特征是可行的,它为指纹特征提取的研究提供了一条新途径。     

基于细节点投影的可撤销指纹模板生成算法

为了改善指纹模板保护算法的可撤销性、不可逆性等性能, 设计了一种基于细节点投影的可撤销指纹模板生成算法.首先对指纹图像进行预处理, 提取指纹的细节点特征, 并筛选出采样半径范围内的有效细节点, 然后对细节点进行直线投影, 将投影后的向量映射到二维网格, 生成固定长度的一维比特串, 再结合用户PIN码生成可撤销指纹模板.在指纹数据库FVC2002-DB1和DB2上的实验结果表明, 该算法不仅提高了指纹模板认证的稳定性, 而且在可撤销性、不可逆性和安全性等方面均具有较好性能.     

指纹图像预处理和特征提取

根据指纹的固有规律，提出了一套较完整的指纹图像预处理和特征提取算法。改进了指纹脊线频率求取算法和二值图像去孔噪声算法，并提出了一种新的滤除指纹伪特征点的方法。通过对上百幅不同质量的指纹图像进行测试，获得了较好的效果。     

改进的指纹细节特征提取算法

指纹细节特征（minutiae)提取是指纹自动识别的核心技术之一，常规的指纹细节特征提取算法需要先采用纹线跟踪的方法对细化后的指纹图象进行纹线修复，然后再实现细节特征提取，纹线修复不仅步骤繁琐，而且比较耗时，针对这一问题，提出了一种改进的指纹细节特征提取算法，该算法首先在细化后的指纹图象上直接提取原始细节特征点集，然后分析图象中存在的各类噪声及其特点，总结伪特征点的分布规律，最后，结合局部纹线方向信息，针对不同的噪声，采用针对性的算法，将各类噪声引起的伪特征点分别予以删除，最终保留下来的特征点集即视为真正的特征点集，为验证该算法的性能，将改进算法与常规算法进行了对比实验，实验结果表明，改进算法有效地减少了计算时间，细节特征提取准确率也基本可以满足应用的需要。     

基于细节点邻域信息的可撤销指纹模板生成算法

为了提高指纹模板算法的安全性等性能,设计了一种基于细节点邻域信息的可撤销指纹模板生成算法.首先对指纹图像进行预处理,提取指纹的细节点特征,然后采用改进的细节点描述子采样结构提取细节点邻域的纹线特征,最后结合用户PIN码生成指纹模板,同时结合贪婪算法设计了相应的指纹匹配算法.在指纹数据库FVC2002-DB1和DB2上的实验表明,该算法具有良好的认证性能,能较好地满足可撤销性、多样性和不可逆性,而且改进的采样结构在没有降低系统识别性能的情况下,进一步拓展了细节点描述子的采样结构方式.     

指纹细节匹配中细节点方向算法研究

本文提出了一种指纹图像匹配中细节点方向的计算方法,这种算法利用细节点所在的纹线来计算细节点的方向,实验结果表明,此算法对计算指纹图像细节点方向是有效的。     

Fingerprint minutiae filtering using ARTMAP

Fingerprints are widely used for unique personal identification based on minutiae matching. Minutiae are the terminations and bifurcations of ridges in a fingerprint image. Generally fingerprint images are of low quality due to the presence of noise and contrast deficiency resulting in discontinuity in ridges producing false minutiae points. It is worth noting that there is a fundamental difference between a neural network (NN) approach for minutiae location and minutiae filtering. In this paper, the spurious minutiae points and the bug pixels introduced during the thinning process are eliminated based on the neighborhood pixel information. A new minutiae filtering algorithm using a NN is introduced to improve the accuracy of the extraction algorithm proposed in the literature. Each minutia, as detected by the algorithm, is classified through ARTMAP NN whose output indicates whether it is a termination, a bifurcation or a false minutia. Experimental results show that the efficiency of minutiae classification has significantly improved using the proposed filtering algorithm.     

一种基于分叉点脊线相似度的指纹匹配算法*

研究了一种基于分叉点脊线相似度的指纹匹配算法,利用可靠性较高的分叉点所在脊线的相似程度寻找出可能的基准细节点对;同时为解决基准点筛选受噪声影响的问题,提出使用基准点与周围四个特征点组成子集之间的相互关系来确定最终的基准点对和变换参数的方法;最后利用可变限界盒来实现两枚指纹的匹配。实验结果表明,本算法可以快速、准确地定位基准点,精确地求取变换参数,能够正确、快速地实现指纹匹配。     

Fingerprint matching using OrientationCodes and PolyLines

Effectively incorporating various features with minutiae in fingerprint matching is a challenging task. This paper presents an algorithm to extract two novel discriminative features that describe three kinds of information: macro orientation patterns, micro ridge representation, and minutiae of fingerprints. These features, namely OrientationCodes and PolyLines, are fixed-length, easy to be measured in similarity, and effective in various stages of fingerprint matching, such as alignment, minutiae pairing, matching score computation, and matching rates fusion. In addition, the scheme of the proposed method has advantages of programming implementation, manipulating fingerprint matching much simpler and smoother at a high level. Experimental results on six data sets of FVC2002 and FVC2004 indicate the proposed algorithm not only achieves remarkably lower EERs, but also consumes significantly less computational times.     

快速的多级指纹混合匹配方法

提出一种快速的多级指纹混合匹配方法.该方法在提取指纹图像特征,建立指纹细节点匹配模板后,对指纹进行多级匹配.首先,计算两幅指纹图像特征矢量之间的欧式距离,通过比较距离大小实现指纹的初级比对.然后利用输入指纹与库指纹的细节点模板进行二次匹配.最后,对二次匹配过程中匹配的细节点对加以分析,选取可靠的细节点对作为多参照对应点进行再次匹配.该方法融合指纹的图像特征和细节点特征,避免建立指纹细节点对应性耗时的搜索过程,同时多参照点的引入可以更好地校准细节点集.实验证明该方法快速有效.     

Fingerprint minutiae matching algorithm for real time system

Many fingerprint matching algorithms have been reported in articles in recent years. And people did fingerprint images matching through minutiae matching in most of the algorithms. In this paper, we proposed a new fingerprint minutiae matching algorithm, which is fast, accurate and suitable for the real time fingerprint identification system. In this algorithm we used the core point to determine the reference point and used a round bounding box for matching. Experiments done on a set of fingerprint images captured with a scanner showed that our algorithm is faster and more accurate than Xiping Luo's algorithm.     

Detecting fingerprint minutiae by run length encoding scheme

Many approaches to minutiae extraction have already been proposed for automatic fingerprint matching, and most transform fingerprint images into binary images through state-of-the-art algorithms and submit the binary image to a thinning process. However, this paper proposes an original technique for extracting minutiae based on representing the ridge structure of a fingerprint image as a run length code (RLC). The essential idea is to detect minutiae by searching for the termination points or bifurcation points of ridges in the RLC, rather than in a fingerprint image. Experimental results and a comparative analysis show that the proposed method is fairly reliable and faster than a conventional thinning-based method.     

基于Matlab实现的指纹图像细节特征提取

指纹图像的特征提取是指纹识别的关键,而指纹匹配通常基于细节点匹配.介绍了一套基于Matlab实现的指纹细节特征提取方法,并给出了去伪算法.指纹特征提取是从细化后的指纹图中得到细节特征点(即端点和分叉点),此特征点含有大量的伪特征,既耗时又影响匹配精度.采用了边缘去伪和距离去伪,使得特征点去伪前后减小了近1/3,然后提取可靠特征点信息,以便实现指纹匹配.实验证明,用Matlab实现的这种方法,既简单快速,而且具有较高的准确率.     

指纹识别中的特征点提取算法

指纹特征的提取在指纹自动识别系统中足一个必不可少的重要环节.根据指纹的固有规律,提出了一套较完整的指纹图像特征提取和伪特征去除算法,指纹特征提取是从细化后的指纹图像中得到的细节特征点(即端点和分叉点),其中含有大量的伪特征,根据伪特征点的结构,在特征提取之后对伪特征点进行去除,主要对毛刺和短脊进行去除.实验结果表明,该算法大大提高了指纹识别时的精度,并具有较强的抗干扰性.通过对上百幅不同质量的指纹图像进行测试,获得了较好的效果.     

指纹特征规模研究

自动指纹识别系统是通过对指纹的特征(节点)进行匹配对比来实现识别认证的,识别的效果主要取决于指纹输入设备、特征提取和匹配算法.为了研究指纹输入设备和特征提取算法对识别精度的影响,在已知指纹特征位置分布的情况下,建立了指纹特征匹配的数学模型,通过计算两枚指纹匹配的概率,引入了指纹特征规模的概念,它是对指纹输入设备和特征提取算法的一个综合评价.最终得到结论:若节点匹配的数目不变,可以通过降低指纹的特征规模,来提高识别精度;若系统的特征规模不变,可以通过增加节点匹配的数目,来提高系统识别精度.     

A novel algorithm of fingerprint encryption using minutiae-based transformation

This paper presents a novel algorithm of fingerprint encryption which transforms fingerprint minutiae and performs matching in the transformed form. If an encrypted template is compromised, it can be cancelled by choosing just another transformed template. In our algorithm, a circular region is constructed around each minutia and non-invertible transformation is applied to all regions but only transformed regions are stored in the database. The proposed algorithm improves the accuracy of verification compared to related fuzzy vault systems. Experimental results show the comparative performance of matching using both transformed and original data. We find that transformed matching also has an impressive accuracy and speed.     

A novel ant colony optimization algorithm for large-distorted fingerprint matching

Large distortion may be introduced by non-orthogonal finger pressure and 3D–2D mapping during the process of fingerprint capturing. Furthermore, large variations in resolution and geometric distortion may exist among the fingerprint images acquired from different types of sensors. This distortion greatly challenges the traditional minutiae-based fingerprint matching algorithms. In this paper, we propose a novel ant colony optimization algorithm to establish minutiae correspondences in large-distorted fingerprints. First, minutiae similarity is measured by local features, and an assignment graph is constructed by local search. Then, the minutiae correspondences are established by a pseudo-greedy rule and local propagation, and the pheromone matrix is updated by the local and global update rules. Finally, the minutiae correspondences that maximize the matching score are selected as the matching result. To compensate resolution difference of fingerprint images captured from disparate sensors, a common resolution method is adopted. The proposed method is tested on FVC2004 DB1 and a FINGERPASS cross-matching database established by our lab. The experimental results demonstrate that the proposed algorithm can effectively improve the performance of large-distorted fingerprint matching, especially for those fingerprint images acquired from different modes of acquisition.     

Fingerprint matching based on global alignment of multiple reference minutiae

Fingerprint matching is an important problem in fingerprint identification. A set of minutiae is usually used to represent a fingerprint. Most existing fingerprint identification systems match two fingerprints using minutiae-based method. Typically, they choose a reference minutia from the template fingerprint and the query fingerprint, respectively. When matching the two sets of minutiae, the template and the query, firstly reference minutiae pair is aligned coordinately and directionally, and secondly the matching score of the rest minutiae is evaluated. This method guarantees satisfactory alignments of regions adjacent to the reference minutiae. However, the alignments of regions far away from the reference minutiae are usually not so satisfactory. In this paper, we propose a minutia matching method based on global alignment of multiple pairs of reference minutiae. These reference minutiae are commonly distributed in various fingerprint regions. When matching, these pairs of reference minutiae are to be globally aligned, and those region pairs far away from the original reference minutiae will be aligned more satisfactorily. Experiment shows that this method leads to improvement in system identification performance.     

Password hardened fuzzy vault for fingerprint authentication system

The present work attempts to build a bio-cryptographic system that combines transformed minutiae pairwise feature and user-generated password fuzzy vault. The fingerprint fuzzy vault is based on a new minutiae pairwise structure, which overcomes the fingerprint feature publication while the secret binary vault code is generated according to the fingerprint fuzzy vault result. The authentication process involves two stages: fuzzy vault matching and secret vault code validation. Our minutiae pairwise transformation produces different templates thus resolving the problem of cross matching attacks in fingerprint fuzzy vault. So, the original fingerprint template cannot be recreated because it is protected by the key generated from the user password. In addition, the proposed bio-cryptographic system ensures an acceptable security level for user authentication.