{"title":"基于运动轨迹的运动分割光谱聚类方法","authors":"Hongbin Wang, Hua Lin","doi":"10.1109/ICME.2003.1221736","DOIUrl":null,"url":null,"abstract":"Multibody motion segmentation is important in many computer vision tasks. This paper presents a novel spectral clustering approach to motion segmentation based on motion trajectory. We introduce a new affinity matrix based on the motion trajectory and map the feature points into a low dimensional subspace. The feature points are clustered in this subspace using a graph spectral approach. By computing the sensitivities of the larger eigenvalues of a related Markov transition matrix with respect to perturbations in affinity matrix, we improve the piecewise constant eigenvectors condition [M. Meila et al., 2001] dramatically. This makes clustering much reliable and robust. We confirm it by experiments.","PeriodicalId":118560,"journal":{"name":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A spectral clustering approach to motion segmentation based on motion trajectory\",\"authors\":\"Hongbin Wang, Hua Lin\",\"doi\":\"10.1109/ICME.2003.1221736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multibody motion segmentation is important in many computer vision tasks. This paper presents a novel spectral clustering approach to motion segmentation based on motion trajectory. We introduce a new affinity matrix based on the motion trajectory and map the feature points into a low dimensional subspace. The feature points are clustered in this subspace using a graph spectral approach. By computing the sensitivities of the larger eigenvalues of a related Markov transition matrix with respect to perturbations in affinity matrix, we improve the piecewise constant eigenvectors condition [M. Meila et al., 2001] dramatically. This makes clustering much reliable and robust. We confirm it by experiments.\",\"PeriodicalId\":118560,\"journal\":{\"name\":\"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICME.2003.1221736\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 International Conference on Multimedia and Expo. ICME '03. Proceedings (Cat. No.03TH8698)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICME.2003.1221736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
摘要
多体运动分割是许多计算机视觉任务的重要组成部分。提出了一种基于运动轨迹的光谱聚类分割方法。我们引入了一个新的基于运动轨迹的关联矩阵,并将特征点映射到一个低维子空间中。使用图谱方法在该子空间中聚类特征点。通过计算相关马尔可夫转移矩阵的大特征值相对于亲和矩阵中扰动的灵敏度,改进了分段常特征向量条件[M]。Meila et al., 2001]。这使得集群更加可靠和健壮。我们通过实验证实了这一点。
A spectral clustering approach to motion segmentation based on motion trajectory
Multibody motion segmentation is important in many computer vision tasks. This paper presents a novel spectral clustering approach to motion segmentation based on motion trajectory. We introduce a new affinity matrix based on the motion trajectory and map the feature points into a low dimensional subspace. The feature points are clustered in this subspace using a graph spectral approach. By computing the sensitivities of the larger eigenvalues of a related Markov transition matrix with respect to perturbations in affinity matrix, we improve the piecewise constant eigenvectors condition [M. Meila et al., 2001] dramatically. This makes clustering much reliable and robust. We confirm it by experiments.