Triplet Similarity Embedding for Face Verification
Not on the map. Why?
Abstract (arXiv)
In this work, we present an unconstrained face verification algorithm and evaluate it on the recently released IJB-A dataset that aims to push the boundaries of face verification methods. The proposed algorithm couples a deep CNN-based approach with a low-dimensional discriminative embedding learnt using triplet similarity constraints in a large margin fashion. Aside from yielding performance improvement, this embedding provides significant advantages in terms of memory and post-processing operations like hashing and visualization. Experiments on the IJB-A dataset show that the proposed algorithm outperforms state of the art methods in verification and identification metrics, while requiring less training time.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2022Deep face recognition with clustering based domain adaptationcited by 3
- 2023Adaptive Face Recognition Using Adversarial Information Networkcited by 1
- 2022A Survey on Face Recognition Systemscited by 0
- 2024Deep Learning for Leopard Individual Identification: An Adaptive Angular Margin Approachcited by 0
- 2024Deep Learning for Leopard Individual Identification: An Adaptive Angular Margin Approach4 Nov 2024
- 2023Adaptive Face Recognition Using Adversarial Information Network23 May 2023
- 2022Deep face recognition with clustering based domain adaptation27 May 2022
- 2022A Survey on Face Recognition Systems9 Jan 2022