Robust biometrics recognition using joint weighted dictionary learning and smoothed L0 norm

R. Khorsandi, A. Taalimi, M. Abdel-Mottaleb
{"title":"Robust biometrics recognition using joint weighted dictionary learning and smoothed L0 norm","authors":"R. Khorsandi, A. Taalimi, M. Abdel-Mottaleb","doi":"10.1109/BTAS.2015.7358792","DOIUrl":null,"url":null,"abstract":"In this paper, we present an automated system for robust biometric recognition based upon sparse representation and dictionary learning. In sparse representation, extracted features from the training data are used to develop a dictionary. Classification is achieved by representing the extracted features of the test data as a linear combination of entries in the dictionary. Dictionary learning for sparse representation has shown to improve the results in classification and recognition tasks since class labels can be used in obtaining the atoms of learnt dictionary. We propose a joint weighted dictionary learning which simultaneously learns from a set of training samples an over complete dictionary along with weight vectors that correspond to the atoms in the learnt dictionary. The components of the weight vector associated with an atom represent the relationship between the atom and each of the classes. The weight vectors and atoms are jointly obtained during the dictionary learning. In the proposed method, a constraint is imposed on the correlation between the obtained atoms that represent different classes to decrease the similarity between these atoms. In addition, we use smoothed L0 norm which is a fast algorithm to find the sparsest solution. Experiments conducted on the West Virginia University (WVU) and the University of Notre Dame (UND) datasets for ear recognition show that the proposed method outperforms other state-of-the-art classifiers.","PeriodicalId":404972,"journal":{"name":"2015 IEEE 7th International Conference on Biometrics Theory, Applications and Systems (BTAS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 7th International Conference on Biometrics Theory, Applications and Systems (BTAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BTAS.2015.7358792","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we present an automated system for robust biometric recognition based upon sparse representation and dictionary learning. In sparse representation, extracted features from the training data are used to develop a dictionary. Classification is achieved by representing the extracted features of the test data as a linear combination of entries in the dictionary. Dictionary learning for sparse representation has shown to improve the results in classification and recognition tasks since class labels can be used in obtaining the atoms of learnt dictionary. We propose a joint weighted dictionary learning which simultaneously learns from a set of training samples an over complete dictionary along with weight vectors that correspond to the atoms in the learnt dictionary. The components of the weight vector associated with an atom represent the relationship between the atom and each of the classes. The weight vectors and atoms are jointly obtained during the dictionary learning. In the proposed method, a constraint is imposed on the correlation between the obtained atoms that represent different classes to decrease the similarity between these atoms. In addition, we use smoothed L0 norm which is a fast algorithm to find the sparsest solution. Experiments conducted on the West Virginia University (WVU) and the University of Notre Dame (UND) datasets for ear recognition show that the proposed method outperforms other state-of-the-art classifiers.
在本文中,我们提出了一个基于稀疏表示和字典学习的鲁棒生物特征自动识别系统。在稀疏表示中,从训练数据中提取的特征用于开发字典。分类是通过将测试数据的提取特征表示为字典中条目的线性组合来实现的。基于稀疏表示的字典学习可以改善分类和识别任务的结果,因为类标签可以用来获得学习字典的原子。我们提出了一种联合加权字典学习方法,它同时从一组训练样本中学习一个过完整字典以及与学习字典中原子对应的权向量。与原子相关联的权重向量的分量表示原子与每个类之间的关系。在字典学习过程中,权重向量和原子是联合获得的。在该方法中,对获得的代表不同类别的原子之间的相关性施加约束,以降低这些原子之间的相似性。此外,我们使用平滑L0范数,这是一种快速找到最稀疏解的算法。在西弗吉尼亚大学(WVU)和圣母大学(UND)的耳朵识别数据集上进行的实验表明,所提出的方法优于其他最先进的分类器。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信