首页> 外文会议>International Joint Conference on Web Intelligence and Intelligent Agent Technology >Spotting celebrities among peers in a TV show: how to exploit web querying for weakly supervised visual diarization
【24h】

Spotting celebrities among peers in a TV show: how to exploit web querying for weakly supervised visual diarization

机译:在电视节目中发现名人:如何利用Web查询弱监督的视觉深度

获取原文

摘要

In this paper, we propose a novel solution for popularity recognition. This methodology consists of categorizing and exploiting web image resources of people in terms of relevant identities. To demonstrate its usefulness, we also study the effects of incorporating this procedure into a visual diarization system.In our setting, training data is obtained by querying Google Images about the known identities of the participants in a TV show (we only know who participates but not when). As Google queries may return imprecise results, images retrieved for each query (or identity) are processed to distinguish true from false positives, keeping the former while filtering out the latter.Next, facial clustering is performed to drive a filtering process discarding noisy samples (false positives) from returned images (i.e. only images linked to the principal cluster are adopted as training data).For popularity recognition, Random Forest (RF) and support vector machine (SVM) classifiers have been tested. Three different types of features have been proposed to build the models upon: image related features, query related features and clustering related features.Feature ranking and feature selection techniques applied show that clustering related features are the most important for popularity recognition. In fact, the RF model based on the 3 top ranked features achieves an accuracy close to 100% on test set. Results also demonstrate that integrating the popularity solution into our visual diarization pipeline helps to reduce the Diarization Error Rate (DER) in a 2%, removing around a 15% of noisy identities, which confirms the quality of this procedure and its high performance in other scenarios.
机译:在本文中,我们提出了一种新的普及识别解决方案。这种方法包括在相关身份方面对人们进行分类和利用网络图像资源。为了展示其有用性,我们还研究将该程序纳入视觉深度缓解系统的效果。我们的环境中,通过查询电视节目中的参与者的已知身份(我们只知道谁参加)来获得培训数据(我们只知道谁参加不是什么时候)。由于Google查询可能会返回不精确的结果,因此对每个查询(或标识)检索的图像被处理以区分从晶阳性的真实验证,以在过滤后者时保持前者。对丢失的,以驱动丢失噪声样本的面部聚类(来自返回的图像(即仅采用训练数据仅采用仅采用链接到主群集群的图像)。对于受欢迎的识别,随机森林(RF)和支持向量机(SVM)分类器已经进行了测试。已经提出了三种不同类型的特征来构建模型:图像相关特征,查询相关的特征和聚类相关特征。应用排名和特征选择技术所应用的群集相关功能对于人气识别是最重要的。实际上,基于3个顶级排名特征的RF模型在测试集上实现了接近100%的精度。结果还证明将普及解决方案集成到我们的视觉日期管道中有助于减少2%的深度减速误差率(Der),从而达到15%的嘈杂身份,这证实了该程序的质量及其高性能场景。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号