Face Recognition with Local Binary Patterns, Spatial Pyramid Histograms and Naive Bayes Nearest Neighbor Classification

Daniel Maturana, D. Mery, Á. Soto
{"title":"Face Recognition with Local Binary Patterns, Spatial Pyramid Histograms and Naive Bayes Nearest Neighbor Classification","authors":"Daniel Maturana, D. Mery, Á. Soto","doi":"10.1109/SCCC.2009.21","DOIUrl":null,"url":null,"abstract":"Face recognition algorithms commonly assume that face images are well aligned and have a similar pose -- yet in many practical applications it is impossible to meet these conditions. Therefore extending face recognition to unconstrained face images has become an active area of research. To this end, histograms of Local Binary Patterns (LBP) have proven to be highly discriminative descriptors for face recognition. Nonetheless, most LBP-based algorithms use a rigid descriptor matching strategy that is not robust against pose variation and misalignment. We propose two algorithms for face recognition that are designed to deal with pose variations and misalignment. We also incorporate an illumination normalization step that increases robustness against lighting variations. The proposed algorithms use descriptors based on histograms of LBP and perform descriptor matching with spatial pyramid matching (SPM) and Naive Bayes Nearest Neighbor (NBNN), respectively. Our contribution is the inclusion of flexible spatial matching schemes that use an image-to-class relation to provide an improved robustness with respect to intra-class variations. We compare the accuracy of the proposed algorithms against Ahonen's original LBP-based face recognition system and two baseline holistic classifiers on four standard datasets. Our results indicate that the algorithm based on NBNN outperforms the other solutions, and does so more markedly in presence of pose variations.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"77","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of the Chilean Computer Science Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2009.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 77

Abstract

Face recognition algorithms commonly assume that face images are well aligned and have a similar pose -- yet in many practical applications it is impossible to meet these conditions. Therefore extending face recognition to unconstrained face images has become an active area of research. To this end, histograms of Local Binary Patterns (LBP) have proven to be highly discriminative descriptors for face recognition. Nonetheless, most LBP-based algorithms use a rigid descriptor matching strategy that is not robust against pose variation and misalignment. We propose two algorithms for face recognition that are designed to deal with pose variations and misalignment. We also incorporate an illumination normalization step that increases robustness against lighting variations. The proposed algorithms use descriptors based on histograms of LBP and perform descriptor matching with spatial pyramid matching (SPM) and Naive Bayes Nearest Neighbor (NBNN), respectively. Our contribution is the inclusion of flexible spatial matching schemes that use an image-to-class relation to provide an improved robustness with respect to intra-class variations. We compare the accuracy of the proposed algorithms against Ahonen's original LBP-based face recognition system and two baseline holistic classifiers on four standard datasets. Our results indicate that the algorithm based on NBNN outperforms the other solutions, and does so more markedly in presence of pose variations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于局部二值模式、空间金字塔直方图和朴素贝叶斯最近邻分类的人脸识别
人脸识别算法通常假设人脸图像对齐良好并具有相似的姿势,但在许多实际应用中,不可能满足这些条件。因此,将人脸识别扩展到无约束的人脸图像已成为一个活跃的研究领域。为此,直方图局部二值模式(LBP)已被证明是人脸识别的高度判别描述符。尽管如此,大多数基于lbp的算法使用严格的描述符匹配策略,对姿态变化和不对齐没有鲁棒性。我们提出了两种人脸识别算法,旨在处理姿态变化和不对齐。我们还纳入了一个照明规范化步骤,增加了对照明变化的鲁棒性。该算法使用基于LBP直方图的描述符,并分别与空间金字塔匹配(SPM)和朴素贝叶斯最近邻(NBNN)进行描述符匹配。我们的贡献是包含灵活的空间匹配方案,该方案使用图像到类的关系来提供关于类内变化的改进的鲁棒性。我们将提出的算法与Ahonen原始的基于lbp的人脸识别系统和两个基线整体分类器在四个标准数据集上的准确性进行了比较。我们的结果表明,基于NBNN的算法优于其他解决方案,并且在存在姿势变化的情况下表现得更加明显。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Combining a Probabilistic Sampling Technique and Simple Heuristics to Solve the Dynamic Path Planning Problem Delayed Insertion Strategies in Dynamic Metric Indexes A Two-Level Calculus for Composing Hybrid QVT Transformations A Certified Access Controller for JME-MIDP 2.0 Enabled Mobile Devices Implementation of an Improvement Cycle Using the Competisoft Methodological Framework and the Tutelkan Platform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1