首页> 外文期刊>Neurocomputing >Summarizing egocentric videos using deep features and optimal clustering
【24h】

Summarizing egocentric videos using deep features and optimal clustering

机译:使用深度特征和最佳聚类来概述自我中心视频

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, we address the problem of summarizing egocentric videos using deep features and an optimal clustering approach. Based on an augmented pre-trained convolutional neural network (CNN), each frame in an egocentric video is represented by deep features. An optimal clustering algorithm, based on a center-surround model (CSM) and an Integer Knapsack type formulation (IK) for K-means, termed as CSMIK K-means, is applied next to obtain the summary. In the center surround model, we compute difference in entropy and the optical flow values between the central region and that of the surrounding region of each frame. In the integer knapsack formulation, each cluster is treated as an item whose cost is assigned from the center surround model. A potential set of clusters in CSMIK K-means is obtained from the chi-square distance between color histograms of successive frames. CSMIK K-Means evaluates different cluster formations and simultaneously determines the optimal number of clusters and the corresponding summary. Experimental evaluation on four well-known benchmark datasets clearly indicate the superiority of the proposed method over several state-of-the-art approaches. (C) 2020 Elsevier B.V. All rights reserved.
机译:在本文中,我们解决了使用深度特征和最佳聚类方法概述了精神中心视频的问题。基于增强的预训练卷积神经网络(CNN),在EGoCentric视频中的每个帧由深度特征表示。旁边以获得摘要,基于中心环绕模型(CSM)和k-means的k-means的整数背包类型配方(Ik)的最佳聚类算法被称为csmik k-means。在中心环绕模型中,我们计算中心区域和每个帧的周围区域之间的熵和光学流量值的差异。在整数背包制定中,每个群集被视为其成本从中心环绕模型分配的项目。 CSMIK K型潜在的一组CSSMIK K-ins的簇是从连续帧的颜色直方图之间的Chi-Square距离获得的。 CSMIK K-Means评估不同的群集形成,并同时确定最佳群集数和相应的摘要。在四个众所周知的基准数据集上的实验评估清楚地表明了在几种最先进的方法中提出的方法的优越性。 (c)2020 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号