{"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}
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.