Generating cancelable fingerprint templates

Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics raises several privacy concerns. A biometric is permanently associated with a user and cannot be changed. Hence, if a biometric identifier is compromised, it is lost forever and possibly for every application where the biometric is used. Moreover, if the same biometric is used in multiple applications, a user can potentially be tracked from one application to the next by cross-matching biometric databases. In this paper, we demonstrate several methods to generate multiple cancelable identifiers from fingerprint images to overcome these problems. In essence, a user can be given as many biometric identifiers as needed by issuing a new transformation "key". The identifiers can be cancelled and replaced when compromised. We empirically compare the performance of several algorithms such as Cartesian, polar, and surface folding transformations of the minutiae positions. It is demonstrated through multiple experiments that we can achieve revocability and prevent cross-matching of biometric databases. It is also shown that the transforms are noninvertible by demonstrating that it is computationally as hard to recover the original biometric identifier from a transformed version as by randomly guessing. Based on these empirical results and a theoretical analysis we conclude that feature-level cancelable biometric construction is practicable in large biometric deployments     

Pair-polar coordinate-based cancelable fingerprint templates

Fingerprint-based authentication has been widely implemented, however, security and privacy of fingerprint templates still remain an issue. Some schemes have been proposed to protect fingerprint templates, such as the design of cancelable fingerprint templates. Yet, most of the existing schemes rely on accurate fingerprint image registration, which is very hard to achieve, especially considering the need to avoid storing any information related to the raw fingerprint features. In this paper, a pair-polar coordinate-based template design method is developed which does not need registration. The proposed scheme explores the relative relationship of minutiae in a rotation- and shift-free pair-polar framework. A many-to-one mapping is applied to ensure the non-invertible recovery of raw templates. A random translation parameter is introduced to further distort the minutia distribution. Under various scenarios, the proposed scheme is evaluated using the public databases, FVC2002DB1, FVC2002DB2 and FVC2002DB3. The experiment results show that the new method satisfies the template protection requirements and the performance degradation caused by the transformation is very low.     

Alignment-free cancelable fingerprint template design: A densely infinite-to-one mapping (DITOM) approach

Registration-based cancelable template schemes rely on accurate fingerprint image alignment, which is very difficult to achieve. In this paper, by exploiting pair-minutiae vectors, we develop a lightweight, alignment-free scheme for generating cancelable fingerprint templates. The proposed mathematical model is based on a densely infinite-to-one mapping (DITOM) aiming to achieve the non-invertible property. The transformation designed describes the intersection of a collection of hyperplanes and effectively realizes infinite-to-one mapping. The proposed scheme has the properties of non-invertibility, revocability and multiple template independence. Evaluation of the proposed scheme over FVC2002 DB1, DB2 and DB3 shows that the new method exhibits satisfactory performance compared to existing methods.     

Design of alignment-free cancelable fingerprint templates via curtailed circular convolution

Fraudulent use of stolen fingerprint data and privacy invasion by tracking individuals unlawfully with shared or stolen fingerprint data justify the significance of fingerprint template protection. With no a priori fingerprint image registration, alignment-free cancelable fingerprint templates do not suffer from inaccurate singular point detection. In this paper, we propose an effective alignment-free method for constructing cancelable fingerprint templates via curtailed circular convolution. The proposed method features an efficient one-way transform, which protects the input binary string such that it cannot be retrieved from the length-reduced, convolved output vector. The transformed template fulfills the requirements of non-invertibility, revocability and diversity for cancelable fingerprint templates. Evaluation of the proposed scheme over FVC2002 DB1, DB2 and DB3 shows that the new method demonstrates satisfactory performance compared to the existing alignment-free cancelable template schemes.     

一种结合结构信息的指纹细节点特征提取算法

提出了一种新的指纹特征提取方法,引入细节点与中心点的角度差以及细节点到中心点所穿越的脊线数作为细节特征的向量,采用一种改进的Bresenham 画线算法计算穿越的脊线数,提取出了指纹图像的特征信息。实验表明该算法能准确有效地提取出指纹图像的结构特征信息。     

Method for fingerprint minutiae matching based on their alignment

