Feature Subspace Estimation for Resolving Dimensionality Mismatch in Practical Color-Based Face Recognition Systems

Author(s):  
Jae Young Choi

Recently, considerable research efforts have been devoted to effective utilization of facial color information for improved recognition performance. Of all color-based face recognition (FR) methods, the most widely used approach is a color FR method using input-level fusion. In this method, augmented input vectors of the color images are first generated by concatenating different color components (including both luminance and chrominance information) by column order at the input level and feature subspace is then trained with a set of augmented input vectors. However, in practical applications, a testing image could be captured as a grayscale image, rather than as a color image, mainly caused by different, heterogeneous image acquisition environment. A grayscale testing image causes so-called dimensionality mismatch between the trained feature subspace and testing input vector. Disparity in dimensionality negatively impacts the reliable FR performance and even imposes a significant restriction on carrying out FR operations in practical color FR systems. To resolve the dimensionality mismatch, we propose a novel approach to estimate new feature subspace, suitable for recognizing a grayscale testing image. In particular, new feature subspace is estimated from a given feature subspace created using color training images. The effectiveness of proposed solution has been successfully tested on four public face databases (DBs) such as CMU, FERET, XM2VTSDB, and ORL DBs. Extensive and comparative experiments showed that the proposed solution works well for resolving dimensionality mismatch of importance in real-life color FR systems.

Author(s):  
V. Ramya ◽  
G. Sivashankari

Face recognition from the images is challenging due to the wide variability of face appearances and the complexity of the image background. This paper proposes a novel approach for recognizing the human faces. The recognition is done by comparing the characteristics of the new face to that of known individuals. It has Face localization part, where mouth end point and eyeballs will be obtained. In feature Extraction, Distance between eyeballs and mouth end point will be calculated. The recognition is performed by Neural Network (NN) using Back Propagation Networks (BPN) and Radial Basis Function (RBF) networks. The recognition performance of the proposed method is tabulated based on the experiments performed on a number of images.


Author(s):  
Kalyan Chakravarthi. M

Abstract: Recognition from faces is a popular and significant technology in recent years. Face alterations and the presence of different masks make it too much challenging. In the real-world, when a person is uncooperative with the systems such as in video surveillance then masking is further common scenarios. For these masks, current face recognition performance degrades. Still, difficulties created by masks are usually disregarded. Face recognition is a promising area of applied computer vision . This technique is used to recognize a face or identify a person automatically from given images. In our daily life activates like, in a passport checking, smart door, access control, voter verification, criminal investigation, and many other purposes face recognition is widely used to authenticate a person correctly and automatically. Face recognition has gained much attention as a unique, reliable biometric recognition technology that makes it most popular than any other biometric technique likes password, pin, fingerprint, etc. Many of the governments across the world also interested in the face recognition system to secure public places such as parks, airports, bus stations, and railway stations, etc. Face recognition is one of the well-studied real-life problems. Excellent progress has been done against face recognition technology throughout the last years. The primary concern to this work is about facial masks, and especially to enhance the recognition accuracy of different masked faces. A feasible approach has been proposed that consists of first detecting the facial regions. The occluded face detection problem has been approached using Cascaded Convolutional Neural Network (CNN). Besides, its performance has been also evaluated within excessive facial masks and found attractive outcomes. Finally, a correlative study also made here for a better understanding.


2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Huy Nguyen-Quoc ◽  
Vinh Truong Hoang

Histogram of Oriented Gradient (HOG) is a robust descriptor which is widely used in many real-life applications, including human detection, face recognition, object counting, and video surveillance. In order to extract HOG descriptor from color images whose information is three times more than the grayscale images, researchers currently apply the maximum magnitude selection method. This method makes the information of the resulted image is reduced by selecting the maximum magnitudes. However, after we extract HOG using the unselected magnitudes of the maximum magnitude selection method, we observe that the performance is better than using the maximum magnitudes in several cases. Therefore, in this paper, we propose a novel approach for extracting HOG from color images such as Color Component Selection and Color Component Fusion. We also propose the extended kernels in order to improve the performance of HOG. With our new approaches in the color component analysis, the experimental results of several facial benchmark datasets are enhanced with the increment from 3 to 10% of accuracy. Specifically, a 95.92% of precision is achieved on the Face AR database and 75% on the Georgia Face database. The results are better more than 10 times compared with the original HOG approach.


Author(s):  
Yacine Gafour ◽  
Djamel Berrabah ◽  
Abdelkader Gafour

In real-life applications, the appearance of a face changes significantly due to variations in expression, lighting, aging, exposure, and occlusion, which makes face recognition difficult. We present in this article a new approach for facial recognition. This approach is based on a set of variants of the Ho-LBP descriptor that we have proposed. In fact, the presentation of the images using a set of variants of the Ho-LBP descriptor helps the classifier to learn better. In addition, these variants are combined to improve the performance of facial recognition. We evaluated the effectiveness of our approach on ORL, Extended Yale B, and Feret databases. The obtained results are very promising, especially when compared with those of existing approaches. They show that our approach improves the accuracy of facial recognition in a very efficient way and in particular to the variations of the poses and the changes of the luminance.


