FaceNet: A Unified Embedding for Face Recognition and Clustering
Authors: Florian Schroff, Dmitry Kalenichenko, James Philbin
AI-generated Key Points
- Face recognition and verification at scale are challenging tasks for current approaches
- Authors present a system called FaceNet that directly learns a mapping from face images to a compact Euclidean space where distances correspond to a measure of face similarity
- This approach enables efficient implementation of tasks such as face recognition, verification, and clustering using standard techniques with FaceNet embeddings as feature vectors
- The authors' method uses a deep convolutional network trained to optimize the embedding itself, unlike previous deep learning approaches that use an intermediate bottleneck layer
- To train the model, they use triplets of roughly aligned matching/non-matching face patches generated using an online triplet mining method
- Their system achieves state-of-the-art face recognition performance using only 128-bytes per face on Labeled Faces in the Wild (LFW) dataset and YouTube Faces DB.
- On LFW dataset, their system achieves a new record accuracy of 99.63%, while on YouTube Faces DB it achieves 95.12%
- Compared to the best published results on both datasets, their system cuts down the error rate by 30%
- The authors also introduce the concept of harmonic embeddings and harmonic triplet loss that describe different versions of face embeddings produced by different networks that are compatible with each other and allow for direct comparison between them.
- Overall, FaceNet's direct learning approach offers significant improvements in representational efficiency and accuracy compared to previous methods for implementing face recognition and verification at scale.
Abstract: Despite significant recent advances in the field of face recognition, implementing face verification and recognition efficiently at scale presents serious challenges to current approaches. In this paper we present a system, called FaceNet, that directly learns a mapping from face images to a compact Euclidean space where distances directly correspond to a measure of face similarity. Once this space has been produced, tasks such as face recognition, verification and clustering can be easily implemented using standard techniques with FaceNet embeddings as feature vectors. Our method uses a deep convolutional network trained to directly optimize the embedding itself, rather than an intermediate bottleneck layer as in previous deep learning approaches. To train, we use triplets of roughly aligned matching / non-matching face patches generated using a novel online triplet mining method. The benefit of our approach is much greater representational efficiency: we achieve state-of-the-art face recognition performance using only 128-bytes per face. On the widely used Labeled Faces in the Wild (LFW) dataset, our system achieves a new record accuracy of 99.63%. On YouTube Faces DB it achieves 95.12%. Our system cuts the error rate in comparison to the best published result by 30% on both datasets. We also introduce the concept of harmonic embeddings, and a harmonic triplet loss, which describe different versions of face embeddings (produced by different networks) that are compatible to each other and allow for direct comparison between each other.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.