{"title":"Improved LBP and Discriminative LBP: Two novel local descriptors for Face Recognition","authors":"Shekhar Karanwal","doi":"10.1109/ICDSIS55133.2022.9915933","DOIUrl":null,"url":null,"abstract":"Most of LBP based descriptors develop their feature size by considering the uniform coordination among neighbors and center pixel. Additionally, most of them possesses noisy thresholding function. This limits the discriminativity of these descriptors to large extent. To eliminate all above defined conditions two novel descriptors are introduced called as Improved LBP (ILBP) and Discriminative LBP (DLBP). In ILBP, initially maximum value is attained from the 3x3 patch. Then product is taken between the maximum value and one of best possible values within range (.1-.9) to develop the threshold value. For this work it has been observed that.9 gives the best accuracy therefore.9 is used for obtaining the threshold value. The best range value will be chosen for obtaining the threshold value. Then all neighbors are compared against threshold for forming ILBP code. The ILBP histogram is achieved by computing the ILBP code for each pixel position. In DLBP, the histograms of ILBP and LBP are merged to form the more robust descriptor. For feature compression PCA is used and then classification was done by RBF technique, the SVMs method. Experiments conducted on 2 benchmark datasets i.e. ORL and GT confirms ability of both the descriptors against various methods. Among all it is DLBP which achieves best accuracy.","PeriodicalId":178360,"journal":{"name":"2022 IEEE International Conference on Data Science and Information System (ICDSIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Data Science and Information System (ICDSIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSIS55133.2022.9915933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Most of LBP based descriptors develop their feature size by considering the uniform coordination among neighbors and center pixel. Additionally, most of them possesses noisy thresholding function. This limits the discriminativity of these descriptors to large extent. To eliminate all above defined conditions two novel descriptors are introduced called as Improved LBP (ILBP) and Discriminative LBP (DLBP). In ILBP, initially maximum value is attained from the 3x3 patch. Then product is taken between the maximum value and one of best possible values within range (.1-.9) to develop the threshold value. For this work it has been observed that.9 gives the best accuracy therefore.9 is used for obtaining the threshold value. The best range value will be chosen for obtaining the threshold value. Then all neighbors are compared against threshold for forming ILBP code. The ILBP histogram is achieved by computing the ILBP code for each pixel position. In DLBP, the histograms of ILBP and LBP are merged to form the more robust descriptor. For feature compression PCA is used and then classification was done by RBF technique, the SVMs method. Experiments conducted on 2 benchmark datasets i.e. ORL and GT confirms ability of both the descriptors against various methods. Among all it is DLBP which achieves best accuracy.