WebFace260M:百万级深度人脸识别的基准

IF 20.8 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Zheng Hua Zhu, Guan Huang, Jiankang Deng, Yun Ye, Junjie Huang, Xinze Chen, Jiagang Zhu, Tian Yang, Dalong Du, Jiwen Lu, Jie Zhou
{"title":"WebFace260M:百万级深度人脸识别的基准","authors":"Zheng Hua Zhu, Guan Huang, Jiankang Deng, Yun Ye, Junjie Huang, Xinze Chen, Jiagang Zhu, Tian Yang, Dalong Du, Jiwen Lu, Jie Zhou","doi":"10.48550/arXiv.2204.10149","DOIUrl":null,"url":null,"abstract":"In this paper, we contribute a new million-scale recognition benchmark, containing uncurated 4M identities/260M faces (WebFace260M) and cleaned 2M identities/42M faces (WebFace42M) training data, as well as an elaborately designed time-constrained evaluation protocol. Firstly, we collect 4M name lists and download 260M faces from the Internet. Then, a Cleaning Automatically utilizing Self-Training pipeline is devised to purify the tremendous WebFace260M, which is efficient and scalable. To our best knowledge, the cleaned WebFace42M is the largest public face recognition training set in the community. Referring to practical deployments, Face Recognition under Inference Time conStraint (FRUITS) protocol and a new test set with rich attributes are constructed. Moreover, we gather a large-scale masked face sub-set for biometrics assessment under COVID-19. For a comprehensive evaluation of face matchers, three recognition tasks are performed under standard, masked and unbiased settings, respectively. Equipped with this benchmark, we delve into million-scale face recognition problems. Enabled by WebFace42M, we reduce 40% failure rate on the challenging IJB-C set and rank the 3rd among 430 entries on NIST-FRVT. Even 10% data (WebFace4M) shows superior performance compared with the public training set. The proposed benchmark shows enormous potential on standard, masked and unbiased face recognition scenarios.","PeriodicalId":13426,"journal":{"name":"IEEE Transactions on Pattern Analysis and Machine Intelligence","volume":"PP 1","pages":"1-1"},"PeriodicalIF":20.8000,"publicationDate":"2022-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"WebFace260M: A Benchmark for Million-Scale Deep Face Recognition\",\"authors\":\"Zheng Hua Zhu, Guan Huang, Jiankang Deng, Yun Ye, Junjie Huang, Xinze Chen, Jiagang Zhu, Tian Yang, Dalong Du, Jiwen Lu, Jie Zhou\",\"doi\":\"10.48550/arXiv.2204.10149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we contribute a new million-scale recognition benchmark, containing uncurated 4M identities/260M faces (WebFace260M) and cleaned 2M identities/42M faces (WebFace42M) training data, as well as an elaborately designed time-constrained evaluation protocol. Firstly, we collect 4M name lists and download 260M faces from the Internet. Then, a Cleaning Automatically utilizing Self-Training pipeline is devised to purify the tremendous WebFace260M, which is efficient and scalable. To our best knowledge, the cleaned WebFace42M is the largest public face recognition training set in the community. Referring to practical deployments, Face Recognition under Inference Time conStraint (FRUITS) protocol and a new test set with rich attributes are constructed. Moreover, we gather a large-scale masked face sub-set for biometrics assessment under COVID-19. For a comprehensive evaluation of face matchers, three recognition tasks are performed under standard, masked and unbiased settings, respectively. Equipped with this benchmark, we delve into million-scale face recognition problems. Enabled by WebFace42M, we reduce 40% failure rate on the challenging IJB-C set and rank the 3rd among 430 entries on NIST-FRVT. Even 10% data (WebFace4M) shows superior performance compared with the public training set. The proposed benchmark shows enormous potential on standard, masked and unbiased face recognition scenarios.\",\"PeriodicalId\":13426,\"journal\":{\"name\":\"IEEE Transactions on Pattern Analysis and Machine Intelligence\",\"volume\":\"PP 1\",\"pages\":\"1-1\"},\"PeriodicalIF\":20.8000,\"publicationDate\":\"2022-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Pattern Analysis and Machine Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2204.10149\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Pattern Analysis and Machine Intelligence","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.48550/arXiv.2204.10149","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 14

摘要

在本文中,我们提供了一个新的百万级识别基准,包含未经整理的4M身份/260M张脸(WebFace260M)和清理过的2M身份/42M张脸(WebFace42M)训练数据,以及精心设计的时间约束评估协议。首先,我们从互联网上收集了4M个名单,下载了260M张面孔。然后,设计了一个利用自我训练的自动清洗管道来净化庞大的WebFace260M,该管道具有高效和可扩展性。据我们所知,清理后的WebFace42M是社区中最大的公共人脸识别训练集。结合实际部署,构造了基于推理时间约束的人脸识别协议(fruit)和一个新的富属性测试集。此外,我们收集了一个大规模的蒙面子集,用于COVID-19下的生物特征评估。为了对人脸匹配器进行综合评价,分别在标准、屏蔽和无偏设置下进行了三种识别任务。有了这个基准,我们就可以深入研究百万尺度的人脸识别问题。在WebFace42M的支持下,我们在具有挑战性的IJB-C集上降低了40%的故障率,在NIST-FRVT的430个参赛作品中排名第三。即使是10%的数据(WebFace4M)也显示出比公共训练集更好的性能。所提出的基准在标准、屏蔽和无偏人脸识别场景中显示出巨大的潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WebFace260M: A Benchmark for Million-Scale Deep Face Recognition
In this paper, we contribute a new million-scale recognition benchmark, containing uncurated 4M identities/260M faces (WebFace260M) and cleaned 2M identities/42M faces (WebFace42M) training data, as well as an elaborately designed time-constrained evaluation protocol. Firstly, we collect 4M name lists and download 260M faces from the Internet. Then, a Cleaning Automatically utilizing Self-Training pipeline is devised to purify the tremendous WebFace260M, which is efficient and scalable. To our best knowledge, the cleaned WebFace42M is the largest public face recognition training set in the community. Referring to practical deployments, Face Recognition under Inference Time conStraint (FRUITS) protocol and a new test set with rich attributes are constructed. Moreover, we gather a large-scale masked face sub-set for biometrics assessment under COVID-19. For a comprehensive evaluation of face matchers, three recognition tasks are performed under standard, masked and unbiased settings, respectively. Equipped with this benchmark, we delve into million-scale face recognition problems. Enabled by WebFace42M, we reduce 40% failure rate on the challenging IJB-C set and rank the 3rd among 430 entries on NIST-FRVT. Even 10% data (WebFace4M) shows superior performance compared with the public training set. The proposed benchmark shows enormous potential on standard, masked and unbiased face recognition scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
28.40
自引率
3.00%
发文量
885
审稿时长
8.5 months
期刊介绍: The IEEE Transactions on Pattern Analysis and Machine Intelligence publishes articles on all traditional areas of computer vision and image understanding, all traditional areas of pattern analysis and recognition, and selected areas of machine intelligence, with a particular emphasis on machine learning for pattern analysis. Areas such as techniques for visual search, document and handwriting analysis, medical image analysis, video and image sequence analysis, content-based retrieval of image and video, face and gesture recognition and relevant specialized hardware and/or software architectures are also covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信