{"title":"一种基于最小二乘的两相人脸识别方法","authors":"Zhengmin Li, Binglei Xie","doi":"10.1109/IHMSC.2013.21","DOIUrl":null,"url":null,"abstract":"In this paper, an iterative method for solving linear systems and min is used to calculate the best representations of the test sample as a linear combination of all the training samples. Then a least-squares Based two-phase face recognition algorithm is proposed. This algorithm is as follows: its first phase uses a least-squares method to calculate the contribution between a test sample and each sample in the training sets, and then exploits the contribution of each training sample to determine K nearest neighbors for the test sample. Its second phase represents the test sample as a linear combination of the determined K nearest neighbors and uses the representation result to perform classification. The experimental results show that our method outperforms the two-phase test sample sparse representation methods for use with face recognition (TPTSR).","PeriodicalId":222375,"journal":{"name":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Least-Squares Based Two-Phase Face Recognition Method\",\"authors\":\"Zhengmin Li, Binglei Xie\",\"doi\":\"10.1109/IHMSC.2013.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an iterative method for solving linear systems and min is used to calculate the best representations of the test sample as a linear combination of all the training samples. Then a least-squares Based two-phase face recognition algorithm is proposed. This algorithm is as follows: its first phase uses a least-squares method to calculate the contribution between a test sample and each sample in the training sets, and then exploits the contribution of each training sample to determine K nearest neighbors for the test sample. Its second phase represents the test sample as a linear combination of the determined K nearest neighbors and uses the representation result to perform classification. The experimental results show that our method outperforms the two-phase test sample sparse representation methods for use with face recognition (TPTSR).\",\"PeriodicalId\":222375,\"journal\":{\"name\":\"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IHMSC.2013.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2013.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Least-Squares Based Two-Phase Face Recognition Method
In this paper, an iterative method for solving linear systems and min is used to calculate the best representations of the test sample as a linear combination of all the training samples. Then a least-squares Based two-phase face recognition algorithm is proposed. This algorithm is as follows: its first phase uses a least-squares method to calculate the contribution between a test sample and each sample in the training sets, and then exploits the contribution of each training sample to determine K nearest neighbors for the test sample. Its second phase represents the test sample as a linear combination of the determined K nearest neighbors and uses the representation result to perform classification. The experimental results show that our method outperforms the two-phase test sample sparse representation methods for use with face recognition (TPTSR).