Low-Rank Subspaces in GANs

This product is an open source software. If you would like to access the source code, please visit the below link. (You do not need to click "ADD TO CART" for this item)

<<To ACCESS Source Code: CLICK HERE>>

Authors: Jiapeng Zhu, Ruili Feng, Yujun Shen, Deli Zhao, Zhengjun Zha, Jingren Zhou, Qifeng Chen

The latent space of a Generative Adversarial Network (GAN) has been shown to encode rich semantics within some subspaces. To identify these subspaces, researchers typically analyze the statistical information from a collection of synthesized data, and the identified subspaces tend to control image attributes globally (i.e., manipulating an attribute causes the change of an entire image). By contrast, this work introduces low-rank subspaces that enable more precise control of GAN generation. Concretely, given an arbitrary image and a region of interest (e.g., eyes of face images), we manage to relate the latent space to the image region with the Jacobian matrix and then use low-rank factorization to discover steerable latent subspaces. There are three distinguishable strengths of our approach that can be aptly called LowRankGAN. First, compared to analytic algorithms in prior work, our low-rank factorization of Jacobians is able to find the low-dimensional representation of attribute manifold, making image editing more precise and controllable. Second, low-rank factorization naturally yields a null space of attributes such that moving the latent code within it only affects the outer region of interest. Therefore, local image editing can be simply achieved by projecting an attribute vector into the null space without relying on a spatial mask as existing methods do. Third, our method can robustly work with a local region from one image for analysis yet well generalize to other images, making it much easy to use in practice. Extensive experiments on state-of-the-art GAN models (including StyleGAN2 and BigGAN) trained on various datasets demonstrate the effectiveness of our LowRankGAN.


Authors:
Department of Computer Science and Engineering Assistance Professor Prof. Qifeng Chen
Key Features:
In this work, we propose low-rank subspaces to perform controllable generation in GANs. The low-rank decomposition of the Jacobian matrix established between an arbitrary image and the latent space yields a null space, which enables image local editing by simply altering the latent code with no need for spatial masks. We also find that the low-rank subspaces identified from the local region of one image can be robustly applicable to other images, revealing the internal semantic-aware structure of the GAN latent space. Extensive experiments demonstrate the powerful performance of our algorithm on precise generation control with well-trained GAN models.
Specification:
Please refer to the published paper for specification
Category:
Source Code
Reference:
https://arxiv.org/pdf/2106.04488.pdf
Contact Us:
ttsamuel@ust.hk
Download (1)

Low-Rank Subspaces in GAN
2106.04488_0.pdf*
size: 8150949 KB, type: application/pdf


You would be able to download the files marked with an asterisk '*' only after logging in to your account and completing the purchase of the product license.
License
Price Per Unit:
(Not Applicable)
Terms: (Not Applicable)
License Type: Open Source License