提出U-Face框架,实现无需标注数据的精准人脸属性编辑。
U-Face: An Efficient and Generalizable Framework for Unsupervised Facial Attribute Editing via Subspace Learning
- 将语义向量学习建模为子空间问题,提升可解释性。
- 引入正交非负约束与边界向量,显著减少属性间干扰。
- 适用于虚拟形象、娱乐等需精细控制人脸属性的场景。
基于潜在空间的人脸属性编辑方法因其在数字娱乐、虚拟角色生成和人机交互系统中的高效灵活特性而广受欢迎,尤其适用于连续属性调整。无监督方法通过不依赖标签数据发现有效语义向量,受到广泛关注。然而,现有方法仍存在解耦困难的问题:调整某一属性时可能意外影响其他属性,导致细粒度控制复杂。为此,本文提出一种新型无监督人脸属性可控编辑框架——U-Face。该方法将语义向量学习建模为子空间学习问题,将潜在向量近似于由语义向量矩阵张成的低维语义子空间。该形式也可从投影-重构视角解释,并进一步泛化为自编码器框架,为灵活实现解耦表示学习提供基础。为提升解耦性和可控性,我们对语义向量施加正交非负约束,并引入属性边界向量以降低学习方向上的纠缠。尽管这些约束使优化问题复杂,我们设计了交替迭代算法AIDC,具备闭式更新和特定条件下的收敛性保证。
原文摘要 · Abstract (English)
Latent space-based facial attribute editing methods have gained popularity in applications such as digital entertainment, virtual avatar creation, and human-computer interaction systems due to their potential for efficient and flexible attribute manipulation, particularly for continuous edits. Among these, unsupervised latent space-based methods, which discover effective semantic vectors without relying on labeled data, have attracted considerable attention in the research community. However, existing methods still encounter difficulties in disentanglement, as manipulating a specific facial attribute may unintentionally affect other attributes, complicating fine-grained controllability. To address these challenges, we propose a novel framework designed to offer an effective and adaptable solution for unsupervised facial attribute editing, called Unsupervised Facial Attribute Controllable Editing (U-Face). The proposed method frames semantic vector learning as a subspace learning problem, where latent vectors are approximated within a lower-dimensional semantic subspace spanned by a semantic vector matrix. This formulation can also be equivalently interpreted from a projection-reconstruction perspective and further generalized into an autoencoder framework, providing a foundation that can support disentangled representation learning in a flexible manner. To improve disentanglement and controllability, we impose orthogonal non-negative constraints on the semantic vectors and incorporate attribute boundary vectors to reduce entanglement in the learned directions. Although these constraints make the optimization problem challenging, we design an alternating iterative algorithm, called Alternating Iterative Disentanglement and Controllability (AIDC), with closed-form updates and provable convergence under specific conditions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。