4.7 Article

Unsupervised Video Summarization via Relation-Aware Assignment Learning

期刊

IEEE TRANSACTIONS ON MULTIMEDIA
卷 23, 期 -, 页码 3203-3214

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMM.2020.3021980

关键词

Feature extraction; Training; Optimization; Semantics; Recurrent neural networks; Task analysis; Graph neural network; unsupervised learning; video summarization

资金

  1. National Key Research and Development Program of China [2018AAA0102200]
  2. National Natural Science Foundation of China [61720106006, 61721004, 61832002, 61702511, 61751211, 61532009, U1836220, U1705262, 61872424, 61936005]
  3. Key Research Program of Frontier Sciences of CAS [QYZDJSSWJSC039]
  4. Research Program of National Laboratory of Pattern Recognition [Z-2018007]

向作者/读者索取更多资源

This research proposes to learn relation-aware hard assignments for selecting key video clips in an unsupervised manner by utilizing clip-clip relations. By constructing an assignment-learning graph and optimizing the whole framework, the approach achieves favorable performance on popular benchmarks.
We address the problem of unsupervised video summarization that automatically selects key video clips. Most state-of-the-art approaches suffer from two issues: (1) they model video clips without explicitly exploiting their relations, and (2) they learn soft importance scores over all the video clips to generate the summary representation. However, a meaningful video summary should be inferred by taking the relation-aware context of the original video into consideration, and directly selecting a subset of clips with a hard assignment. In this paper, we propose to exploit clip-clip relations to learn relation-aware hard assignments for selecting key clips in an unsupervised manner. First, we consider the clips as graph nodes to construct an assignment-learning graph. Then, we utilize the magnitude of the node features to generate hard assignments as the summary selection. Finally, we optimize the whole framework via a proposed multi-task loss including a reconstruction constraint, and a contrastive constraint. Extensive experimental results on three popular benchmarks demonstrate the favourable performance of our approach.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据