大数据环境下利用新型FTS的并行细节点指纹匹配通用分解方法

A General Decomposition Method for Parallel Detail Point Fingerprint Matching Using New FTS in Big Data Environment

随着指纹识别数据库规模的不断扩大,指纹识别系统的通用性、可靠性亟须提高。为了解决该问题,提出了利用新型指纹拓扑结构(FTS)的并行化细节点指纹匹配分解方法。该方法首先根据k近邻算法设计了叉点和端点新的结构,并提取出细节点特征。然后,将匹配分数的计算过程分解为几个小步骤来执行,在更精细的层次上分割2个指纹的最终匹配,以此定义局部结构子集之间的部分分数。最后,单独计算这些部分分数,将它们合并在一起,构成一个非常灵活的预测值,并允许丢弃部分分数。此外,提出了基于细节点置信度的指纹匹配算法,有助于全局范围上的指纹信息提取,从而确保局部相似细节点的有效匹配。在SFinGe数据库上的实验结果表明:所提出的分解框架可适用于Apache Hadoop、Apache Spark等大数据环境,具有良好的可靠性。将提出的分解方法应用于3种匹配算法中进行实验,结果表明提出的分解方法具有良好的通用性。

With the continuous expansion of the size of the fingerprint recognition database, the flexibility and reliability of the fingerprint identification system need to be improved. In order to solve this problem, a parallel minutiae fingerprint matching scheme combining novel fingerprint topology structure (FTS) is proposed. Firstly, the new structure of the fork point and the end point is designed by the k -nearest neighbor algorithm and the minutiae feature is extracted. Then, the process of calculating the matching score is divided into several small steps to execute, and the final matching of the two fingerprints is divided to be a finer level, thereby defining the partial scores between the partial structure subsets. Finally, these fractional scores can be calculated separately and then merged together to form a very flexible predictor and allow partial fractions to be discarded. In addition, a fingerprint matching algorithm based on the confidence of detail points is proposed, which is helpful to extract fingerprint information in the global scope, thus ensuring the effective matching of local similar detail points. The experimental results on SFinGe database show that the proposed decomposition framework can be applied to Apache Hadoop, Apache Spark and other data environments, and has good reliability. The proposed decomposition method is applied to three matching algorithms and the results show that the proposed decomposition method has good generality.