Face Recognition using an Affine Sparse Coding approach | ||
| Journal of AI and Data Mining | ||
| مقاله 6، دوره 5، شماره 2، مهر 2017، صفحه 223-234 اصل مقاله (1.69 M) | ||
| نوع مقاله: Original/Review Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jadm.2017.890 | ||
| نویسندگان | ||
| M. Nikpour1؛ R. Karami* 1؛ R. Ghaderi2 | ||
| 1Electrical and Computer Engineering Department, Babol Noushirvani University of Technology, Babol, Iran. | ||
| 2Nuclear Engineering, Shahid Beheshti University of Tehran, Tehran, Iran. | ||
| چکیده | ||
| Sparse coding is an unsupervised method which learns a set of over-complete bases to represent data such as image and video. Sparse coding has increasing attraction for image classification applications in recent years. But in the cases where we have some similar images from different classes, such as face recognition applications, different images may be classified into the same class, and hence the classification performance may be decreased. In this paper, we propose an Affine Graph Regularized Sparse Coding approach for face recognition problem. Experiments on several well-known face datasets show that the proposed method can significantly improve the face classification accuracy. In addition, some experiments have been done to illustrate the robustness of the proposed method to noise. The results show the superiority of the proposed method in comparison to some other methods in face classification. | ||
| کلیدواژهها | ||
| Sparse coding؛ Manifold Learning؛ Face recognition؛ Graph Regularization | ||
|
آمار تعداد مشاهده مقاله: 1,282 تعداد دریافت فایل اصل مقاله: 1,375 |
||