{"title":"Improving single view gait recognition using sparse representation based classification","authors":"Sonia Das, Upanedra Kumar Sahoo, S. Meher","doi":"10.1109/TECHSYM.2016.7872703","DOIUrl":null,"url":null,"abstract":"This paper explores a better way of recognition using sparse based representation, by taking into account a number of covariates that affect single view based gait. Nevertheless, the conventional methods couldn't handle covariates effectively. Our propose framework comprises a dictionary, which describes five segments of a subject over a gait period. The feature vectors are educed from ellipse based parameters from each segments and fused to form a covariance matrix. Each matrix is used as dictionary atom and solved using — l1 — minimization. The linear representations of sparse codes of different atoms are used for recognition. The proposed method is compared with that of state-of-the-art methods","PeriodicalId":403350,"journal":{"name":"2016 IEEE Students’ Technology Symposium (TechSym)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Students’ Technology Symposium (TechSym)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TECHSYM.2016.7872703","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper explores a better way of recognition using sparse based representation, by taking into account a number of covariates that affect single view based gait. Nevertheless, the conventional methods couldn't handle covariates effectively. Our propose framework comprises a dictionary, which describes five segments of a subject over a gait period. The feature vectors are educed from ellipse based parameters from each segments and fused to form a covariance matrix. Each matrix is used as dictionary atom and solved using — l1 — minimization. The linear representations of sparse codes of different atoms are used for recognition. The proposed method is compared with that of state-of-the-art methods