A feasibility study on the use of binary keypoint descriptors for 3D face recognition

5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Despite the progress made in the area of local image descriptors in recent years, virtually no literature is available on the use of more recent descriptors for the problem of 3D face recognition, such as BRIEF, ORB, BRISK or FREAK, which are binary in nature and, therefore, tend to be faster to compute and match, while requiring significantly less memory for storage than, for example, SIFT or SURF. In this paper, we try to close this gap and present a feasibility study on the use of these descriptors for 3D face recognition. Descriptors are evaluated on the three challenging 3D face image datasets, namely, the FRGC, UMB and CASIA. Our experiments show the binary descriptors ensure slightly lower verification rates than SIFT, comparable to those of the SURF descriptor, while being an order of magnitude faster than SIFT. The results suggest that the use of binary descriptors represents a viable alternative to the established descriptors. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Križaj, J., Štruc, V., & Mihelič, F. (2014). A feasibility study on the use of binary keypoint descriptors for 3D face recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8495 LNCS, pp. 142–151). Springer Verlag. https://doi.org/10.1007/978-3-319-07491-7_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free