Clustering and jarque-bera normality test to face recognition

13Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The normality tests are widely used to estimate the difference between an empirical distribution and the normal distribution. In this paper, we propose to apply the Jarque-Bera normality test (JB-Test) in the face recognition field. In order to find out the face areas, which can be approximately represented using a normal distribution, we propose to build a new descriptor based on the JB-Test and Local Binary Pattern (LBP) descriptor. To predict whether a pixel belongs to the homogeneous area, Jarque-Bera Local Binary Pattern (JB-LBP) computes the confidence interval basing on the JB-Test and uses it later to generate a new pixel grayscale value. The obtained results show that the homogeneous areas pixels are in same way encoded. Therefore, we can easily distinguish them from the peaks areas. Moreover, to reveal that the proposed face representation gives better performances, we combine it with the K-means clustering, the K-Nearest Neighbors (KNN) and the Multi-layers Perceptron (MLP).

Cite

CITATION STYLE

APA

Dahmouni, A., El Moutaouakil, K., & Satori, K. (2018). Clustering and jarque-bera normality test to face recognition. In Procedia Computer Science (Vol. 127, pp. 246–255). Elsevier B.V. https://doi.org/10.1016/j.procs.2018.01.120

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free