Face recognition using string grammar fuzzy K-nearest neighbor
© 2016 IEEE. 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...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | وقائع المؤتمر |
| منشور في: |
2018
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84966534385&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55525 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | Chiang Mai University |
| الملخص: | © 2016 IEEE. 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. |
|---|