基于概率超图的视频事件语义检测

视频事件类别的归属具有模糊性和不确定性,将超图的点边射入矩阵拓展成概率形式的软超图进行关联关系分析和语义分析,将会更有利于提高多事件检索检测的精准率和召回率。提出基于概率超图模型的视频事件语义检测算法（PHVESD）。 该方法首先将颜色、灰度共生矩阵、Tchebichef矩、局部二值模式（LBP）等四种底层视觉特征进行融合; 然后定义视频段的亲密度函数并利用亲密度的信息构建概率超图模型,其中每条超边对应一种事件语义;采用随机游走过程来预测视频段属于每条超边的概率;最后结合阈值采用条件概率模型对视频段进行事件语义分类。将该方法用于交通突发事件多语义检测中并与其他的识别算法相比较,实验结果表明,与基于超图模型的多标签随机游走算法（MLRW）相比,PHVESD的算法使多语义事件检测的准确率提高了10%,召回率提高了8%。     

利用本体的视频语义概念检测

视频数据的不断丰富以及人们对视频检索的要求越来越复杂,使得视频语义信息建模和高层语义概念提取逐渐成为视频检索中的重要组成部分.本文提出一种基于本体的视频语义概念检测方法,利用贝叶斯网络构造视频中概念语义关系的检测本体,构建了视频中概念之间的层次关系,并能够通过推理完成复合语义概念的检测.该方法从语义信息学的角度对视频内容进行分析,在一定程度上削弱了语义鸿沟的影响,并且取得了较好的查询结果.     

基于时序概率超图模型的视频多语义标注

在基于语义的视频检索系统中,为了弥补视频底层特征与高层用户需求之间的差异,提出了时序概率超图模型。它将时间序列因素融入到模型的构建中,在此基础上提出了一种基于时序概率超图模型的视频多语义标注框架（TPH-VMLAF）。该框架结合视频时间相关性,通过使用基于时序概率超图的镜头多标签半监督分类学习算法对视频镜头进行多语义标注。标注过程中同时解决了已标注视频数据不足和多语义标注的问题。实验结果表明,该框架提高了标注的精确度,表现出了良好的性能。     

基于超图模型的复杂视频事件检测

近年来,语义事件分析越来越受到重视,典型语义事件的检测与识别是一个具有挑战性的研究领域。提出了基于超图模型的复杂视频事件检测方法,通过分析对象的运动轨迹,检测出视频中的所有子事件并构建时序关系图及依赖关系图,从而生成子事件超图,并通过谱超图聚类分析来检测相应的复杂事件。采用图变换工具AGG进行模拟实验,其实验结果表明,该方法具有较高的准确率与召回率。     

一种多模态信息融合的视频检索模型

针对包含复杂语义信息的视频检索的需要,提出了一种基于关系代数的多模态信息融合视频检索模型,该模型充分利用视频包含的文本、图像、高层语义概念等多模态特征,构造了对应于多个视频特征的查询模块,并创新地使用关系代数表达式对查询得到的多模态信息进行融合。实验表明,该模型能够充分发挥多模型视频检索及基于关系代数表达式的融合策略在复杂语义视频检索中的优势,得到较好的查询结果。     

基于Petri网推理的监控视频事件识别

Petri网模型对复合时序事件具有较好的描述和检测能力,提出基于Petri网描述和推理的监控视频事件信息的自动识别方法。将运动目标及其特征间的空间关系用Petri网的库表示,时间关系及其他推理规则用变迁表示,结合低级计算机视觉算法获得的运动目标特征以及基本事件信息,通过对Petri网推理执行,实现监控视频复杂语义事件的交互式查询,通过实验验证了该方法的有效性。     

基于负样本精简概念格规则的语义概念检测

