首页 > 最新文献

Proceedings of the 2017 Workshop on Recognizing Families In the Wild最新文献

英文 中文
Session details: Session 1: Visual Recognition of Families In the Wild: A Big Data Challenge 会议详情:第一场:野外家庭的视觉识别:大数据挑战
Timothy Gillis
{"title":"Session details: Session 1: Visual Recognition of Families In the Wild: A Big Data Challenge","authors":"Timothy Gillis","doi":"10.1145/3247931","DOIUrl":"https://doi.org/10.1145/3247931","url":null,"abstract":"","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131697033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recognizing Families In the Wild (RFIW): Data Challenge Workshop in conjunction with ACM MM 2017 识别野外家庭(RFIW):与ACM MM 2017联合举办的数据挑战研讨会
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3134424
Joseph P. Robinson, Ming Shao, Handong Zhao, Yue Wu, Timothy Gillis, Y. Fu
Recognizing Families In the Wild (RFIW) is a large-scale, multi-track automatic kinship recognition evaluation, supporting both kinship verification and family classification on scales much larger than ever before. It was organized as a Data Challenge Workshop hosted in conjunction with ACM Multimedia 2017. This was achieved with the largest image collection that supports kin-based vision tasks. In the end, we use this manuscript to summarize evaluation protocols, progress made and some technical background and performance ratings of the algorithms used, and a discussion on promising directions for both research and engineers to be taken next in this line of work.
野外家庭识别(RFIW)是一种大规模、多轨自动亲属识别评估系统,支持比以往更大规模的亲属验证和家庭分类。它是与ACM多媒体2017联合举办的数据挑战研讨会。这是通过支持基于亲属的视觉任务的最大图像集实现的。最后,我们用这份手稿来总结评估协议,取得的进展和一些技术背景和性能评级所使用的算法,并讨论了有希望的方向,为研究和工程师在这方面的下一步工作。
{"title":"Recognizing Families In the Wild (RFIW): Data Challenge Workshop in conjunction with ACM MM 2017","authors":"Joseph P. Robinson, Ming Shao, Handong Zhao, Yue Wu, Timothy Gillis, Y. Fu","doi":"10.1145/3134421.3134424","DOIUrl":"https://doi.org/10.1145/3134421.3134424","url":null,"abstract":"Recognizing Families In the Wild (RFIW) is a large-scale, multi-track automatic kinship recognition evaluation, supporting both kinship verification and family classification on scales much larger than ever before. It was organized as a Data Challenge Workshop hosted in conjunction with ACM Multimedia 2017. This was achieved with the largest image collection that supports kin-based vision tasks. In the end, we use this manuscript to summarize evaluation protocols, progress made and some technical background and performance ratings of the algorithms used, and a discussion on promising directions for both research and engineers to be taken next in this line of work.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133075645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Proceedings of the 2017 Workshop on Recognizing Families In the Wild 2017年野外家庭识别研讨会论文集
Y. Fu, Joseph P. Robinson, Ming Shao, Siyu Xia
It is our great pleasure to welcome you to the 2017 Recognizing Families In the Wild (RFIW) -- RFIW'17, based on the 1st ever large-scale visual kinship recognition data challenge workshop. RFIW'17 was organized with Families In the Wild (FIW)-the largest image database for kinship recognition. Kinship recognition has an abundance of practical uses. Including, but not limited to, forensic investigations, photo library management, historic lineage & genealogical studies, social-media- based analysis, cases of missing children & human tracking, and problems of immigration & border patrol. This workshop will cover the results of the data challenge, the current status and plans for FIW, and the past, present and future of kinship recognition. RFIW gives researchers and practitioners a unique opportunity to exchange their perspectives with others interested in the various aspects of kinship recognition technologies. Participants of the competition spanned all over the globe. We had nearly 100 teams register for the event, with 12 teams submitting competitive results, and 6 of which had their work published. RFIW'17 workshop is on 27 October 2017 at ACM MM. The agenda includes the following: RFIW Data Workshop Introduction and Overview Oral presentations (2) given by top performers of RFIW Poster Presentations by all other authors during coffee break Past, Present, and Future of Kinship Recognition, FIW, and upcoming events Additionally, we have two great keynotes coming to share complimentary views of the problem: Rapid DNA Performance Results on Family Relationship Verification, Christopher Miles (Department of Homeland Security) Recent Advances in Deep Reinforcement Learning for Computer Vision and NLP, Caiming Xiong (Salesforce Research) We encourage attendees to join us to learn from these valuable and insightful speakers that will guide us to a better understanding of the future.
我们非常高兴地欢迎您参加2017年野外家庭识别(RFIW)—RFIW'17,这是基于有史以来第一次大规模视觉亲属识别数据挑战研讨会。RFIW'17是与最大的亲属识别图像数据库“野外家庭”(FIW)一起组织的。亲属关系承认有许多实际用途。包括但不限于,法医调查,照片库管理,历史血统和家谱研究,基于社交媒体的分析,失踪儿童和人类追踪案件,以及移民和边境巡逻问题。本次研讨会将涵盖数据挑战的结果、FIW的现状和计划,以及亲属关系识别的过去、现在和未来。RFIW为研究人员和实践者提供了一个独特的机会,与对亲属识别技术的各个方面感兴趣的其他人交流他们的观点。比赛的参加者来自世界各地。我们有近100个团队报名参加了这次活动,其中12个团队提交了有竞争力的结果,其中6个团队发表了他们的作品。RFIW'17研讨会将于2017年10月27日在ACM MM举行。议程包括以下内容:RFIW数据研讨会介绍和概述RFIW顶级表演者在咖啡休息时间进行口头报告(2),由所有其他作者在亲属关系识别,FIW和即将举行的活动的过去,现在和未来进行海报演讲。此外,我们有两个很棒的主题演讲来分享这个问题的免费观点:家庭关系验证的快速DNA性能结果,Christopher Miles(国土安全部),计算机视觉和NLP深度强化学习的最新进展,caaiming Xiong (Salesforce Research),我们鼓励与会者加入我们,向这些有价值和有见地的演讲者学习,这些演讲者将引导我们更好地了解未来。
{"title":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","authors":"Y. Fu, Joseph P. Robinson, Ming Shao, Siyu Xia","doi":"10.1145/3134421","DOIUrl":"https://doi.org/10.1145/3134421","url":null,"abstract":"It is our great pleasure to welcome you to the 2017 Recognizing Families In the Wild (RFIW) -- RFIW'17, based on the 1st ever large-scale visual kinship recognition data challenge workshop. RFIW'17 was organized with Families In the Wild (FIW)-the largest image database for kinship recognition. Kinship recognition has an abundance of practical uses. Including, but not limited to, forensic investigations, photo library management, historic lineage & genealogical studies, social-media- based analysis, cases of missing children & human tracking, and problems of immigration & border patrol. This workshop will cover the results of the data challenge, the current status and plans for FIW, and the past, present and future of kinship recognition. RFIW gives researchers and practitioners a unique opportunity to exchange their perspectives with others interested in the various aspects of kinship recognition technologies. \u0000 \u0000Participants of the competition spanned all over the globe. We had nearly 100 teams register for the event, with 12 teams submitting competitive results, and 6 of which had their work published. \u0000 \u0000RFIW'17 workshop is on 27 October 2017 at ACM MM. The agenda includes the following: \u0000RFIW Data Workshop Introduction and Overview \u0000Oral presentations (2) given by top performers of RFIW \u0000Poster Presentations by all other authors during coffee break \u0000Past, Present, and Future of Kinship Recognition, FIW, and upcoming events \u0000 \u0000 \u0000 \u0000Additionally, we have two great keynotes coming to share complimentary views of the problem: \u0000Rapid DNA Performance Results on Family Relationship Verification, Christopher Miles (Department of Homeland Security) \u0000Recent Advances in Deep Reinforcement Learning for Computer Vision and NLP, Caiming Xiong (Salesforce Research) \u0000 \u0000 \u0000 \u0000We encourage attendees to join us to learn from these valuable and insightful speakers that will guide us to a better understanding of the future.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130568752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Kin-Verification Model on FIW Dataset Using Multi-Set Learning and Local Features 基于多集学习和局部特征的FIW数据集亲属验证模型
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3134423
Eran Dahan, Y. Keller, Shahar Mahpod
Kinship Verification of two or more people has shown to be a complicated problem, though it is widely used in various practical tasks and applications. The areas of the use-cases vary. Among them are applications for homeland security, automatic family recognition, youth and elder matching or predicting and more. We propose using Deep Learning approach to deal with the problem of Kin Verification, such to provide a logical explanation for solving the problem with a novel mechanism for training on the FIW data-set. Our method obtains state-of-the-art for the FIW challenge for the restricted-image setting11
虽然在各种实际任务和应用中被广泛应用,但两个或两个以上的人的亲属关系验证已被证明是一个复杂的问题。用例的区域各不相同。其中包括国土安全、家庭自动识别、青年和老年人匹配或预测等应用。我们建议使用深度学习方法来处理Kin验证问题,从而为在FIW数据集上使用一种新的训练机制来解决问题提供一个逻辑解释。我们的方法为限制图像设置的FIW挑战获得了最先进的技术
{"title":"Kin-Verification Model on FIW Dataset Using Multi-Set Learning and Local Features","authors":"Eran Dahan, Y. Keller, Shahar Mahpod","doi":"10.1145/3134421.3134423","DOIUrl":"https://doi.org/10.1145/3134421.3134423","url":null,"abstract":"Kinship Verification of two or more people has shown to be a complicated problem, though it is widely used in various practical tasks and applications. The areas of the use-cases vary. Among them are applications for homeland security, automatic family recognition, youth and elder matching or predicting and more. We propose using Deep Learning approach to deal with the problem of Kin Verification, such to provide a logical explanation for solving the problem with a novel mechanism for training on the FIW data-set. Our method obtains state-of-the-art for the FIW challenge for the restricted-image setting11","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114542295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Session details: Keynote & Invited Talks 会议详情:主题演讲和特邀演讲
Joseph P. Robinson
{"title":"Session details: Keynote & Invited Talks","authors":"Joseph P. Robinson","doi":"10.1145/3247930","DOIUrl":"https://doi.org/10.1145/3247930","url":null,"abstract":"","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122094139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Recent Progress in Deep Reinforcement Learning for Computer Vision and NLP 面向计算机视觉和自然语言处理的深度强化学习研究进展
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3137039
Caiming Xiong
Deep reinforcement learning is considered as a way of building autonomous system with a higher level understanding of the world and would revolutionize the field of AI. Recently, some researchers have made many progresses such as learning to play video games like Atari, learning control policy for robots from camera input. In this talk, we begin with general introduction of deep reinforcement learning algorithms, including policy optimization, deep Qlearning, then we will highlight the progresses that have achieved in Vision and NLP via DRL.
深度强化学习被认为是建立对世界有更高层次理解的自主系统的一种方式,将彻底改变人工智能领域。近年来,一些研究人员取得了许多进展,如学习玩雅达利等电子游戏,从摄像机输入学习机器人的控制策略。在本次演讲中,我们将从深度强化学习算法的一般介绍开始,包括策略优化,深度Qlearning,然后我们将重点介绍通过DRL在视觉和NLP方面取得的进展。
{"title":"Recent Progress in Deep Reinforcement Learning for Computer Vision and NLP","authors":"Caiming Xiong","doi":"10.1145/3134421.3137039","DOIUrl":"https://doi.org/10.1145/3134421.3137039","url":null,"abstract":"Deep reinforcement learning is considered as a way of building autonomous system with a higher level understanding of the world and would revolutionize the field of AI. Recently, some researchers have made many progresses such as learning to play video games like Atari, learning control policy for robots from camera input. In this talk, we begin with general introduction of deep reinforcement learning algorithms, including policy optimization, deep Qlearning, then we will highlight the progresses that have achieved in Vision and NLP via DRL.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125996145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
KinNet
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3134425
Yong Li, Jiabei Zeng, Jie Zhang, Anbo Dai, Meina Kan, S. Shan, Xilin Chen
Automatic kinship verification has attracted increasing attentions as it holds promise to an abundance of applications. However, existing kinship verification methods suffer from the lack of large scale real-world data. Without enough training data, it is difficult to learn proper features that are discriminant for blood-related peoples. In this work, we propose KinNet, a fine-to-coarse deep metric learning framework for kinship verification. In the framework, we transfer knowledge from the large-scale-data-driven face recognition task, which is a fine-grained version of kinship recognition, by pre-training the network with massive data for face recognition. Then, the network is fine-tuned to find a metric space where kin-related peoples are discriminant. The metric space is learned by minimizing a soft triplet loss on the augmented kinship dataset. An augmented strategy is proposed to balance the amount of images per family member. Finally, we ensemble four networks to further boost the performance. The experimental results on the 1st Large-Scale Kinship Recognition Data Challenge (Track 1) demonstrate that our KinNet achieves the state-of-the-art performance in kinship verification.
{"title":"KinNet","authors":"Yong Li, Jiabei Zeng, Jie Zhang, Anbo Dai, Meina Kan, S. Shan, Xilin Chen","doi":"10.1145/3134421.3134425","DOIUrl":"https://doi.org/10.1145/3134421.3134425","url":null,"abstract":"Automatic kinship verification has attracted increasing attentions as it holds promise to an abundance of applications. However, existing kinship verification methods suffer from the lack of large scale real-world data. Without enough training data, it is difficult to learn proper features that are discriminant for blood-related peoples. In this work, we propose KinNet, a fine-to-coarse deep metric learning framework for kinship verification. In the framework, we transfer knowledge from the large-scale-data-driven face recognition task, which is a fine-grained version of kinship recognition, by pre-training the network with massive data for face recognition. Then, the network is fine-tuned to find a metric space where kin-related peoples are discriminant. The metric space is learned by minimizing a soft triplet loss on the augmented kinship dataset. An augmented strategy is proposed to balance the amount of images per family member. Finally, we ensemble four networks to further boost the performance. The experimental results on the 1st Large-Scale Kinship Recognition Data Challenge (Track 1) demonstrate that our KinNet achieves the state-of-the-art performance in kinship verification.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127106060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
AdvNet: Adversarial Contrastive Residual Net for 1 Million Kinship Recognition 百万亲属识别的对抗对比剩余网
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3134422
Qingyan Duan, Lei Zhang
Kinship verification in the wild is an interesting and challenging problem. The goal of kinship verification is to determine whether a pair of faces are blood relatives or not. Most previous methods for kinship verification can be divided as hand-crafted features based shallow learning methods and convolutional neural network (CNN) based deep learning methods. Nevertheless, these methods are still posed with the challenging task of recognizing kinship cues from facial images. Part of the reason for this may be that, the family information and the distribution difference of pairwise kin-face data based kinship verification issue are rarely considered. Inspired by maximum mean discrepancy (MMD) and generative adversarial net (GAN), family ID based Adversarial contrastive residual Network (AdvNet) is proposed for large-scale (1 Million) kinship recognition in this paper. The MMD based adversarial loss (AL), pairwise contrastive loss (CL) and family ID based softmax loss (SL) are jointly formulated in the proposed AdvNet for kin-relation enhancement and discovery. Further, the deep nets ensemble is used for deep kin-feature augmentation. Finally, Euclidean distance metric is used for kinship recognition. Extensive experiments on the 1st Large-Scale Kinship Recognition Data Challenge (Families in the wild) show the effectiveness of our proposed AdvNet and ensemble based feature augmentation.
野外亲属关系验证是一个有趣而富有挑战性的问题。亲属关系验证的目的是确定一对面孔是否是血亲。以往的亲属关系验证方法大多可以分为基于手工特征的浅学习方法和基于卷积神经网络(CNN)的深度学习方法。然而,这些方法仍然面临着从面部图像中识别亲属关系线索的挑战性任务。造成这种情况的部分原因可能是,家庭信息和基于成对亲属数据的亲属关系验证问题的分布差异很少被考虑。受最大平均差异(MMD)和生成对抗网络(GAN)的启发,提出了一种基于家庭ID的对抗对比残差网络(AdvNet),用于大规模(100万)亲属识别。基于MMD的对抗损失(AL)、配对对比损失(CL)和基于族ID的软最大损失(SL)在AdvNet中被联合提出,用于亲族关系增强和发现。进一步,将深度网络集成用于深度亲属特征增强。最后,欧几里得距离度量用于亲属识别。在第一次大规模亲属识别数据挑战(野外家庭)上进行的大量实验表明,我们提出的AdvNet和基于集成的特征增强是有效的。
{"title":"AdvNet: Adversarial Contrastive Residual Net for 1 Million Kinship Recognition","authors":"Qingyan Duan, Lei Zhang","doi":"10.1145/3134421.3134422","DOIUrl":"https://doi.org/10.1145/3134421.3134422","url":null,"abstract":"Kinship verification in the wild is an interesting and challenging problem. The goal of kinship verification is to determine whether a pair of faces are blood relatives or not. Most previous methods for kinship verification can be divided as hand-crafted features based shallow learning methods and convolutional neural network (CNN) based deep learning methods. Nevertheless, these methods are still posed with the challenging task of recognizing kinship cues from facial images. Part of the reason for this may be that, the family information and the distribution difference of pairwise kin-face data based kinship verification issue are rarely considered. Inspired by maximum mean discrepancy (MMD) and generative adversarial net (GAN), family ID based Adversarial contrastive residual Network (AdvNet) is proposed for large-scale (1 Million) kinship recognition in this paper. The MMD based adversarial loss (AL), pairwise contrastive loss (CL) and family ID based softmax loss (SL) are jointly formulated in the proposed AdvNet for kin-relation enhancement and discovery. Further, the deep nets ensemble is used for deep kin-feature augmentation. Finally, Euclidean distance metric is used for kinship recognition. Extensive experiments on the 1st Large-Scale Kinship Recognition Data Challenge (Families in the wild) show the effectiveness of our proposed AdvNet and ensemble based feature augmentation.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127489078","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 26
RFIW 2017: LPQ-SIEDA for Large Scale Kinship Verification RFIW 2017: LPQ-SIEDA大规模亲属关系验证
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3134426
Oualid Laiadi, A. Ouamane, A. Benakcha, A. Taleb-Ahmed
As a part of the RFIW 2017 Data Challenge Workshop, we demonstrate performance on the large-scale FIW dataset, along with several pre-existing image collections. Noticing available version of SIEDA method work well on smaller datasets (i.e. Cornell and UB KinFace datasets) than on FIW, we propose modifications to address this disparity in results.
作为RFIW 2017数据挑战研讨会的一部分,我们演示了大规模FIW数据集以及几个预先存在的图像集合的性能。注意到现有版本的SIEDA方法在较小的数据集(即Cornell和UB KinFace数据集)上比在FIW上工作得更好,我们提出修改以解决结果中的这种差异。
{"title":"RFIW 2017: LPQ-SIEDA for Large Scale Kinship Verification","authors":"Oualid Laiadi, A. Ouamane, A. Benakcha, A. Taleb-Ahmed","doi":"10.1145/3134421.3134426","DOIUrl":"https://doi.org/10.1145/3134421.3134426","url":null,"abstract":"As a part of the RFIW 2017 Data Challenge Workshop, we demonstrate performance on the large-scale FIW dataset, along with several pre-existing image collections. Noticing available version of SIEDA method work well on smaller datasets (i.e. Cornell and UB KinFace datasets) than on FIW, we propose modifications to address this disparity in results.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116795245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Rapid DNA Performance Results on Family Relationship Verification 家庭关系验证的快速DNA性能结果
Pub Date : 2017-10-27 DOI: 10.1145/3134421.3137040
Christopher Miles
The Department of Homeland Security (DHS) Science and Technology Directorate (S&T), working with other Federal partners, developed Rapid DNA technology to meet a DHS requirement to verify family relationship claims to reduce fraud and expedite legal immigration. Several hundred thousand immigration relationship tests are processed annually for DHS by AABB accredited laboratories. The AABB Relationship Testing Subcommittee sets the standards for those tests and accreditation of relationship testing laboratories. But, shipping of the collection kits overseas and coordinating DNA collection can cause these tests to take weeks to months to process and results to be returned. Rapid DNA uses microfluidics technology to reduce the million-dollar clean-room DNA processes down to a standalone, integrated, and automated desktop system that processes five to seven DNA samples in 90 minutes in a closed, hands-off system. Rapid DNA is built to be operated by DHS field officers and agents. It is about the size of a laser printer, and can be operated in an office setting by anyone who can change a printer cartridge. It is also ruggedized to military requirements, and can be operated in hazardous field environments on generator power. Setup takes just 15 minutes. With success showing that Rapid DNA accurately verifies family relationships, additional DHS needs were identified to fight human trafficking along U.S. borders and reunify families following critical or mass-casualty incidents. This presentation will discuss the DHS needs for family relationship verification, AABB Standards, and Rapid DNA performance and field test results.
国土安全部(DHS)科学技术局(S&T)与其他联邦伙伴合作,开发了快速DNA技术,以满足国土安全部核实家庭关系索赔的要求,以减少欺诈和加快合法移民。AABB认可的实验室每年为国土安全部处理数十万项移民关系测试。AABB关系测试小组委员会为这些测试和关系测试实验室的认证制定标准。但是,将采集试剂盒运送到海外并协调DNA采集可能会导致这些测试需要数周到数月的时间来处理,并需要返回结果。快速DNA使用微流体技术将价值百万美元的洁净室DNA处理过程简化为一个独立的、集成的、自动化的桌面系统,在一个封闭的、不干涉的系统中,在90分钟内处理5到7个DNA样本。快速DNA是由国土安全部的外勤人员和特工操作的。它的大小和一台激光打印机差不多,只要能更换打印机墨盒,任何人都可以在办公室操作。它也加固了军事要求,并可以在危险的野外环境中运行发电机电源。安装只需要15分钟。由于“快速DNA”项目取得了成功,可以准确地核实家庭关系,国土安全部确定了更多的需求,以打击沿美国边境的人口贩运,并在发生重大或大规模伤亡事件后使家庭团聚。本报告将讨论国土安全部对家庭关系验证、AABB标准、快速DNA性能和现场测试结果的需求。
{"title":"Rapid DNA Performance Results on Family Relationship Verification","authors":"Christopher Miles","doi":"10.1145/3134421.3137040","DOIUrl":"https://doi.org/10.1145/3134421.3137040","url":null,"abstract":"The Department of Homeland Security (DHS) Science and Technology Directorate (S&T), working with other Federal partners, developed Rapid DNA technology to meet a DHS requirement to verify family relationship claims to reduce fraud and expedite legal immigration. Several hundred thousand immigration relationship tests are processed annually for DHS by AABB accredited laboratories. The AABB Relationship Testing Subcommittee sets the standards for those tests and accreditation of relationship testing laboratories. But, shipping of the collection kits overseas and coordinating DNA collection can cause these tests to take weeks to months to process and results to be returned. Rapid DNA uses microfluidics technology to reduce the million-dollar clean-room DNA processes down to a standalone, integrated, and automated desktop system that processes five to seven DNA samples in 90 minutes in a closed, hands-off system. Rapid DNA is built to be operated by DHS field officers and agents. It is about the size of a laser printer, and can be operated in an office setting by anyone who can change a printer cartridge. It is also ruggedized to military requirements, and can be operated in hazardous field environments on generator power. Setup takes just 15 minutes. With success showing that Rapid DNA accurately verifies family relationships, additional DHS needs were identified to fight human trafficking along U.S. borders and reunify families following critical or mass-casualty incidents. This presentation will discuss the DHS needs for family relationship verification, AABB Standards, and Rapid DNA performance and field test results.","PeriodicalId":209776,"journal":{"name":"Proceedings of the 2017 Workshop on Recognizing Families In the Wild","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129486421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Proceedings of the 2017 Workshop on Recognizing Families In the Wild
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1