S. L. Happy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
S. L. Happy has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Aurobinda Routray
Department of Electrical Engineering, IIT Kharagpur, Kharagpur, India
14 shared publications Aurobinda Routray
Indian Institute of Technology
6 shared publicationsAnjith George
Indian Institute of Technology Kharagpur, Kharagpur, India
4 shared publications- Ramanarayan Mohanty
IIT Kharagpur, Adv Technol Dev Ctr, Kharagpur 721302, W Bengal, India
4 shared publications Anirban Dasgupta
3 shared publications- Antitza Dantcheva
Inria Center at Université Côte d'Azur
2 shared publications
Latest Publications
- Open Access
How Unique Is a Face: An Investigative Study
Face recognition has been widely accepted as a means of identification in applications ranging from border control to security in the banking sector. Surprisingly, while widely accepted, we still lack the understanding of uniqueness or distinctiveness of faces as biometric modality. In this work, we study the impact of factors such as image resolution, feature representation, database size, age and gender on uniqueness denoted by the Kullback-Leibler divergence between genuine and impostor distributions. Towards understanding the impact, we present experimental results on the datasets AT&T, LFW, IMDb-Face, as well as ND-TWINS, with the feature extraction algorithms VGGFace, VGG16, ResNet50, InceptionV3, MobileNet and DenseNet121, that reveal the quantitative impact of the named factors. While these are early results, our findings indicate the need for a better understanding of the concept of biometric uniqueness and its implication on face recognition.
Open AccessHow Unique Is a Face: An Investigative Study
Face recognition has been widely accepted as a means of identification in applications ranging from border control to security in the banking sector. Surprisingly, while widely accepted, we still lack the understanding of uniqueness or distinctiveness of faces as biometric modality. In this work, we study the impact of factors such as image resolution, feature representation, database size, age and gender on uniqueness denoted by the Kullback-Leibler divergence between genuine and impostor distributions. Towards understanding the impact, we present experimental results on the datasets AT&T, LFW, IMDb-Face, as well as ND-TWINS, with the feature extraction algorithms VGGFace, VGG16, ResNet50, InceptionV3, MobileNet and DenseNet121, that reveal the quantitative impact of the named factors. While these are early results, our findings indicate the need for a better understanding of the concept of biometric uniqueness and its implication on face recognition.
- 1 December 2019
- Published by Elsevier in Pattern Recognition Letters
- Vol. 128, 162-168
A Weakly Supervised learning technique for classifying facial expressions
- 1 December 2019
- Published by Elsevier in Pattern Recognition Letters
- Vol. 128, 162-168
A Weakly Supervised learning technique for classifying facial expressions
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2513-2518
A Versatile Online System for Person-specific Facial Expression Recognition
In this paper, we introduce an online facial expression recognition (FER) model, which infers the emotional states in real time. This model enables the computer to interact more intelligently with the user. Our proposed mechanism identifies the frontal face along with the region of interest (ROI), extracts discriminating features from suitable facial landmarks, and classifies the facial expressions. Histogram of oriented gradient (HOG) is implemented to extract features and facial landmark positions from active facial regions, which enhances the system performance against all the possible scale and pose variations. The system speed improved with appropriate integration of detection and tracking algorithms. Further, support vector machine (SVM) classifier is used to classify the detected face into neutral or six universal emotions. For achieving the best results with new user faces, the system extracts the neutral features of the user during the time of execution and uses them to train the classifiers. To validate the performance of the proposed algorithm is validated using CK+ and RafD databases.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2513-2518
A Versatile Online System for Person-specific Facial Expression Recognition
In this paper, we introduce an online facial expression recognition (FER) model, which infers the emotional states in real time. This model enables the computer to interact more intelligently with the user. Our proposed mechanism identifies the frontal face along with the region of interest (ROI), extracts discriminating features from suitable facial landmarks, and classifies the facial expressions. Histogram of oriented gradient (HOG) is implemented to extract features and facial landmark positions from active facial regions, which enhances the system performance against all the possible scale and pose variations. The system speed improved with appropriate integration of detection and tracking algorithms. Further, support vector machine (SVM) classifier is used to classify the detected face into neutral or six universal emotions. For achieving the best results with new user faces, the system extracts the neutral features of the user during the time of execution and uses them to train the classifiers. To validate the performance of the proposed algorithm is validated using CK+ and RafD databases.
- 25 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 16 (6) , 932-936
Spatial–Spectral Regularized Local Scaling Cut for Dimensionality Reduction in Hyperspectral Image Classification
- 25 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 16 (6) , 932-936
Spatial–Spectral Regularized Local Scaling Cut for Dimensionality Reduction in Hyperspectral Image Classification
- Open Access
Graph Scaling Cut with L1-Norm for Classification of Hyperspectral Images
In this paper, we propose an L1 normalized graph based dimensionality reduction method for Hyperspectral images, called as L1-Scaling Cut (L1-SC). The underlying idea of this method is to generate the optimal projection matrix by retaining the original distribution of the data. Though L2-norm is generally preferred for computation, it is sensitive to noise and outliers. However, L1-norm is robust to them. Therefore, we obtain the optimal projection matrix by maximizing the ratio of between-class dispersion to within-class dispersion using L1-norm. Furthermore, an iterative algorithm is described to solve the optimization problem. The experimental results of the HSI classification confirm the effectiveness of the proposed L1-SC method on both noisy and noiseless data.
Open AccessGraph Scaling Cut with L1-Norm for Classification of Hyperspectral Images
In this paper, we propose an L1 normalized graph based dimensionality reduction method for Hyperspectral images, called as L1-Scaling Cut (L1-SC). The underlying idea of this method is to generate the optimal projection matrix by retaining the original distribution of the data. Though L2-norm is generally preferred for computation, it is sensitive to noise and outliers. However, L1-norm is robust to them. Therefore, we obtain the optimal projection matrix by maximizing the ratio of between-class dispersion to within-class dispersion using L1-norm. Furthermore, an iterative algorithm is described to solve the optimization problem. The experimental results of the HSI classification confirm the effectiveness of the proposed L1-SC method on both noisy and noiseless data.
- Open Access
An Effective Feature Selection Method Based on Pair-Wise Feature Proximity for High Dimensional Low Sample Size Data
Feature selection has been studied widely in the literature. However, the efficacy of the selection criteria for low sample size applications is neglected in most cases. Most of the existing feature selection criteria are based on the sample similarity. However, the distance measures become insignificant for high dimensional low sample size (HDLSS) data. Moreover, the variance of a feature with a few samples is pointless unless it represents the data distribution efficiently. Instead of looking at the samples in groups, we evaluate their efficiency based on pairwise fashion. In our investigation, we noticed that considering a pair of samples at a time and selecting the features that bring them closer or put them far away is a better choice for feature selection. Experimental results on benchmark data sets demonstrate the effectiveness of the proposed method with low sample size, which outperforms many other state-of-the-art feature selection methods.
Open AccessAn Effective Feature Selection Method Based on Pair-Wise Feature Proximity for High Dimensional Low Sample Size Data
Feature selection has been studied widely in the literature. However, the efficacy of the selection criteria for low sample size applications is neglected in most cases. Most of the existing feature selection criteria are based on the sample similarity. However, the distance measures become insignificant for high dimensional low sample size (HDLSS) data. Moreover, the variance of a feature with a few samples is pointless unless it represents the data distribution efficiently. Instead of looking at the samples in groups, we evaluate their efficiency based on pairwise fashion. In our investigation, we noticed that considering a pair of samples at a time and selecting the features that bring them closer or put them far away is a better choice for feature selection. Experimental results on benchmark data sets demonstrate the effectiveness of the proposed method with low sample size, which outperforms many other state-of-the-art feature selection methods.
- Open Access
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 40, 793-797
Graph scaling cut with L1-norm for classification of hyperspectral images
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 40, 793-797
Open AccessGraph scaling cut with L1-norm for classification of hyperspectral images
- Open Access
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1574-1578
An effective feature selection method based on pair-wise feature proximity for high dimensional low sample size data
- 1 August 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1574-1578
Open AccessAn effective feature selection method based on pair-wise feature proximity for high dimensional low sample size data