Académique Documents
Professionnel Documents
Culture Documents
Web Site: www.ijettcs.org Email: editor@ijettcs.org, editorijettcs@gmail.com Volume 2, Issue 3, May June 2013 ISSN 2278-6856
ROBUST MULTI GRADIENT ENTROPY METHOD FOR FACE RECOGNITION SYSTEM FOR LOW CONTRAST NOISY IMAGES
C. Naga Raju1, P.Prathap Naidu2, R. Pradeep Kumar Reddy3, G. Sravana Kumari4
1
Associate Professor, CSE Dept, YSR Engg College of YVU 2 Asst. Professor, CSE Dept, RGM Engg College 3 Asst. Professor, CSE Dept, YSR Engg College. 4 M.Tech In CSE RGM Engg College
known to improve theperformance of simple subspace methods (e.g. PCA) orclassifiers (e.g. nearest neighbors) based on image pixel representations [4], but its influence on more sophisticated feature sets has not received the attention that it deserves. For example, for Histogramof Oriented Gradient features combining normalizationand robust features is useful in [5], while histogramequalization has essentially no effect on LBP descriptors[6,7], and in some cases preprocessing actually hurtsperformance [8,9,10] presumably because it removes toomuch useful information. However in complex tasks such as face recognition, it is often the case that no single class of features is rich enough to capture all of the available information. Finding and combining complementary feature sets has thus become an active research topic, with successful applications in many challenging tasks including handwritten character recognition [11] and face recognition [12]. Here we show that combining three of the most successful local face representations, multiple gradient method and Local Ternary Patterns (LTP), and entropy based method, gives considerably better performance than either alone. The three feature sets are complimentary in the sense that LTP captures small appearance details while entropy preserves facial shape over a broader range of scales.
LTP,Entropy,Feature sets,
I. INTRODUCTION
Face recognition has received a great deal of attention from the scientific and industrial communities over the past several decades owing to its wide range of applications in information security and access control, law enforcement,surveillance and more generally image understanding[1].Most of these methods were initially developed with face images collected under relatively well controlled conditions and in practice they have difficulty in dealing with the range of appearance variationsthat commonly occur in unconstrained natural images due to illumination, pose, facial expression, ageing, partial occlusions, etc. This paper focuses mainly on the issue of robustness to lighting variations. For example, a face verification system for a portable device should be able to verify a client atany time (day or night) and in any place (indoors or outdoors).Unfortunately, facial appearance depends strongly on the ambient lighting and as emphasized by the recent FRVT and FRGC trials [2,3]this remains one of the major challenges for current face recognition systems.We will investigate several aspects of this framework:1) The relationship between image normalization and feature sets. Normalization is Volume 2, Issue 3 May June 2013
2. PROPOSED METHOD
2.1. Multi gradientmethod This algorithm is computed based on the notion of regional maxima, regional minima, most significant value in the region and regional sorted Meddle values and uses different gradient algorithms constructed based on regional maxima, regional minima and regional sorted Meddle values for reconstruction. A pixel p of I isa local maximum for grid G if and only if its valueI (p) is greater or equal to that of any of itsneighbors. A pixel p of I is a local minimum forgrid G if and only if its value I (p) is less than orequal to that of any of its neighbors. A pixel p of Iis a local median for grid G if and only if its value I(p) is in N/2 position of the sorted grid G of itsneighbors. A pixel p of I is a most significant forgrid G if and only if it has more neighbors than anypixel in the grid. Next we Page 193
Here t is a user-specified threshold for LTP so these codes are more resistant to noise, but no longer strictly invariant to gray-level transformations. The LTP encoding procedure is illustrated in fig7.
Fig1: Illustration of the basic LTP Operator When using LTP for visual matching we could use 3valued codes, but the uniform pattern argument also applies in the ternary case. For simplicity, the experiments below use a coding scheme that splits each ternary pattern into its positive and negative halves as illustrated in Fig. 2, subsequently treating these as two separate channels of LBP descriptors for which separate histograms and similarity metrics are computed, combining the results only at the end of the computation. LTPs bear some similarity to the texture spectrum (TS) technique. However TS did not include preprocessing, thresholding, local histograms or uniform pattern based dimensionality reduction and it was not tested on faces.
Here p; q are image region descriptors (histogram vectors), respectively. This method gave excellent results on the FERET dataset. However subdividing the face into a regular grid seems somewhat arbitrary: the cells are not necessarily well aligned with facial features, and the partitioning is likely to cause both aliasing and loss of spatial resolution. Given that the overall goal of coding is to provide illumination- and outlier-robust visual correspondence with some leeway for small spatial deviations due to misalignment, it seems more appropriate to use a Hausdorff-distance-like similarity metric that takes each LTP pixel code in image X and tests whether a similar code appears at a nearby position in image Y, with a weighting that decreases smoothly with image distance. Such a scheme should be able to achieve discriminant appearance based image matching with a well-controllable degree of spatial looseness.
3. Experimental results
LBPs have proven to be highly discriminative features for image classification and they are resistant to lighting effects in the sense that they are invariant to monotonic gray-level transformations. However because they threshold at exactly the value of the central pixel they tend to be sensitive to noise, particularly in near-uniform Page 194
Fig2: Splitting an LTP Code into positive and negative LBP Codes Volume 2, Issue 3 May June 2013
Graph1
Fig3: Database images (first row), LBP (second row), proposed(third row) Table2
Fig1:a)Original image b)multi gradient c)LTP image d)Entropy image 3.2 Test cases: Graph2
Fig2.Database images (first row), LBP (second row), proposed (third row) Table1 Fig4: Database images (first row),LBP (second row),proposed(third row) Table3
Page 195
5. References
Graph3 [1] W. Zhao, R. Chellappa, P. J. Phillips, and A. Rosenfeld, Face recognition: A literature survey, ACM Computing Surveys,vol. 34, no. 4, pp. 399 485, 2003. [2] L.Sirovich and M. Kirby, Low dimensional procedure for the characterization of human faces, J. Optical Society of America, vol. 4, no. 3, pp. 519 524, 1987. [3] P. J. Phillips, P. J. Flynn, W. T. Scruggs, K. W. Bowyer, J. Chang, K. Hoffman, J. Marques, J. Min, and W. J. Worek, Overview of the face recognition grand challenge, in CVPR, San Diego, CA, 2005, pp. 947954. [4] H. Wang, S. Li, and Y. Wang, Face recognition under varying lighting conditions using selfquotient image, in IEEE Int. Conf. Automatic Face & Gesture Recognition, 2004, pp. 819824. [5] N. Dalal and B. Triggs, Histograms of oriented gradients for human detection, in CVPR, Washington, DC, USA, 2005, pp. 886893. [6 Face description with local binary patterns: Application to face recognition, IEEE Trans. Pattern Analysis & Machine Intelligence, vol. 28, no. 12, 2006. [7] W. Gao, B. Cao, S. Shan, X. Chen, D. Zhou, X. Zhang, and D. Zhao, The CAS-PEAL large-scale chinese face database and baseline evaluations, IEEE Trans. Systems, Man and Cybernetics, Part A, vol. 38, no. 1, pp. 149161, 2008. [8] T. Zhang, D. Tao, X. Li, and J. Yang, Patch alignment for dimensionality reduction, IEEE Trans. Knowledge & Data Engineering, vol. 21, no. 9, pp. 12991313, 2009. [9] H. Chen, P. Belhumeur, and D. Jacobs, In search of illumination invariants, in CVPR, 2000, pp. I: 254261. [10] T. Chen, W. Yin, X. Zhou, D. Comaniciu, and T. Huang, Total variation models for variable lighting face recognition, IEEE Trans. Pattern Analysis & Machine Intelligence, vol. 28, no. 9, pp. 15191524, 2006. [11] Y. S. Huang and C. Y. Suen, A method of combining multiple experts for the recognition of unconstrained handwritten numerals, IEEE Trans. Pattern Analysis & Machine Intelligence, vol. 17, no. 1, pp. 9094, 1995. [12] C. Liu and H. Wechsler, A shape- and texture-based enhanced fisher classifier for face recognition, IEEE Trans. Image Processing, vol. 10, no. 4, pp. 598608, 2001. Page 196
Graph4
Page 197