In the paper a method for fingerprint matching is presented, which is based on the use of additional information about the representation of fingerprint minutiae. The method proposed is a modification of the method by M. Tico et al [1]. However, in contrast with the prototype, this method uses both the characteristic of local regions of the directional field and the local configurations of minutiae present in the fingerprint. Vladimir Nikolaevich Perminov. Graduated from the Moscow State Institute of Electronic Technology. Candidate of Engineering. General Director of UniqueICs Company. Scientific interests: systems of computer-aided design of integrated schemes and simulation methods; image processing and compression, pattern recognition. Aleksei Mikhailovich Fartukov. Born 1979. Graduated from the Moscow State Institute of Electronic Technology in 2001. Works as engineer-programmer inUniqueICs Company. Scientific interests: image processing and compression, pattern recognition.     

A cancelable fingerprint biometric based session key establishment protocol

Multimedia Tools and Applications - Symmetric key cryptography needs the communicating parties to share a secret key. It is desired that a different shared key is established for each communication...     

基于指纹细节点的可撤销比特串模板生成算法

为了提高指纹模板算法的安全性能,设计了一种基于细节点的可撤销比特串指纹模板生成算法。首先对指纹图像进行预处理,提取指纹的细节点特征,然后对细节点特征进行量化和映射生成比特串模板,最后结合用户PIN码生成可撤销指纹模板。在指纹数据库FVC2002-DB1和DB2上的实验表明,该算法具有更好的安全性和认证性能,满足可撤销性、多样性和不可逆性。     

基于指纹细节点柱形码的参数自适应选取算法

针对现有的细节点柱形编码方法存在柱形编码有效性较差、检索错误率较高的问题,提出了一种改进的细节点柱形编码算法。该算法通过对原有的细节点柱形编码参数进行自适应选取,提高了柱形编码的有效性,有效地降低了指纹检索恢复时的错误率,同时引入局部敏感哈希方法,通过对柱形码进行检索与恢复找回有效的细节点对,提高了匹配的准确率。在FVC2002上的实验结果表明,改进算法具有较好的性能。     

A key binding system based on n-nearest minutiae structure of fingerprint

Biometric cryptosystem has gained increasing attention in recent years. One of the difficulties in this field is how to perform biometric matching under template protection. In this paper, we propose a key binding system based on n-nearest minutiae structures of fingerprint. Unlike the traditional fingerprint recognition method, the matching of nearest structures are totally performed in the encrypted domain, where the template minutiae are protected. Three levels of secure sketch are applied to deal with error correction and key binding: (1) The wrap-around construction is used to tolerate random errors that happens on paired minutiae; (2) the PinSketch construction is used to recover nearest structures which are disturbed by burst errors; and (3) Shamir’s secret sharing scheme is used to bind and recover a key based on template minutia structures. The experimental results on FVC2002 DB1 and DB2 and security analysis show that our system is efficient and secure.     

Cancellability and diversity analysis of fingerprint template protection scheme based on compact minutiae pattern

ABSTRACT

As fingerprints continue toward ubiquity in human recognition applications, growing fingerprint databases will pose an increasingly greater risk of irreversible identity theft in the event of a database breach. Consequently, more focus is being placed on researching new and effective ways of securing fingerprint templates during database storage. Recently, a new fingerprint template protection scheme, based on representing a fingerprint by a sparse 3-, 4-, or 5-minutiae pattern, has been proposed. The most important advantage of this method over other fingerprint template protection schemes is that it employs only a small number of identifying features in the creation of the protected template, such that it is impossible to recover the original fingerprint even if the protected template is compromised. In this article, we present a thorough analysis to demonstrate that this new fingerprint construct also boasts impressive cancellability and diversity properties. Cancellability allows for the replacement of a compromised template with a new template from the same fingerprint, and diversity enables a person to enroll into multiple applications using the same fingerprint without the prospect of being tracked across the different applications.     

谱图曲线拟合在线处理方法

介绍利用计算机技术、数字信号处理技术、数值分析对谱图处理的一种新方法。     

Fingerprint minutiae extraction based on principal curves

It is important to extract minutiae of a fingerprint for the implementation of an auto fingerprint identification system. In this paper, the principal graph algorithm proposed by Kegl is used to obtain principal curves, which can be served as the skeletons of a fingerprint. Based on the obtained principal curves, a minutiae extraction algorithm is proposed to extract minutiae of the fingerprint. The experimental results indicate that principal curves obtained from the principal graph algorithm are smoother than the ones obtained from thinning algorithm, and the minutiae extracted by the proposed algorithm are more efficient.     

