在人脸识别下可区分合成身份生成的容量研究
On the Capacity of Distinguishable Synthetic Identity Generation under Face Verification
AI总结:
研究在固定阈值下生成可区分合成身份的最大数量,通过生成式人脸识别管道分析身份验证约束,提出球面码问题及随机码容量的理论框架。
摘要:
我们研究在固定阈值τ下能生成多少合成身份,使得人脸识别器将同身份对判定为匹配,异身份对判定为非匹配。我们针对由生成器和归一化识别映射组成的生成式人脸识别管道,定义可区分身份生成的容量为最大潜在身份数量,其诱导嵌入分布满足指定的同身份和异身份验证约束。在确定性视角不变情况下,我们证明该容量由实现实嵌入集上的球面码问题决定,并在完全角表达性假设下退化为经典球面码量。对于随机身份生成,我们引入中心模型并推导出充分可接受条件,其中身份中心间的分离度为arccos(τ)+2ρ,其中ρ是身份内集中半径。在完全角表达性下,这产生基于球面码的可实现下界和嵌入维度的正指数增长下界。我们还引入先验约束的随机码容量,其中潜在身份独立采样自给定先验,并推导出以身份中心配对分离失败概率为函数的高概率下界。在更强的全能力支持模型下,我们获得反向结论和精确的球面码刻画。
英文摘要:
Synthetic face generators can produce many nominal identities, but nominal count does not determine how many are jointly distinguishable under a specified verification rule. We define finite-dimensional capacity as the supremum of codebook sizes over distinct latent identity codes whose induced identity-conditional embedding distributions satisfy per-identity genuine acceptance and pairwise impostor non-match constraints. For deterministic view-invariant pipelines, fixed-code capacity equals the spherical-code cardinality over the realizable embedding set and reduces to the classical spherical-code cardinality when every sphere direction is realizable. For stochastic identity-conditional embedding distributions concentrated with probability at least $1-η$ in spherical caps of angular radius $ρ$, we derive a sufficient center-separation condition, spherical-code capacity lower bounds under full angular expressivity, and positive asymptotic lower-bound exponents for dimension-indexed pipeline families. We also derive prior-constrained random-code lower bounds from pairwise center-separation failure probabilities. When each identity-conditional embedding distribution has support equal to a spherical cap of angular radius $ρ$, we derive necessary zero-error geometric conditions and, for $2ρ<\arccos(τ)$ under full $ρ$-cap angular expressivity, show that the restricted zero-error capacity equals the classical spherical-code cardinality at minimum angle $\arccos(τ)+2ρ$. For finite repeated-view samples, a maximum clique in the resulting compatibility graph identifies the largest sampled subset satisfying all empirical genuine and pairwise impostor constraints. We evaluate this sample-restricted quantity on a deterministically selected DigiFace-1M subset under three fixed recognizers with identity-disjoint in-domain threshold calibration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。