Michalis Vrigkas, Vasileios Karavasilis, Christophoros Nikou, I. Kakadiaris
{"title":"Action Recognition by Matching Clustered Trajectories of Motion Vectors","authors":"Michalis Vrigkas, Vasileios Karavasilis, Christophoros Nikou, I. Kakadiaris","doi":"10.5220/0004277901120117","DOIUrl":null,"url":null,"abstract":"A framework for action representation and recognition base d on the description of an action by time series of optical flow motion features is presented. In the learning step, the motion curves representing each action are clustered using Gaussian mixture modeling (GMM). In the recognition step, the optical flow curves of a probe sequence are also clustered using a GMM and the probe c urves are matched to the learned curves using a non-metric similarity function based on the longest common subsequence which is robust to noise and provides an intuitive notion of similarity between traject ories. Finally, the probe sequence is categorized to the learned action with the maximum similarity using a neare st n ighbor classification scheme. Experimental results on common action databases demonstrate the effecti veness of the proposed method.","PeriodicalId":411140,"journal":{"name":"International Conference on Computer Vision Theory and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Vision Theory and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0004277901120117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
A framework for action representation and recognition base d on the description of an action by time series of optical flow motion features is presented. In the learning step, the motion curves representing each action are clustered using Gaussian mixture modeling (GMM). In the recognition step, the optical flow curves of a probe sequence are also clustered using a GMM and the probe c urves are matched to the learned curves using a non-metric similarity function based on the longest common subsequence which is robust to noise and provides an intuitive notion of similarity between traject ories. Finally, the probe sequence is categorized to the learned action with the maximum similarity using a neare st n ighbor classification scheme. Experimental results on common action databases demonstrate the effecti veness of the proposed method.