基于梯度的方向信息在指纹预处理中的应用

为了提高指纹图像预处理算法的抗噪能力,给出了一种基于梯度的指纹方向图获取方法,并利用指纹图像的方向信息进行指纹图像的预处理,得到了更为精确的指纹细节点图.在指纹预处理过程中引入该方法,能有效地改善指纹纹线的质量.实验分析表明,该方法具有很好的使用价值.     

基于贝叶斯方法和信息指纹的博客评论过滤

博客的出现丰富和改变了网络的内涵,影响了人们的信息传递方式,同时博客评论作为一种交互方式在博客中广泛存在,给信息监管带来了新的问题。通过分析现有的博客过滤系统,将广泛应用于文本过滤的贝叶斯方法应用到博客评论中,针对博客评论中广泛存在的广告机器人特点,结合信息指纹对其进行识别和过滤。同时对影响博客评论过滤效果和执行速度的指纹函数进行了分析讨论和实验对比,实验结果表明基于贝叶斯方法和信息指纹相结合的博客评论过滤是行之有效的,而且相对于单独的贝叶斯方法更有利于提高系统运行效率和发现广告机器人现象。     

基于多模板隐马尔可夫模型的文本信息抽取算法

由于训练数据来源的多样化,难以通过学习得到最优的模型参数,因此提出了一种基于多模板隐马尔可夫模型的文本信息抽取算法。该算法首先利用文本排版格式和分隔符等信息,对文本进行分块;然后在分块的基础上,对训练数据进行聚类以形成多个形式的模板（多模板）,并对多模板数据训练得到隐马尔可夫初始概率及转移概率参数;最后,用被训练的数据统一训练释放概率参数,结合初始概率、转移概率以及释放概率参数对文本信息进行抽取。实验结果表明,该算法在精确度和召回率指标上比简单隐马尔可夫模型具有更好的性能。     

基于线模式的指纹细节点匹配算法

提出了一种新的基于线模式的指纹图像细节点匹配算法,这种算法先分别找出最佳匹配点对,确定相对旋转角度,较快地确定两个指纹的相关性,之后再搜索漏的匹配点对,去掉错误的匹配点对。算法受指纹增强、后处理的影响较小,细节点相似程度受其邻域细节点影响较小。介绍了算法的具体实现方法,并用实际指纹数据进行了测试。初步测试的结果表明,此算法是指纹图像细节点匹配的一种有效算法。     

Ear recognition based on local information fusion

Ears have rich structural features that are almost invariant with increasing age and facial expression variations. Therefore ear recognition has become an effective and appealing approach to non-contact biometric recognition. This paper gives an up-to date review of research works on ear recognition. Current 2D ear recognition approaches achieve good performance in constrained environments. However the recognition performance degrades severely under pose, lighting and occlusion. This paper proposes a 2D ear recognition approach based on local information fusion to deal with ear recognition under partial occlusion. Firstly, the whole 2D image is separated to sub-windows. Then, Neighborhood Preserving Embedding is used for feature extraction on each sub-window, and we select the most discriminative sub-windows according to the recognition rate. Each sub-window corresponds to a sub-classifier. Thirdly, a sub-classifier fusion approach is used for recognition with partially occluded images. Experimental results on the USTB ear dataset and UND dataset have illustrated that using only few sub-windows we can represent the most meaningful region of the ear, and the multi-classifier model gets higher recognition rate than using the whole image for recognition.     

结合方向信息的指纹二值化及后处理算法

指纹图像二值化是指纹细化处理的前提,是指纹识别预处理的一个重要部分。为利用指纹图像所具有的纹理特性,将指纹的方向信息引入到二值化处理过程中,综合考虑指纹的方向信息和自适应选择局部阈值,提出了一套完整的结合方向信息的自适应局部阈值二值化及后处理算法。实验结果表明,该算法具有很好的二值化效果。而且,该算法具有很好的连接指纹图像中断线、消除孔洞、去除粘线的能力,这对提高细节特征提取结果的准确性具有重要的意义。