Payungsak Kasemsumran, S. Auephanwiriyakul, N. Theera-Umpon
{"title":"Face recognition using string grammar fuzzy K-nearest neighbor","authors":"Payungsak Kasemsumran, S. Auephanwiriyakul, N. Theera-Umpon","doi":"10.1109/KST.2016.7440531","DOIUrl":null,"url":null,"abstract":"A string grammar fuzzy K-nearest neighbor is developed by incorporating 2 types of membership value into string grammar K-nearest neighbor. We apply these two string grammar fuzzy K-nearest neighbors in the face recognition system. The system provides 99.25%, 99.75%, 79.57%, 93.85%, and 100% in ORL, MIT-CBCL, Georgia Tech, FEI and JAFFE databases, respectively. Although, the results are satisfied, there are some limitations on the system. It is not scale-invariant. Also, the Levenshtein distance might create misperception between strings that are actually far apart but the calculated distance is small.","PeriodicalId":350687,"journal":{"name":"2016 8th International Conference on Knowledge and Smart Technology (KST)","volume":"5 Spec No 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Knowledge and Smart Technology (KST)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KST.2016.7440531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
A string grammar fuzzy K-nearest neighbor is developed by incorporating 2 types of membership value into string grammar K-nearest neighbor. We apply these two string grammar fuzzy K-nearest neighbors in the face recognition system. The system provides 99.25%, 99.75%, 79.57%, 93.85%, and 100% in ORL, MIT-CBCL, Georgia Tech, FEI and JAFFE databases, respectively. Although, the results are satisfied, there are some limitations on the system. It is not scale-invariant. Also, the Levenshtein distance might create misperception between strings that are actually far apart but the calculated distance is small.