Ridge orientation modeling and feature analysis for fingerprint identification

This thesis systematically derives an innovative approach, called FOMFE, for fingerprint ridge orientation modeling based on 2D Fourier expansions, and explores possible applications of FOMFE to various aspects of a fingerprint identification system. Compared with existing proposals, FOMFE does not require prior knowledge of the landmark singular points (SP) at any stage of the modeling process. This salient feature makes it immune from false SP detections and robust in terms of modeling ridge topology patterns from different typological classes. The thesis provides the motivation of this work, thoroughly reviews the relevant literature, and carefully lays out the theoretical basis of the proposed modeling approach. This is followed by a detailed exposition of how FOMFE can benefit fingerprint feature analysis including ridge orientation estimation, singularity analysis, global feature characterization for a wide variety of fingerprint categories, and partial fingerprint identification. The proposed methods are based on the insightful use of theory from areas such as Fourier analysis of nonlinear dynamic systems, analytical operators from differential calculus in vector fields, and fluid dynamics. The thesis has conducted extensive experimental evaluation of the proposed methods on benchmark data sets, and drawn conclusions about strengths and limitations of these new techniques in comparison with state-of-the-art approaches. FOMFE and the resulting model-based methods can significantly improve the computational efficiency and reliability of fingerprint identification systems, which is important for indexing and matching fingerprints at a large scale

A Survey of the methods on fingerprint orientation field estimation

Fingerprint orientation field (FOF) estimation plays a key role in enhancing the performance of the automated fingerprint identification system (AFIS): Accurate estimation of FOF can evidently improve the performance of AFIS. However, despite the enormous attention on the FOF estimation research in the past decades, the accurate estimation of FOFs, especially for poor-quality fingerprints, still remains a challenging task. In this paper, we devote to review and categorization of the large number of FOF estimation methods proposed in the specialized literature, with particular attention to the most recent work in this area. Broadly speaking, the existing FOF estimation methods can be grouped into three categories: gradient-based methods, mathematical models-based methods, and learning-based methods. Identifying and explaining the advantages and limitations of these FOF estimation methods is of fundamental importance for fingerprint identification, because only a full understanding of the nature of these methods can shed light on the most essential issues for FOF estimation. In this paper, we make a comprehensive discussion and analysis of these methods concerning their advantages and limitations. We have also conducted experiments using publically available competition dataset to effectively compare the performance of the most relevant algorithms and methods

A bisector line field approach to interpolation of orientation fields

We propose an approach to the problem of global reconstruction of an orientation field. The method is based on a geometric model called "bisector line fields", which maps a pair of vector fields to an orientation field, effectively generalizing the notion of doubling phase vector fields. Endowed with a well chosen energy minimization problem, we provide a polynomial interpolation of a target orientation field while bypassing the doubling phase step. The procedure is then illustrated with examples from fingerprint analysis

PGT-Net: Progressive Guided Multi-task Neural Network for Small-area Wet Fingerprint Denoising and Recognition

Fingerprint recognition on mobile devices is an important method for identity verification. However, real fingerprints usually contain sweat and moisture which leads to poor recognition performance. In addition, for rolling out slimmer and thinner phones, technology companies reduce the size of recognition sensors by embedding them with the power button. Therefore, the limited size of fingerprint data also increases the difficulty of recognition. Denoising the small-area wet fingerprint images to clean ones becomes crucial to improve recognition performance. In this paper, we propose an end-to-end trainable progressive guided multi-task neural network (PGT-Net). The PGT-Net includes a shared stage and specific multi-task stages, enabling the network to train binary and non-binary fingerprints sequentially. The binary information is regarded as guidance for output enhancement which is enriched with the ridge and valley details. Moreover, a novel residual scaling mechanism is introduced to stabilize the training process. Experiment results on the FW9395 and FT-lightnoised dataset provided by FocalTech shows that PGT-Net has promising performance on the wet-fingerprint denoising and significantly improves the fingerprint recognition rate (FRR). On the FT-lightnoised dataset, the FRR of fingerprint recognition can be declined from 17.75% to 4.47%. On the FW9395 dataset, the FRR of fingerprint recognition can be declined from 9.45% to 1.09%

Improved velocity obstacles-based collision avoidance algorithm for multiple mobile robots

针对多移动机器人运动协调中的动态安全避碰问题,在分析速度障碍法原理的基础上,设计用于机器人之间相互避让的互动速度法则,并通过制定机器人的碰撞时间、碰撞距离因子对构型障碍的大小进行实时调整,把运动障碍物、动力学约束下的多步可达窗口、目标点都映射到一种速度变化空间当中,使多机器人的动态避碰问题转化为一种最优化问题,并构造了新的优化评价函数;设计了基于改进速度障碍法的机器人动态避碰规划算法。仿真实验表明,该方法有效地克服了碰撞冲突,实现了多机器人之间的运动协调控制,提高了机器人追踪运动目标的快速性。The dynamic avoiding collision of multiple mobile robots is studied.Based on the analysis of the principle of velocity obstacles,it designs the interactive velocity methods and defines the collision time and collision distance factor to adjust configuration obstacles,the mobile obstacles,multi-step planning window under dynamic constraints and the goal point are mapped in a new set velocity variation space.Furthermore,in the velocity variation space,it translates the multi-robot dynamic collision avoidance problem into an optimization problem with a new objective function,and the corresponding dynamic collision avoidance arithmetic is designed.Simulation results show that this method is effective to overcome the impact of conflict,achieve an effective coordination and control between multi-robots,and improve the tracking of fast moving targets.福建省自然科学基金(No.2010J05141

Strategies for intelligent interaction management and usability of biometric systems

Fingerprint biometric systems are one of the most popular biometric systems in current use, which takes a standard measure of a person's fingerprint to compare against the measure from an original stored template, which they have pre-acquired and associated with the known personal identification claimed by the user. Generally, the fingerprint biometric system consists of three stages including a data acquisition stage, a feature extraction stage and a matching extraction. This study will explore some essential limitations of an automatic fingerprint biometric system relating to the effects of capturing poor quality fingerprint images in a fingerprint biometric system and will investigate the interrelationship between the quality of a fingerprint image and other primary components of a fingerprint biometric system, such as the feature extraction operation and the matching process. In order to improve the overall performance of an automatic fingerprint biometric system, the study will investigate some possible ways to overcome these limitations. With the purpose of acquisition of an acceptable quality of fingerprint images, three components/enhancements are added into the traditional fingerprint recognition system in our proposed system. These are a fingerprint image enhancement algorithm, a fingerprint image quality evaluation algorithm and a feedback unit, the purpose of which is to provide analytical information collected at the image capture stage to the system user. In this thesis, all relevant information will be introduced, and we will also show some experimental results obtained with the proposed algorithms, and comparative studies with other existed algorithms will also be presented