首页> 外文OA文献 >Infinite Hidden Conditional Random Fields for the Recognition of Human Behaviour
【2h】

Infinite Hidden Conditional Random Fields for the Recognition of Human Behaviour

机译:用于人类行为识别的无限隐藏条件随机场

摘要

While detecting and interpreting temporal patterns of nonverbal behavioral cuesudin a given context is a natural and often unconscious process for humans, itudremains a rather difficult task for computer systems.udIn this thesis we are primarily motivated by the problem of recognizingudexpressions of high--level behavior, and specifically agreement anduddisagreement.udWe thoroughly dissect the problem by surveying the nonverbal behavioral cuesudthat could be present during displays of agreement and disagreement; we discussuda number of methods that could be used or adapted to detect these suggestedudcues; we list some publicly available databases these tools could be trained onudfor the analysis of spontaneous, audiovisual instances of agreement anduddisagreement, we examine the few existing attempts at agreement and disagreementudclassification, and we discuss the challenges in automatically detectingudagreement and disagreement.udWe presentud experiments that show that an existing discriminative graphical model, theud Hidden Conditional Random Field (HCRF) is the best performing on this task. Theud HCRF is a discriminative latent variable model which has been previously shownud to successfully learn the hidden structure of a given classification problemud (provided an appropriate validation of the number of hidden states).udWe show here that HCRFs are also able to capture what makes each of these socialudattitudes unique. We present an efficient technique to analyze the conceptsudlearned by the HCRF model and show that these coincide with the findings fromudsocial psychology regarding which cues are most prevalent in agreement anduddisagreement. Our experiments are performed on a spontaneous expressions datasetudcurated from real televised debates.udThe HCRF model outperforms conventional approaches such as Hidden Markov Modelsudand Support Vector Machines.udSubsequently, we examine existing graphical models that use Bayesianudnonparametrics to have a countably infinite number of hidden states and adaptudtheir complexity to the data at hand.udWe identify a gap in the literature that is the lack of a discriminative suchudgraphical model and we present our suggestion for the first such model: an HCRFudwith an infinite number of hidden states, the Infinite Hidden Conditional RandomudField (IHCRF).udIn summary, the IHCRF is an undirected discriminative graphical model forudsequence classification and uses a countably infinite number of hidden states.udWe present two variants of this model. The first is a fully nonparametric modeludthat relies on Hierarchical Dirichlet Processes and a Markov Chain Monte Carloudinference approach. The second is a semi--parametric model that uses DirichletudProcess Mixtures and relies on a mean--field variational inference approach. Weudshow that both models are able to converge to a correct number of representedudhidden states, and perform as well as the best finite HCRFs ---chosen viaudcross--validation--- for the difficult tasks of recognizing instances ofudagreement, disagreement, and pain in audiovisual sequences.
机译:虽然在给定的上下文中检测和解释非语言行为提示的时间模式 ud是人类的自然过程,并且通常是无意识的过程,但是对于计算机系统来说,这仍然是一个相当艰巨的任务。 ud本文中,我们的主要动机是认识到我们通过调查显示同意和不同意见时可能出现的非语言行为提示来彻底剖析问题。我们讨论了可用于或适用于检测这些建议的 udcues的方法数量。我们列出了一些公开的数据库,可以对这些工具进行培训,以便分析自发的,视听的达成和拒绝的实例,我们研究了达成共识和不同意见的几种尝试 udclassification,并讨论了自动检测达成共识的挑战 ud我们提出的 ud实验表明,现有的区分性图形模型, ud隐藏条件随机场(HCRF)在此任务上表现最佳。 ud HCRF是一个判别性潜在变量模型,先前已显示 ud成功地学习了给定分类问题的隐藏结构 ud(提供了对隐藏状态数的适当验证)。 ud我们在这里显示HCRF是还能够捕捉到使这些社交敢于与众不同的原因。我们提出了一种有效的技术来分析由HCRF模型学习的概念,并表明这些与来自 ududcial心理学的发现一致,即关于哪些线索在一致性和非一致性方面最普遍。我们的实验是在真实的电视辩论中自发表达的数据集上进行的。 udHCRF模型的性能优于传统方法,例如隐马尔可夫模型 udand支持向量机。 ud隐藏的状态数量无穷无尽,并且使它们的复杂性适应手头的数据。我们在文献中发现了缺乏区分性的此类 udmical模型的空白,并提出了对第一个此类模型的建议:HCRF ud具有无限数量的隐藏状态,即无限隐藏条件随机 udField(IHCRF)。 ud总而言之,IHCRF是用于 udsequence分类的无向判别式图形模型,并使用了无数个隐藏状态。 ud我们提供了两种变体。这个模型。第一个是完全非参数模型 ud,它依赖于层次Dirichlet过程和Markov Chain Monte Carlo udinference方法。第二个是使用Dirichlet udProcess混合物的半参数模型,并依赖于均值场变分推断方法。我们 udshow表明,这两种模型都能够收敛到正确数量的表示隐藏状态,并且表现出最佳的有限HCRF(通过 udcross-validation选择),以完成识别实例的艰巨任务视听序列中的分歧,分歧和痛苦。

著录项

  • 作者

    Bousmalis Konstantinos;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号