Main Article Content

Abstract

In this paper, we address the problem of robust face recognition with undersampled training data. Given only one or few training images available per subject, we present a novel recognition approach, which not only handles test images with large intraclass variations such as illumination and expression. The proposed method is also to handle the corrupted ones due to occlusion or disguise, which is not present during training. This is achieved by the learning of a robust auxiliary dictionary from the subjects not of interest. Together with the undersampled training data, both intra and interclass variations can thus be successfully handled, while the unseen occlusions can be automatically disregarded for improved recognition. Our experiments on four face image datasets confirm the effectiveness and robustness of our approach, which is shown to outperform state-of-the-art sparse representationbased methods.

Article Details

How to Cite
K.KAVITHA, R.GOWSALYA, S.KAVINKUMAR, & R.KOWSALYA. (2018). Robust and Low Rank Representation for Fast Face Identification with Occlusions . International Journal of Intellectual Advancements and Research in Engineering Computations, 6(2), 1961–1965. Retrieved from https://ijiarec.com/ijiarec/article/view/763