{"title":"彩色高斯噪声假设下基于最优线性变换的人脸图像哈希方法","authors":"Ç. Karabat, Hakan Erdogan, M. K. Mihçak","doi":"10.1109/ICDSP.2011.6004932","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel face image hashing method based on an optimal linear transformation. In the proposed method, first, we apply a feature extraction method. Then, we define an optimal linear transformation matrix based on within-class covariance matrix which is the maximum likelihood estimate of the variations of the biometric data belonging to the same user. Next, we reduce the dimension of the feature vector by using this transform. Finally, we apply quantization and obtain a face image hash vector. We test the performance of the proposed method with AT&T and M2VTS face databases and compare the results with the random projection based biometric hashing methods. We perform the simulations by taking into account two scenarios: 1) Secret key is not known by attacker, 2) Attacker illegally acquires the secret key. The simulation results show the proposed method has better performance especially when the secret key has been compromised.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"1999 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A face image hashing method based on optimal linear transform under colored Gaussian noise assumption\",\"authors\":\"Ç. Karabat, Hakan Erdogan, M. K. Mihçak\",\"doi\":\"10.1109/ICDSP.2011.6004932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel face image hashing method based on an optimal linear transformation. In the proposed method, first, we apply a feature extraction method. Then, we define an optimal linear transformation matrix based on within-class covariance matrix which is the maximum likelihood estimate of the variations of the biometric data belonging to the same user. Next, we reduce the dimension of the feature vector by using this transform. Finally, we apply quantization and obtain a face image hash vector. We test the performance of the proposed method with AT&T and M2VTS face databases and compare the results with the random projection based biometric hashing methods. We perform the simulations by taking into account two scenarios: 1) Secret key is not known by attacker, 2) Attacker illegally acquires the secret key. The simulation results show the proposed method has better performance especially when the secret key has been compromised.\",\"PeriodicalId\":360702,\"journal\":{\"name\":\"2011 17th International Conference on Digital Signal Processing (DSP)\",\"volume\":\"1999 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 17th International Conference on Digital Signal Processing (DSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDSP.2011.6004932\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 17th International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2011.6004932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A face image hashing method based on optimal linear transform under colored Gaussian noise assumption
In this paper, we propose a novel face image hashing method based on an optimal linear transformation. In the proposed method, first, we apply a feature extraction method. Then, we define an optimal linear transformation matrix based on within-class covariance matrix which is the maximum likelihood estimate of the variations of the biometric data belonging to the same user. Next, we reduce the dimension of the feature vector by using this transform. Finally, we apply quantization and obtain a face image hash vector. We test the performance of the proposed method with AT&T and M2VTS face databases and compare the results with the random projection based biometric hashing methods. We perform the simulations by taking into account two scenarios: 1) Secret key is not known by attacker, 2) Attacker illegally acquires the secret key. The simulation results show the proposed method has better performance especially when the secret key has been compromised.