cs.CVNov 12, 2026

Efficient Periocular Recognition through Model Scaling and Cross Spectral VIS NIR Verification

Authors: Fabian Stockhard, Juan E. Tapia, Christoph Busch

Organizations: da/sec-Biometrics and Internet Security Research Group, Hochschule Darmstadt, Germany

Abstract

Periocular recognition offers an efficient alternative to full-face verification when facial regions are occluded or image resolution is limited. We present AdaEye, a systematic study of input and backbone scaling for periocular verification in visible-spectrum (VIS) and cross-spectral (VIS/NIR) settings. Using an AdaFace-style framework, we compare full-face, masked-face, and dedicated 80x40 periocular inputs while varying backbone width and embedding dimensionality. Across four VIS/VIS and VIS/NIR protocols, we assess verification accuracy, computational cost, inference throughput, training memory, template size, and training stability. Direct periocular processing reduces recognition cost from 6.30 to 1.64 GMACs per image and increases measured throughput by approximately threefold. Its effectiveness depends on the evaluation protocol: periocular models perform better on native UFPR periocular images, whereas face-based protocols favor retaining more input information. Moderate backbone width reductions maintain comparable mean verification performance on CASIA and ND-NIVL while reducing computation. Embedding compression decreases template-storage requirements, primarily benefiting deployment. Multi-seed experiments reveal that some configurations require numerical stabilization, particularly when embedding and backbone reductions are combined. These findings support selecting compact periocular architectures according to the target protocol and deployment constraints, balancing accuracy, efficiency, storage, and robustness.

Figures & tables

Explore similar work

Nov 15, 2026

Ocular Recognition: Interoperability, Multi-Resolution, and Spectrum Challenges

Ocular recognition is typically developed under controlled acquisition conditions, limiting its use in semi-controlled and on-the-move scenarios. A key obstacle is the lack of representative data spanning real-world capture conditions. At a border checkpoint, for example, images may range from low-resolution visible-light periocular crops (RGB) to high-resolution near-infrared iris images (NIR). Using this heterogeneous evidence raises three questions: whether resolution-specific processing improves recognition, how to compare templates from different processing routes, and how to allocate training data across resolution specialists. We investigate resolution-specific processing and parameter sharing using three AdaFace-based architecture families: fixed-resolution specialists; Independent Backbones with Shared Heads (IBSH); and models with resolution-specific front-ends for 40x40, 80x80, and 160x160 inputs, followed by a shared identity trunk and embedding projection. We evaluate each architecture with route-specific training subsets and with a full-pool strategy, in which every specialist uses the complete selected training set. Results reveal a trade-off among same-resolution specialization, cross-resolution interoperability, and common-route re-extraction. Route-specific training produces distinct performance profiles across routes, whereas full-pool training makes route performance more uniform and primarily benefits the 160x160 route. Thus, adding training data does not improve all resolution routes equally.
May 15, 2026

Attention-Aware Transformer-Based Aggregation Network for Video Periocular Recognition

Video periocular recognition is the task of recognizing an individual's identity based on the region around an individual's eyes. The periocular area is one of the most discriminative regions of the human face, making it suitable for recognition tasks. Its use as a biometric modality has emerged as an alternative, especially in surveillance scenarios where conventional biometric traits such as face or iris recognition become unfeasible due to unconstrained acquisition conditions. This paper proposes an attention-aware approach for video-based periocular recognition in surveillance environments. The framework consists of two main modules: feature embedding and aggregation. The feature embedding module is a deep convolutional neural network that maps periocular data to feature vectors. The aggregation module is an encoder-only transformer that adaptively learns to aggregate frame-level features into a single video representation and a feature vector for the still reference image. Experiments on the publicly available COX Face dataset show the robustness of the proposed method, consistently outperforming naive aggregation schemes. In the best scenario, the approach achieves 99.8%99.8\% of TPR@1e−11e^{-1} and 96.6%96.6\% of Rank-5.
Nov 2, 2026

QFacePlacement: From Arbitrary Tensorization to Semantic Spatial Correspondence in Modern Face Verification

Quantum-inspired computer vision often reshapes high-dimensional features into tensors and applies tensor-network models. In face verification, this can be misleading: modern embeddings are optimized for cosine similarity, and tensorization alone does not establish the low-rank structure needed for tensor trains or matrix-product operators (MPOs). We study model placement through two controlled interfaces. First, cross-model embedding alignment requires a 512 x 512 operator to map AdaFace embeddings into ArcFace space. Dense Ridge and Procrustes mappings remain strong, while deterministic TT-SVD and MPO compression underperform even with basis changes and low-rank residuals. At a 64K-parameter storage budget, mean directional AUC is 0.9297 for dense Ridge, 0.8952 for rank-64 SVD, 0.8685 for the best low-rank-MPO hybrid, and approximately 0.649 for raw MPO. Second, before global pooling, we construct a 7 x 7 x 7 x 7 probe-gallery correspondence tensor from local AdaFace descriptors. A geometry-aware symmetric tensor train with bond dimension 2 uses 122 trainable parameters, compared with 2,403 for a dense linear matcher, while attaining an LFW AUC of 0.9802. Yet compression does not translate into better low-false-acceptance performance: on CFP-FP, TAR at FAR = 0.001 is 0.0102 versus 0.1734 for global cosine matching, and on CPLFW it is 0.7805 versus 0.8737. These results suggest that quantum-inspired factorization is most credible when the chosen interface provides task-aligned axes and compressible structure. They also show why aggregate AUC must be assessed alongside operational low-FAR metrics.