基于鲁棒约束矩阵分解聚类框架的动作分割

Liqun Ren, Guopeng Li, Wenjing Yang, Feng Jing
{"title":"基于鲁棒约束矩阵分解聚类框架的动作分割","authors":"Liqun Ren, Guopeng Li, Wenjing Yang, Feng Jing","doi":"10.1109/ACIRS49895.2020.9162603","DOIUrl":null,"url":null,"abstract":"Action understanding, which has been applied in a wide range of intelligent systems, has gained much attention for its better performance. However, the existing literature mainly focuses on supervised or semi-supervised frameworks, and effectively designing an unsupervised clustering method for action segmentation is still a challenging problem. In this paper, we propose a novel unsupervised clustering method for action segmentation based on robust structure constraint matrix factorization and the Ncut method by utilizing the similarity information among neighboring frames. Considering that the true neighboring frames are likely to share more similarity in action sequences, a useful structure constraint was designed to guide the action representation learning process. With the semi-nonnegative matrix factorization, more comprehensive low-dimensional representation of actions can be learned. Then, the similarity graph can be obtained from this new representation, and the final action segmentation results can be obtained by graph cut methods. Experiments on several real action datasets demonstrate that the proposed method outperforms state-of-the-art methods.","PeriodicalId":293428,"journal":{"name":"2020 5th Asia-Pacific Conference on Intelligent Robot Systems (ACIRS)","volume":"168-169 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Action Segmentation via Robust Constraint Matrix Factorization Clustering Framework\",\"authors\":\"Liqun Ren, Guopeng Li, Wenjing Yang, Feng Jing\",\"doi\":\"10.1109/ACIRS49895.2020.9162603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Action understanding, which has been applied in a wide range of intelligent systems, has gained much attention for its better performance. However, the existing literature mainly focuses on supervised or semi-supervised frameworks, and effectively designing an unsupervised clustering method for action segmentation is still a challenging problem. In this paper, we propose a novel unsupervised clustering method for action segmentation based on robust structure constraint matrix factorization and the Ncut method by utilizing the similarity information among neighboring frames. Considering that the true neighboring frames are likely to share more similarity in action sequences, a useful structure constraint was designed to guide the action representation learning process. With the semi-nonnegative matrix factorization, more comprehensive low-dimensional representation of actions can be learned. Then, the similarity graph can be obtained from this new representation, and the final action segmentation results can be obtained by graph cut methods. Experiments on several real action datasets demonstrate that the proposed method outperforms state-of-the-art methods.\",\"PeriodicalId\":293428,\"journal\":{\"name\":\"2020 5th Asia-Pacific Conference on Intelligent Robot Systems (ACIRS)\",\"volume\":\"168-169 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 5th Asia-Pacific Conference on Intelligent Robot Systems (ACIRS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACIRS49895.2020.9162603\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 5th Asia-Pacific Conference on Intelligent Robot Systems (ACIRS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACIRS49895.2020.9162603","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

动作理解以其优异的性能在智能系统中得到了广泛的应用。然而,现有文献主要集中在监督或半监督框架上,有效地设计一种无监督聚类方法用于动作分割仍然是一个具有挑战性的问题。本文提出了一种基于鲁棒结构约束矩阵分解和基于相邻帧间相似性信息的Ncut方法的动作分割无监督聚类方法。考虑到真实相邻帧在动作序列中可能具有更多的相似性,设计了一个有用的结构约束来指导动作表示学习过程。利用半非负矩阵分解,可以学习更全面的动作低维表示。然后,利用这种新的表示得到相似图,并通过图割方法得到最终的动作分割结果。在几个真实动作数据集上的实验表明,该方法优于目前最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Action Segmentation via Robust Constraint Matrix Factorization Clustering Framework
Action understanding, which has been applied in a wide range of intelligent systems, has gained much attention for its better performance. However, the existing literature mainly focuses on supervised or semi-supervised frameworks, and effectively designing an unsupervised clustering method for action segmentation is still a challenging problem. In this paper, we propose a novel unsupervised clustering method for action segmentation based on robust structure constraint matrix factorization and the Ncut method by utilizing the similarity information among neighboring frames. Considering that the true neighboring frames are likely to share more similarity in action sequences, a useful structure constraint was designed to guide the action representation learning process. With the semi-nonnegative matrix factorization, more comprehensive low-dimensional representation of actions can be learned. Then, the similarity graph can be obtained from this new representation, and the final action segmentation results can be obtained by graph cut methods. Experiments on several real action datasets demonstrate that the proposed method outperforms state-of-the-art methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信