Coarse-to-Fine Loss Based On Viterbi Algorithm for Weakly Supervised Action Segmentation

Longshuai Sheng, Ce Li, Yihan Tian
{"title":"Coarse-to-Fine Loss Based On Viterbi Algorithm for Weakly Supervised Action Segmentation","authors":"Longshuai Sheng, Ce Li, Yihan Tian","doi":"10.1109/CONF-SPML54095.2021.00009","DOIUrl":null,"url":null,"abstract":"Weakly supervised action segmentation has been extensively studied to get the category and start time of actions that occur in videos, but it remains an unsolved issue because of lacking great annotation data in video analysis. To handle this issue, weakly supervised action segmentation only uses the action annotation on the whole sequence in a long video instead of specific labeling of each frame, which greatly reduces the difficulty of obtaining video datasets. However, the task remains challenging for the complex temporal length partition of actions in the videos. In this paper, we make use of the Viterbi algorithm to generate an initial action segmentation as the baseline and then design a new coarse-to-fine loss function to refine the length partition and learn the scores of valid and invalid segmentation routes respectively. The new coarse-to-fine loss is learned in the pipeline to reduce the weight of invalid segmentation routes and obtain the best video segmentation. Comparing with the state-of-the-art (SOTA) methods, the experiments on the breakfast and 50 salads datasets show that our fine partition model and coarse-to-fine loss function can be used to obtain higher frame accuracy and significantly reduce the time spent for action segmentation.","PeriodicalId":415094,"journal":{"name":"2021 International Conference on Signal Processing and Machine Learning (CONF-SPML)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Signal Processing and Machine Learning (CONF-SPML)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONF-SPML54095.2021.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Weakly supervised action segmentation has been extensively studied to get the category and start time of actions that occur in videos, but it remains an unsolved issue because of lacking great annotation data in video analysis. To handle this issue, weakly supervised action segmentation only uses the action annotation on the whole sequence in a long video instead of specific labeling of each frame, which greatly reduces the difficulty of obtaining video datasets. However, the task remains challenging for the complex temporal length partition of actions in the videos. In this paper, we make use of the Viterbi algorithm to generate an initial action segmentation as the baseline and then design a new coarse-to-fine loss function to refine the length partition and learn the scores of valid and invalid segmentation routes respectively. The new coarse-to-fine loss is learned in the pipeline to reduce the weight of invalid segmentation routes and obtain the best video segmentation. Comparing with the state-of-the-art (SOTA) methods, the experiments on the breakfast and 50 salads datasets show that our fine partition model and coarse-to-fine loss function can be used to obtain higher frame accuracy and significantly reduce the time spent for action segmentation.
弱监督动作分割中基于Viterbi算法的粗到细损失
为了得到视频中动作的类别和开始时间,人们对弱监督动作分割进行了广泛的研究,但由于缺乏大量的注释数据,在视频分析中一直是一个未解决的问题。为了解决这个问题,弱监督动作分割只对长视频中的整个序列进行动作标注,而不是对每一帧进行特定的标注,这大大降低了获取视频数据集的难度。然而,由于视频中动作的复杂时间长度划分,这项任务仍然具有挑战性。在本文中,我们利用Viterbi算法生成一个初始动作分割作为基线,然后设计一个新的粗精损失函数来细化长度分割,并分别学习有效和无效分割路由的分数。在流水线中学习新的粗到细损失,减少无效分割路由的权重,获得最佳的视频分割。与最先进的SOTA方法相比,早餐和50份沙拉数据集的实验表明,我们的精细分割模型和粗到细损失函数可以获得更高的帧精度,并显着减少动作分割所需的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信