为挖掘视频中丰富的语义信息,提出基于负样本精简概念格规则的语义概念检测方法.分析基于概念格的语义分析系统,考虑训练数据中负样本的信息,提出利用负样本精简的语义规则提取算法,将其应用于视频语义检测.先将视频镜头的低层特征映射到低层语义特征,再利用该算法生成语义分类规则,进行视频语义概念检测.实验结果表明,该方法是有效可行...     

视频语义分析两级多模式融合算法

为了全面准确地获取视频高层语义信息,提出了一种基于仿生的视频语义分析两级多模式融合算法。该算法仿照人脑多感觉融合机理,先将视频中多模式特征按不同类别划分为组,然后对每一组中的多模低层特征用层次隐马尔可夫模型(HHMM)进行数据融合;同时将以似然率表示的多个低层融合结果作为高层融合的输入,再通过基于核的非线性算法把输入空间变换到高维特征空间;最后在特征空间中求取最优线性分类面,即可得到最终的多模式两级融合结果。实验表明,该方法不仅能有效融合视频中的多模式特征,而且能获取全面、准确的高层语义信息。     

基于本体的多模式融合语义提取模型

基于语义的视频检索要处理的两项关键技术就是解决视频低层特征和高层语义概念间的语义鸿沟以及有效的语义提取模型。文中通过对视频进行多层次语义分析,采用有效的语义对象分割方法提取视频中的语义对象,以语义对象为中间层,并融合图像、声音、文本的多模式视频特征,从而缩小语义鸿沟。其次,视频语义概念具有多粒度性,由于本体在表示概念及概念间联系时的优越性,文中提出基于本体的语义提取模型,在从图像、声音、文本中提取出的原子概念中,推理出更高层次的复合概念。最终运用该模型提取的视频语义就具有更丰富的语义层次和语义粒度,从而更接近人类思维中的高层语义概念。     

超图学习综述:算法分类与应用分析

随着图结构化数据挖掘的兴起,超图作为一种特殊的图结构化数据,在社交网络分析、图像处理、生物反应解析等领域受到广泛关注.研究者通过解析超图中的拓扑结构与节点属性等信息,能够有效解决实际应用场景中所遇到的如兴趣推荐、社群划分等问题.根据超图学习算法的设计特点,将其划分为谱分析方法和神经网络方法,根据方法对超图处理的不同手段...     

基于多粒度注意力网络的知识超图链接预测

在知识图谱中进行链接预测是图谱补全的有效方法,可以有效地改善知识图谱的数据质量.然而,现实生活中的关系往往是多元的,这些包含多元关系的知识图谱可称为知识超图(knowledgehypergraph,KHG).然而,现有的知识超图链接预测模型忽略了多元关系的平等性(多元关系中实体不存在先后关系)与整体性(多元关系缺少一个实体则不成立).针对以上问题,首先提出了一种知识超图多元关系表示模型,可以直接建模知识超图中的多元关系;然后研究了一种基于多粒度神经网络的链接预测方法(hyperedgepredictionbasedonmulti-granular attentionnetwork,HPMG).该模型将关系划分为多重粒度进行学习,从不同粒度联合完成知识超图的学习和预测,充分考虑了知识超图中不同维度多元关系的整体性.接下来,针对HPMG特征融合不充分的问题,提出了基于多粒度注意力网络的知识超图链接预测方法 HPMG+,结合全局和局部注意力,实现了不同特征的有区分融合,进一步提高了模型的性能.最后,真实数据集上的大量实验结果验证了所提方法的效果显著地优于所有基线方法.     

自注意力超图池化网络

近年来,将卷积神经网络推广到图数据上的图卷积神经网络引起了广泛关注,主要包括重新定义图的卷积和池化操作.由于图数据只能表达二元关系的局限性,使其在实际应用中表现欠佳.相比之下,超图能够捕获数据的高阶相关性,利用其灵活的超边易于处理复杂的数据表示.然而,现有的超图卷积神经网络还不够成熟,目前尚无有效的超图池化操作.因此,提出了带有自注意机制的超图池化网络,使用超图结构建模,通过引入自注意力的超图卷积操作学习带有高阶数据信息的节点隐藏层特征,再经过超图池化操作选择并保留在结构和内容上的重要节点,进而得到更准确的超图表示.在文本分类、菜肴分类和蛋白质分类任务上的实验结果表明:与目前多种主流方法相比,该方法均取得了更好的效果.     

