|Title||Heap-Based Algorithms to Accelerate Fingerprint Matching on Parallel Platforms|
|Publication Type||Conference Paper|
|Year of Publication||2019|
|Authors||Barrientos, RJ, Hernández-García, R, Ortega, K, Luque, E, Peralta, D|
|Conference Name||Cloud Computing and Big Data|
|Publisher||Springer International Publishing|
|Conference Location||La Plata, Argentina|
Nowadays, fingerprint is the most used biometric trait for individuals identification. In this area, the state-of-the-art algorithms are very accurate, but when the database contains millions of identities, an acceleration of the algorithm is required. From these algorithms, Minutia Cylinder-Code (MCC) stands out for its good results in terms of accuracy, however its efficiency in computational time is not high. In this work, we propose to use two different parallel platforms to accelerate fingerprint matching process by using MCC: (1) a multi-core server, and (2) a Xeon Phi coprocessor. Our proposal is based on heaps as auxiliary structure to process the global similarity of MCC. As heap-based algorithms are exhaustive (all the elements are accessed), we also explored the use an indexing algorithm to avoid comparing the query against all the fingerprints of the database. Experimental results show an improvement up to 97.15x of speed-up, which is competitive compared to other state-of-the-art algorithms in GPU and FPGA. To the best of our knowledge, this is the first work for fingerprint identification using a Xeon Phi coprocessor.