Pith. sign in

REVIEW 2 cited by

KeyPoint Relative Position Encoding for Face Recognition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.14852 v1 pith:VQVI2EEX submitted 2024-03-21 cs.CV

KeyPoint Relative Position Encoding for Face Recognition

classification cs.CV
keywords recognitionfacepixelsaffinekp-rperelativealignmentencoding
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In this paper, we address the challenge of making ViT models more robust to unseen affine transformations. Such robustness becomes useful in various recognition tasks such as face recognition when image alignment failures occur. We propose a novel method called KP-RPE, which leverages key points (e.g.~facial landmarks) to make ViT more resilient to scale, translation, and pose variations. We begin with the observation that Relative Position Encoding (RPE) is a good way to bring affine transform generalization to ViTs. RPE, however, can only inject the model with prior knowledge that nearby pixels are more important than far pixels. Keypoint RPE (KP-RPE) is an extension of this principle, where the significance of pixels is not solely dictated by their proximity but also by their relative positions to specific keypoints within the image. By anchoring the significance of pixels around keypoints, the model can more effectively retain spatial relationships, even when those relationships are disrupted by affine transformations. We show the merit of KP-RPE in face and gait recognition. The experimental results demonstrate the effectiveness in improving face recognition performance from low-quality images, particularly where alignment is prone to failure. Code and pre-trained models are available.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimizing Image Preparation and Compression for Face Recognition within 1024 Bytes

    cs.CV 2026-06 unverdicted novelty 4.0

    JPEG AI with optimized settings and preprocessing delivers the highest face recognition accuracy among tested codecs when compressing images to 1024 bytes.

  2. Optimizing Image Preparation and Compression for Face Recognition within 1024 Bytes

    cs.CV 2026-06 conditional novelty 4.0

    Optimized JPEG AI (plus AVIF/WebP), grayscale or color choice, downscaling and mild blur keep face recognition viable at ≤1024-byte images for ICAO-style and ABC-gate scenarios.