Xielian Hou, Caikou Chen, Shengwei Zhou, Jingshan Li
{"title":"基于非负稀疏判别低秩表示的鲁棒人脸识别","authors":"Xielian Hou, Caikou Chen, Shengwei Zhou, Jingshan Li","doi":"10.1109/CCDC.2018.8408104","DOIUrl":null,"url":null,"abstract":"Due to occlusion or camouflage existing in the current face images, previous face recognition algorithms such as sparse representation classification algorithm do not take face damage into consideration during the training period, and therefore their testing performance will be degraded. In this paper, we propose a novel non-negative sparse discriminative low-rank representation algorithm (NSDLRR). First, we seek a sparse, low-rank and non-negative matrix in training samples. Then, we add a structural inconsistency constraint on this basis, make different kinds of samples as independent as possible, thereby increasing the extra recognition ability. Finally, the test samples are classified by sparse linear representation. Experimental results on different face database show that the algorithm has better performance.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Robust face recognition based on non-negative sparse discriminative low-rank representation\",\"authors\":\"Xielian Hou, Caikou Chen, Shengwei Zhou, Jingshan Li\",\"doi\":\"10.1109/CCDC.2018.8408104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to occlusion or camouflage existing in the current face images, previous face recognition algorithms such as sparse representation classification algorithm do not take face damage into consideration during the training period, and therefore their testing performance will be degraded. In this paper, we propose a novel non-negative sparse discriminative low-rank representation algorithm (NSDLRR). First, we seek a sparse, low-rank and non-negative matrix in training samples. Then, we add a structural inconsistency constraint on this basis, make different kinds of samples as independent as possible, thereby increasing the extra recognition ability. Finally, the test samples are classified by sparse linear representation. Experimental results on different face database show that the algorithm has better performance.\",\"PeriodicalId\":409960,\"journal\":{\"name\":\"2018 Chinese Control And Decision Conference (CCDC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Chinese Control And Decision Conference (CCDC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2018.8408104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Chinese Control And Decision Conference (CCDC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2018.8408104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust face recognition based on non-negative sparse discriminative low-rank representation
Due to occlusion or camouflage existing in the current face images, previous face recognition algorithms such as sparse representation classification algorithm do not take face damage into consideration during the training period, and therefore their testing performance will be degraded. In this paper, we propose a novel non-negative sparse discriminative low-rank representation algorithm (NSDLRR). First, we seek a sparse, low-rank and non-negative matrix in training samples. Then, we add a structural inconsistency constraint on this basis, make different kinds of samples as independent as possible, thereby increasing the extra recognition ability. Finally, the test samples are classified by sparse linear representation. Experimental results on different face database show that the algorithm has better performance.