2007 ◽  
Vol 18 (8) ◽  
pp. 706-712 ◽  
Author(s):  
Michael J. Bernstein ◽  
Steven G. Young ◽  
Kurt Hugenberg

Although the cross-race effect (CRE) is a well-established phenomenon, both perceptual-expertise and social-categorization models have been proposed to explain the effect. The two studies reported here investigated the extent to which categorizing other people as in-group versus out-group members is sufficient to elicit a pattern of face recognition analogous to that of the CRE, even when perceptual expertise with the stimuli is held constant. In Study 1, targets were categorized as members of real-life in-groups and out-groups (based on university affiliation), whereas in Study 2, targets were categorized into experimentally created minimal groups. In both studies, recognition performance was better for targets categorized as in-group members, despite the fact that perceptual expertise was equivalent for in-group and out-group faces. These results suggest that social-cognitive mechanisms of in-group and out-group categorization are sufficient to elicit performance differences for in-group and out-group face recognition.


Sensors ◽  
2019 ◽  
Vol 19 (22) ◽  
pp. 5015
Author(s):  
Karol Abratkiewicz ◽  
Piotr Samczyński

This paper presents a novel approach to fast and accurate non-linear pulse signal reconstruction dedicated for electromagnetic sensors and their applications such as ELectronic INTelligence (ELINT), electronic warfare (EW), electronic reconnaissance (ER) systems, as well as for passive bistatic radar purposes in which other pulse radars are used as a source of illumination. The method is based on the instantaneous chirp rate (CR) estimation in the time-frequency (TF) domain providing a calculation of the frequency rate between every two consecutive samples. Such a new method allows for the precise reconstruction of the non-linear frequency modulated (NLFM) signal to be carried out in significantly shorter time in comparison to methods known in the literature. The presented approach was tested and validated using both simulated and real-life radar signals proving the usability of the proposed solution in practical applications. The results were compared with the precise extended generalized chirp transform (EGCT) method as a reference technique, using optimal matched filtration as the main concept.


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Shu-Bo Chen ◽  
Saima Rashid ◽  
Muhammad Aslam Noor ◽  
Zakia Hammouch ◽  
Yu-Ming Chu

Abstract Inequality theory provides a significant mechanism for managing symmetrical aspects in real-life circumstances. The renowned distinguishing feature of integral inequalities and fractional calculus has a solid possibility to regulate continuous issues with high proficiency. This manuscript contributes to a captivating association of fractional calculus, special functions and convex functions. The authors develop a novel approach for investigating a new class of convex functions which is known as an n-polynomial $\mathcal{P}$ P -convex function. Meanwhile, considering two identities via generalized fractional integrals, provide several generalizations of the Hermite–Hadamard and Ostrowski type inequalities by employing the better approaches of Hölder and power-mean inequalities. By this new strategy, using the concept of n-polynomial $\mathcal{P}$ P -convexity we can evaluate several other classes of n-polynomial harmonically convex, n-polynomial convex, classical harmonically convex and classical convex functions as particular cases. In order to investigate the efficiency and supremacy of the suggested scheme regarding the fractional calculus, special functions and n-polynomial $\mathcal{P}$ P -convexity, we present two applications for the modified Bessel function and $\mathfrak{q}$ q -digamma function. Finally, these outcomes can evaluate the possible symmetric roles of the criterion that express the real phenomena of the problem.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 1007
Author(s):  
Chi Xu ◽  
Yunkai Jiang ◽  
Jun Zhou ◽  
Yi Liu

Hand gesture recognition and hand pose estimation are two closely correlated tasks. In this paper, we propose a deep-learning based approach which jointly learns an intermediate level shared feature for these two tasks, so that the hand gesture recognition task can be benefited from the hand pose estimation task. In the training process, a semi-supervised training scheme is designed to solve the problem of lacking proper annotation. Our approach detects the foreground hand, recognizes the hand gesture, and estimates the corresponding 3D hand pose simultaneously. To evaluate the hand gesture recognition performance of the state-of-the-arts, we propose a challenging hand gesture recognition dataset collected in unconstrained environments. Experimental results show that, the gesture recognition accuracy of ours is significantly boosted by leveraging the knowledge learned from the hand pose estimation task.


2021 ◽  
Vol 16 (1) ◽  
pp. 1-23
Author(s):  
Bo Liu ◽  
Haowen Zhong ◽  
Yanshan Xiao

Multi-view classification aims at designing a multi-view learning strategy to train a classifier from multi-view data, which are easily collected in practice. Most of the existing works focus on multi-view classification by assuming the multi-view data are collected with precise information. However, we always collect the uncertain multi-view data due to the collection process is corrupted with noise in real-life application. In this case, this article proposes a novel approach, called uncertain multi-view learning with support vector machine (UMV-SVM) to cope with the problem of multi-view learning with uncertain data. The method first enforces the agreement among all the views to seek complementary information of multi-view data and takes the uncertainty of the multi-view data into consideration by modeling reachability area of the noise. Then it proposes an iterative framework to solve the proposed UMV-SVM model such that we can obtain the multi-view classifier for prediction. Extensive experiments on real-life datasets have shown that the proposed UMV-SVM can achieve a better performance for uncertain multi-view classification in comparison to the state-of-the-art multi-view classification methods.


Sign in / Sign up

Export Citation Format

Share Document