Local Directional Gradient Pattern: A Local Descriptor for Face Recognition

• URL: http://arxiv.org/abs/2201.01276v1
• Date: Mon, 3 Jan 2022 08:34:25 GMT
• Title: Local Directional Gradient Pattern: A Local Descriptor for Face Recognition
• Authors: Soumendu Chakraborty, Satish Kumar Singh, and Pavan Chakraborty
• Abstract summary: The proposed local directional gradient pattern (LDGP) is a 1D local micropattern computed by encoding the relationships between the higher order derivatives of the reference pixel in four distinct directions. Results of the experiments conducted on benchmark databases AT&T, Extended Yale B and CMU-PIE show that the proposed descriptor significantly reduces the extraction as well as matching time while the recognition rate is almost similar to the existing state of the art methods.
• Score: 20.77994516381
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In this paper a local pattern descriptor in high order derivative space is proposed for face recognition. The proposed local directional gradient pattern (LDGP) is a 1D local micropattern computed by encoding the relationships between the higher order derivatives of the reference pixel in four distinct directions. The proposed descriptor identifies the relationship between the high order derivatives of the referenced pixel in four different directions to compute the micropattern which corresponds to the local feature. Proposed descriptor considerably reduces the length of the micropattern which consequently reduces the extraction time and matching time while maintaining the recognition rate. Results of the extensive experiments conducted on benchmark databases AT&T, Extended Yale B and CMU-PIE show that the proposed descriptor significantly reduces the extraction as well as matching time while the recognition rate is almost similar to the existing state of the art methods.

Related papers

• Multi-threshold Deep Metric Learning for Facial Expression Recognition [60.26967776920412]
  We present the multi-threshold deep metric learning technique, which avoids the difficult threshold validation. We find that each threshold of the triplet loss intrinsically determines a distinctive distribution of inter-class variations. It makes the embedding layer, which is composed of a set of slices, a more informative and discriminative feature.
  arXiv  Detail & Related papers  (2024-06-24T08:27:31Z)
• Boosting Few-shot Fine-grained Recognition with Background Suppression and Foreground Alignment [53.401889855278704]
  Few-shot fine-grained recognition (FS-FGR) aims to recognize novel fine-grained categories with the help of limited available samples. We propose a two-stage background suppression and foreground alignment framework, which is composed of a background activation suppression (BAS) module, a foreground object alignment (FOA) module, and a local to local (L2L) similarity metric. Experiments conducted on multiple popular fine-grained benchmarks demonstrate that our method outperforms the existing state-of-the-art by a large margin.
  arXiv  Detail & Related papers  (2022-10-04T07:54:40Z)
• Local Quadruple Pattern: A Novel Descriptor for Facial Image Recognition and Retrieval [20.77994516381]
  A novel hand crafted local quadruple pattern (LQPAT) is proposed for facial image recognition and retrieval. The proposed descriptor encodes relations amongst the neighbours in quadruple space. The retrieval and recognition accuracies of the proposed descriptor has been compared with state of the art hand crafted descriptors on bench mark databases.
  arXiv  Detail & Related papers  (2022-01-03T08:04:38Z)
• Local Gradient Hexa Pattern: A Descriptor for Face Recognition and Retrieval [20.77994516381]
  A local gradient hexa pattern (LGHP) is proposed that identifies the relationship amongst the reference pixel and its neighboring pixels. Discriminative information exists in the local neighborhood as well as in different derivative directions. The proposed descriptor has better recognition as well as retrieval rates compared to state-of-the-art descriptors.
  arXiv  Detail & Related papers  (2022-01-03T07:45:36Z)
• R-Theta Local Neighborhood Pattern for Unconstrained Facial Image Recognition and Retrieval [20.77994516381]
  R-Theta Local Neighborhood Pattern (RTLNP) is proposed for facial image retrieval. Proposed encoding scheme divides the local neighborhood into sectors of equal angular width. Average grayscales values of these two subsectors are encoded to generate the micropatterns.
  arXiv  Detail & Related papers  (2022-01-03T07:39:23Z)
• Short and Long Range Relation Based Spatio-Temporal Transformer for Micro-Expression Recognition [61.374467942519374]
  We propose a novel a-temporal transformer architecture -- to the best of our knowledge, the first purely transformer based approach for micro-expression recognition. The architecture comprises a spatial encoder which learns spatial patterns, a temporal dimension classification for temporal analysis, and a head. A comprehensive evaluation on three widely used spontaneous micro-expression data sets, shows that the proposed approach consistently outperforms the state of the art.
  arXiv  Detail & Related papers  (2021-12-10T22:10:31Z)
• ALIKE: Accurate and Lightweight Keypoint Detection and Descriptor Extraction [21.994171434960734]
  We present a differentiable keypoint detection module, which outputs accurate sub-pixel keypoints. The reprojection loss is then proposed to directly optimize these sub-pixel keypoints, and the dispersity peak loss is presented for accurate keypoints regularization. A lightweight network is designed for keypoint detection and descriptor extraction, which can run at 95 frames per second for 640x480 images on a commercial GPU.
  arXiv  Detail & Related papers  (2021-12-06T10:10:30Z)
• On the Limits of Pseudo Ground Truth in Visual Camera Re-localisation [83.29404673257328]
  Re-localisation benchmarks measure how well each method replicates the results of a reference algorithm. This begs the question whether the choice of the reference algorithm favours a certain family of re-localisation methods. This paper analyzes two widely used re-localisation datasets and shows that evaluation outcomes indeed vary with the choice of the reference algorithm.
  arXiv  Detail & Related papers  (2021-09-01T12:01:08Z)
• Lattice partition recovery with dyadic CART [79.96359947166592]
  We study piece-wise constant signals corrupted by additive Gaussian noise over a $d$-dimensional lattice. Data of this form naturally arise in a host of applications, and the tasks of signal detection or testing, de-noising and estimation have been studied extensively in the statistical and signal processing literature. In this paper we consider instead the problem of partition recovery, i.e.of estimating the partition of the lattice induced by the constancy regions of the unknown signal. We prove that a DCART-based procedure consistently estimates the underlying partition at a rate of order $sigma2 k*
  arXiv  Detail & Related papers  (2021-05-27T23:41:01Z)
• High Order Local Directional Pattern Based Pyramidal Multi-structure for Robust Face Recognition [0.0]
  We introduce a novel feature extraction technique that calculates the nth order direction variation patterns, named high order local directional pattern (HOLDP) The proposed HOLDP can capture more detailed discnative information than the conventional LDP. The performance evaluation of the proposed HOLDP algorithm is conducted on several publicly available face databases and observed the superiority of HOLDP under extreme illumination conditions.
  arXiv  Detail & Related papers  (2020-12-12T15:13:07Z)
• Accelerated Message Passing for Entropy-Regularized MAP Inference [89.15658822319928]
  Maximum a posteriori (MAP) inference in discrete-valued random fields is a fundamental problem in machine learning. Due to the difficulty of this problem, linear programming (LP) relaxations are commonly used to derive specialized message passing algorithms. We present randomized methods for accelerating these algorithms by leveraging techniques that underlie classical accelerated gradient.
  arXiv  Detail & Related papers  (2020-07-01T18:43:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.