Self-attention Hypergraph Pooling Network

Recently, Graph Convolutional neural Networks (GCNs) have attracted much attention by generalizing convolutional neural networks to graph data, which includes redefining convolution and pooling operations on graphs. Due to the limitation that graph data can only focus on dyadic relations, it cannot perform well in real practice. In contrast, a hypergraph can capture high-order data interaction and is easy to deal with complex data representation using its flexible hyperedges. However, the existing methods for hypergraph convolutional networks are still not mature, and there is no effective operation for hypergraph pooling currently. Therefore, a hypergraph pooling network with a self-attention mechanism is proposed. Using a hypergraph structure for data modeling, this model can learn node hidden features with high-order data information through hypergraph convolution operation which introduces a self-attention mechanism, select important nodes both on structure and content through hypergraph pooling operation, and then obtain more accurate hypergraph representation. Experiments on text classification, dish classification, and protein classification tasks show that the proposed method outperforms recent state-of-the-art methods.     

Time-aware Knowledge Hypergraph Link Prediction

A knowledge hypergraph is a form of heterogeneous graph representing the real world through $n$-ary relations, but existing knowledge hypergraphs are usually incomplete in both general and vertical domains. Therefore, it is challenging to infer the missing links from the existing links in knowledge hypergraphs. Most of the current studies employ knowledge representation learning methods based on $n$-ary relations to accomplish link prediction in knowledge hypergraphs, but they only learn the embedding vectors of entities and relations from time-unknown hyperedges without considering the influence of temporal factors on the dynamic evolution of facts, which results in poor prediction performance in dynamic environments. Firstly, based on the definition of temporal knowledge hypergraphs proposed by this paper for the first time, this paper puts forward a link prediction model for temporal knowledge hypergraphs and learns static and dynamic representations of entities from their roles, positions, and timestamps of temporal hyperedges. Then these representations are merged in a certain proportion and utilized as final entity embedding vectors for link prediction tasks to realize the full exploitation of hyperedge temporal information. Meanwhile, it is theoretically proven that the proposed model is fully expressive with linear space complexity. Additionally, a temporal knowledge hypergraph dataset CB67 is constructed from the public business data of listed companies, and a large number of experimental evaluations are conducted on this dataset. The experimental results show that the proposed model can effectively perform link prediction tasks on the temporal knowledge hypergraph dataset.     

Event Tactic Analysis Based on Broadcast Sports Video

Most existing approaches on sports video analysis have concentrated on semantic event detection. Sports professionals, however, are more interested in tactic analysis to help improve their performance. In this paper, we propose a novel approach to extract tactic information from the attack events in broadcast soccer video and present the events in a tactic mode to the coaches and sports professionals. We extract the attack events with far-view shots using the analysis and alignment of web-casting text and broadcast video. For a detected event, two tactic representations, aggregate trajectory and play region sequence, are constructed based on multi-object trajectories and field locations in the event shots. Based on the multi-object trajectories tracked in the shot, a weighted graph is constructed via the analysis of temporal-spatial interaction among the players and the ball. Using the Viterbi algorithm, the aggregate trajectory is computed based on the weighted graph. The play region sequence is obtained using the identification of the active field locations in the event based on line detection and competition network. The interactive relationship of aggregate trajectory with the information of play region and the hypothesis testing for trajectory temporal-spatial distribution are employed to discover the tactic patterns in a hierarchical coarse-to-fine framework. Extensive experiments on FIFA World Cup 2006 show that the proposed approach is highly effective.