Automatic Face Recognition Using Gabor Wavelet and Robust Structured Spares Representation
Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 1
Abstract
Automatically facial recognition has become more and more important today. But FR still remains a challenge problem in computer vision .so in this paper we proposed a new approach that use Gabor wavelet for facial feature extraction and robust structured sparse representation for classification. Gabor wavelet has beenwidely used in the face recognition task because it’s good imitation of human visual. The structured sparse representation based classification (SSRC) is used for classifying the test images robustly. Unlike sparse representation based classification (SRC),the SSRC explicitly takes structure of the dictionary into account for a better classification.
Authors and Affiliations
R. Madhura
Importance of Mean Shift in Remote Sensing Segmentation
The segmentation of an image can be considered as a preprocessing step for many of the algorithms such as object detection and identification. Many algorithms exist in the field of remote sensing for segmentati...
An Approach to Identify Dishonest Nodes Using MAC Protocol inMultihop Cellular Networks
Abstract: In mobility based networks, the mobile nodes usually relay on other node packets rather than theirown rightful packet for enhancing network performance. It happens due to the availability of some selfish...
A Study on Relational Semantic Video Content Extraction Using Bayesian Network Classifier
Abstract: Multimedia data mining is an emergent field, which consists of image mining, video data mining etc. The content based extraction in videos is an important application due to the rapid growth in the video...
Test Exude: Approach for Test Case Reduction
Abstract : Software development is a planned and structured process includes research, new development, modification, re-engineering results in software products. The structure of development of software is SDLC. I...
An Optimized Algorithm for Solving Combinatorial Problems using Reference Graph
Abstract: In this paper a novel optimized graph referencing method is proposed to tackle combinatorial problems with greater ease. The proposed algorithm is a modification of the existing backtracking algorithm....