HackerPapers

arXiv:1503.03832cs.CV

FaceNet: A Unified Embedding for Face Recognition and Clustering

Florian Schroff, Dmitry Kalenichenko, James Philbin

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.

arXiv comments
Also published, in Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2015
Journal reference
DOI
doi:10.1109/CVPR.2015.7298682
Subjects
cs.CVComputer Vision and Pattern Recognition

On Hacker News

Linked by 6 identifiable commenters in 6 comments across 6 threads, from Apr 2016 to Jul 2019. Found in 2 HN submissions from Mar 2015 to Mar 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments6 threads

    • A single picture is surprisingly effective in recognizing that person in another photo. I've been playing around with a python wrapper on dlib's facial recognition [0] and it's astonishing how it can identify people from just one photo. It's not like other machine learning…

      bkoView on HNParent context

    • The authors didn't try very hard to solve the problem (although it's still slightly interesting). Many networks can detect if two never-before-seen objects are the same or different. Simple example is Koch's Siamese Neural Networks[1]. More useful example is Facenet[2], which…

      paulsutterView on HNParent context

    • They would probably use FaceNet[0] then, if they only want to detect faces, as that should give better results. [0] https://arxiv.org/abs/1503.03832

      halflingsView on HNParent context

  1. Machine Learning 1 comment
    • A single NN can predict more than one class of object. The ImageNet competition has 20,000 classes. There's also image segmentation as another poster has pointed to. In the case of FB face tagging, they'd have learn an embedding space for faces, and when a new image comes in…

      nlView on HNParent context

    • The Google FaceNet and other similar system typically perform an approximate nearest neighbor search in a ~128 dimensional embedding of faces. Here is the paper for the reference: http://arxiv.org/pdf/1503.03832v3.pdf Also 70% accuracy is like really really bad. Here are results…

      aub3bhatView on HNParent context

    • I am not sure this works or that success rates like claimed are possible: > In 70 percent of cases, he was quite easily able to identify the people he had photographed. VKontakte has 280m+ accounts and is the second most popular website in Russia…

      gwernView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.