L ARGE S CALE I MAGE C OMPLETION VIA C O -M ODULATED G ENERATIVE A DVERSARIAL N ETWORKS
Anonymous authors
Paper under double-blind review
A BSTRACT
Numerous task-speciﬁc variants of conditional generative adversarial networks have been developed for image completion.
A serious limitation is revealed that all existing algorithms tend to fail when handling large-scale missing regions.
To overcome this challenge, we propose a generic new approach that bridges the gap between image-conditional and recent modulated unconditional generative architectures via co-modulation of both conditional and stochastic style representations.
Due to the lack of good quantitative metrics for image completion, we propose the new Paired/Unpaired Inception Discriminative Score (P-IDS/U-IDS) , which robustly reﬂects the perceptual ﬁdelity of inpainted images compared to real images based on a machine discriminator.
Experiments demonstrate superior performance over state-of-the-art methods in free-form image completion and easy generalization to image-to-image translation in terms of both quality and diversity.
I NTRODUCTION
Generative adversarial networks (GANs) have received a great amount of attention in the past few years.
A fundamental problem emerges from the divergence of development between imageconditional and unconditional GANs.
Image-conditional GANs have a wide variety of computer vision applications (Isola et al., 2017).
While vanilla U-Net-like generators cannot achieve promising performance especially in free-form image completion (Liu et al., 2018; Yu et al., 2019), a multiplicity of task-speciﬁc approaches have been proposed to specialize GAN frameworks, mostly focused on hand-engineering multi-stage architectures, specialized operations, and intermediate structures like edges, contours, or textures (Altinel et al., 2018;
Ding et al., 2018; Iizuka et al., 2017; Jiang et al., 2019; Liu et al., 2018; 2019a; Nazeri et al., 2019; Ren et al., 2019; Wang et al., 2018; Xie et al., 2019;
Xiong et al., 2019; Yan et al., 2018; Yu et al., 2018; 2019; Yu et al., 2019; Zeng et al., 2019; Lahiri et al., 2020; Zhao et al., 2020;
Li et al., 2020;
Zhou et al., 2020).
These branches of works have made signiﬁcant progress in reducing the generated artifacts like color discrepancy and blurriness.
However, a serious challenge is revealed that all existing algorithms tend to fail when handling large-scale missing regions.
This is mainly due to their unawareness of the underlying generative capability — one would never learn to complete a large proportion of an object as long as it does not have the capability of generating a completely new one.
We argue that the key to overcome this challenge is to bridge the gap between image-conditional and unconditional generative architectures .
Recently, the performance of unconditional GANs has been fundamentally advanced, owing to the success of modulation approaches (Chen et al., 2019; Karras et al., 2019a;b) with learned style representations produced by the latent vector.
Researchers have been extending modulation approaches to the image-conditional setting, where the style representations are fully determined by an input image (Park et al., 2019; Huang et al., 2018; Liu et al., 2019b); however, the absence of stochasticity makes them hardly generalizable to the settings where limited conditional information is available.
This is fatal especially in large scale image completion.
Even though some multi-modal unpaired image-to-image translation methods propose to encode the style from another reference image (Huang et al., 2018; Liu et al., 2019b), this unreasonably assumes that the style representations are completely independent of the conditional input and hence compromises the paired consistency.
Therefore, we propose the co-modulated generative adversarial networks , a generic approach that leverages the generative capability from the unconditional modulated architectures and embeds both conditional and stochastic style representations via co-modulation .
Co-modulated GANs are able to
[Figure]
The are sampled within a 10k validation split (top two examples) and the Places2 validation set (Zhou et al., 2017) (bottom two examples).
We refer the readers to the appendix for extensive qualitative examples.
generate stochastically consistent contents and generalize well to not only small-scale inpainting but also extremely large-scale image completion, supporting both regular and irregular masks even when there is little conditional information.
See Fig.
1 for qualitative examples.
Due to the effectiveness of co-modulation, we do not encounter any problem suffered in the image completion literature (Liu et al., 2018; Yu et al., 2019) hence successfully bridge the long-existing divergence.
Another major barrier in the image completion literature is due to the lack of good quantitative metrics.
The vast majority of works in this literature seek to improve their performance in terms of similarity-based metrics that heavily prefer blurry results, e.g., L 1 , L 2 , PSNR, and SSIM, while many state that there is yet no good quantitative metric for image completion (Liu et al., 2018; Yu et al., 2018; 2019).
The only gold standard in this literature is the user study, which conducts real vs. fake test once given a pair of images to the users.
However, the user study is inaccurate and costly, while strongly depending on the particular setting, and hence deviates from the reproducibility.
Inspired by the user study, we propose the new Paired/Unpaired Inception Discriminative Score (P-IDS/U-IDS) .
Besides its intuitiveness and scalability, we demonstrate that P-IDS/U-IDS is robust to sampling size, effective of capturing subtle differences, and correlates well to human preferences.
Our contributions are summarized as follows:
• We propose the co-modulated GANs , a generic approach that bridges the gap between image-conditional and recent modulated unconditional generative architectures.
• We propose the new P-IDS/U-IDS for robustly assessing the perceptual ﬁdelity for GANs.
• Experiments demonstrate superior performance in free-form image completion and easy generalization to image-to-image translation in terms of both quality and diversity.
R ELATED W ORK
Image-Conditional GANs.
Image-conditional GANs can be applied to a variety of image-to-image translation tasks (Isola et al., 2017).
The unpaired setting is also investigated when paired training data is not available (Choi et al., 2018;
Huang et al., 2018;
Kim et al., 2019; Liu et al., 2017; Yi et al., 2017; Zhu et al., 2017a).
Recent works exploit normalization layers with learned style representations embedded from the conditional input or another reference image to enhance the output ﬁdelity (Huang et al., 2018;
Kim et al., 2019; Liu et al., 2019b; Park et al., 2019).
They can be regarded as a set of conditional modulation approaches, but still lack stochastic generative capability and hence poorly generalize when limited conditional information is available.
Isola et al.
(2017) initially ﬁnd that the generator tends to ignore the noise input although they try to feed it, in contrast to unconditional or class-conditional GANs.
A branch of works aims to enforce the intra-conditioning diversity using VAE-based latent sampling strategies (Zhu et al., 2017b) or imposing distance-based loss terms (Huang et al., 2018; Mao et al., 2019; Qin et al., 2018).
Wang et al.
(2019b) also propose to decompose the convolution kernels into stochastic basis. However, the enforcement of diversity conversely results in the deterioration of image quality. Our co-modulation approach not only learns the stochasticity inherently but also makes the trade-off easily controllable. Image Completion.
Image completion, also referred to as image inpainting when incapable of completing large-scale missing regions, has received a signiﬁcant amount of attention.
It is a constrained image-to-image translation problem but exposes more serious challenges.
Traditional methods (Ballester et al., 2001; Barnes et al., 2009; Darabi et al., 2012; Efros & Freeman, 2001; Efros & Leung, 1999) utilize only low-level features and fail to generate semantically consistent contents. Then, (Köhler et al., 2014; Ren et al., 2015; Xie et al., 2012) adopt deep neural networks for image completion; (Pathak et al., 2016) ﬁrst exploits conditional GANs.
Numerous follow-up works focus on the semantic context and texture, edges and contours, or hand-engineered architectures (Altinel et al., 2018;
Ding et al., 2018; Iizuka et al., 2017; Jiang et al., 2019; Jo & Park, 2019; Lahiri et al., 2017; Liu et al., 2019a; Nazeri et al., 2019; Ren et al., 2019; Sagong et al., 2019; Wang et al., 2018;
Xie et al., 2019; Xiong et al., 2019; Yan et al., 2018;
Yang et al., 2017; 2019a; Yu et al., 2018; Yu et al., 2019; Zeng et al., 2019; Lahiri et al., 2020; Zhao et al., 2020;
Li et al., 2020;
Zhou et al., 2020), among which (Liu et al., 2018; Yu et al., 2019) introduce partial convolution and gated convolution to address free-form image completion.
The lack of stochasticity is also observed in image completion (Cai & Wei, 2019; Ma et al., 2019; Zheng et al., 2019).
Other works address the so-called outpainting subtasks (Sabini & Rusak, 2018; Wang et al., 2019a; Yang et al., 2019b).
To our knowledge, none of these methods produce promising results in the presence of free-form large-scale missing regions.
Evaluation Metrics.
Great research interest has been drawn on the evaluation of GANs (DeVries et al., 2019; Gurumurthy et al., 2017; Sajjadi et al., 2018;
Snell et al., 2017; Xiang & Li, 2017).
Inception Score (IS) (Salimans et al., 2016), and some other metrics like FCN-Score (Isola et al., 2017), are specialized to the pre-trained task thus cannot generalize.
While FID (Heusel et al., 2017) is generally acceptable, few promising metrics for image completion exist.
Previous works heavily rely on similarity-based metrics such as L 1 , L 2 , PSNR, and SSIM, which fail to capture stochastic regions and are ill-ﬁtted for GANs.
Our proposed metric is also related to the classiﬁer-based tests (Blau & Michaeli, 2018; Lopez-Paz & Oquab, 2016).
However, previous classiﬁer-based metrics require separate sets for training and testing the classiﬁer, making them sensitive to the underlying generalizability of the trained classiﬁer.
We formulate the discriminability as a simple scalable metric for both the paired and unpaired versions without relying on the generalizability.
C O -M ODULATED G ENERATIVE A DVERSARIAL N ETWORKS
Image-conditional GANs address the problem of translating an image-form conditional input y to an output image x
(Isola et al., 2017).
We assume for the setting where paired correspondence between input conditions and output images is available in the training data.
The generator takes as input an image y along with the latent vector z and produces the output x ; the discriminator takes as input a pair of ( x , y ) and seeks to distinguish fake generated pairs from the real distribution.
Image
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
{+Due on Nov, 
+}
Yue Dong YaoClass 70x
y z
D
E M E ( y ) M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70x
y z D E M
E ( y )
M ( z ) s s (cid:31) A ψ =ψ =ψ = Formulas: Instructed by
{+Due on Nov, 
+}
Yue Dong YaoClass 70x
y z
[-Formulas: Instructed by Due on Nov, 
 Yue Dong YaoClass 70x-]D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
[-Due on Nov, 
-]
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass
[Table]
z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov,
[Table]
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass
[Table] [Table]
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x
[Table]
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =(a)
Formulas: Instructed by Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
{+Due on Nov, 
+}
Yue Dong YaoClass 70x
[-Due on Nov, 
-]y z D E M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
Yue
[Table] [Table]
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
Yue Dong
[Table]
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
2019 Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
[Table]
x y z
D
E
M
E (
[Table]
ψ
[Table]
ψ
[Table]
ψ
[Table] [Table]
[Table] [Table]
A ψ
[Table]
ψ
[Table]
ψ
[Table]
A ψ =
[Table]
ψ =
[Table]
ψ =
[Table]
2019 Yue Dong YaoClass 70 2017011407 x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
[Table]
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
[Table]
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by
YaoClass x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =(c)
[Table]
ion
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov,
4 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov,
4 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due
Yue x y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
{+Due on Nov, 
+}
Yue Dong YaoClass 70x
y z
D
E M E ( y ) M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
y z
D E M E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas:
Instructed by
Due on Nov,
Yue Dong YaoClass 70x
[-Due on Nov, 
-]
y z
D
E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =(d) completion can be regarded as a constrained image-conditional generation problem where known pixels are restricted to be unchanged.
In contrast to the extensive literature on specialized image completion frameworks, we introduce a generic approach that bridges between image-conditional
GANs and recent success of unconditional modulated architectures.
3. R EVISITING M ODULATION A PPROACHES
Modulation approaches emerge from the style transfer literature (Dumoulin et al., 2016;
Huang &
Belongie, 2017) and are well exploited in state-of-the-art unconditional or class-conditional GANs.
They generally apply scalar denormalization factors (e.g., bias and scaling) to the normalized feature maps, while the learned denormalization factors are conditioned on the side information such as class label (Odena et al., 2018) or the latent vector (Chen et al., 2019).
Typical normalization layers used in the modulation blocks include batch normalization (Chen et al., 2019;
Odena et al., 2018), adaptive instance normalization (Huang & Belongie, 2017; Karras et al., 2019a), and weight demodulation (Karras et al., 2019b) referred to the weight normalization (Salimans & Kingma, 2016).
Here we take StyleGAN2 (Karras et al., 2019b) as an example to show how intermediate activations are modulated as a function of the latent vector.
As illustrated in Fig.
2(a), the decoder D simply originates from a learned constant, while the latent vector z is passed through a multi-layer fully connected mapping network M .
The mapped latent vector linearly generates a style vector s for each subsequent modulation via a learned afﬁne transformation A (i.e., a dense layer without activation):
[Equation]
Consider a vanilla convolutional layer with kernel weights w ijk , where i , j , k enumerate the input channels, the output channels, and the spatial footprint of the convolution, respectively.
Given the style vector s , the input feature maps are ﬁrst channel-wise multiplied by s , passed through the convolution, and ﬁnally channel-wise multiplied by s (cid:48) where s (cid:48)
j = (cid:113) 1 / (cid:80) i,k
( s i w ijk ) 2 acting as the weight demodulation step that normalizes the feature maps into statistically unit variance.
While modulation approaches have signiﬁcantly improved the performance of unconditional or class-conditional generators, we wonder whether they could similarly work for image-conditional generators.
An intuitive extension to the vanilla image-conditional generator (Fig. 2(b)) would be the conditional modulated generator (see Fig. 2(c)), where the modulation is conditioned on the learned ﬂattened features from the image encoder E .
Similar structures also exist in the well-conditioned image-to-image translation tasks (Huang et al., 2018;
Liu et al., 2019b; Park et al., 2019).
In this case, the style vector can be rewritten as
[Equation]
However, a signiﬁcant drawback of the conditional modulation approach would be the lack of stochastic generative capability.
This problem emerges more apparently in respect of large scale image completion.
In most cases, the outputs should be weakly conditioned , i.e., they are not conv co-modulation block ... ... demod Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z D E
M E ( y ) M ( z ) s s (cid:31) A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z D E
M
E ( y )
M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong
YaoClass2017011407 x y z D E M E ( y ) M ( z ) s
[Equation]
A
[Equation]
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong
YaoClass 70 2017011407 x
y z D E M E ( y ) M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x
y z D E M E ( y ) M ( z ) s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z D
M
[Equation]
s s (cid:31)
A ψ =ψ =ψ =
Formulas: Instructed by Due on Nov, 4 2019 Yue Dong YaoClass 70 2017011407 x y z D E
E
[Equation]
y )
[Equation]
s s
[Equation]
A
[Equation]
= of promoting stochasticity without loss of consistency.
sufﬁciently determined by the conditional input.
As a result, it not only cannot produce diverse outputs but also poorly generalizes to the settings where limited conditional information is available.
3. C O -M ODULATION
To overcome this challenge, we propose co-modulation , a generic new approach that easily adapts the generative capability from the unconditional modulated generators to the image-conditional generators.
We rewrite the co-modulated style vector as (see Fig. 2(d)):
[Equation]
(3) i.e., a joint afﬁne transformation conditioning on both style representations.
Generally, the style vector can be a non-linear learned mapping from both inputs, but here we simply assume that they can be linearly correlated in the style space and already observe considerable improvements.
The linear correlation facilitates the inherent stochasticity as will see in §5.1 that co-modulated GANs can easily trade-off between quality and intra-conditioning diversity without imposing any external losses, and moreover, co-modulation contributes to not only stochasticity but also visual quality especially at large-scale missing regions.
Fig.
3 provides an in-depth illustration of the proposed co-modulated generative architectures.
Each co-modulation block conditionally and stochastically co-modulates a convolutional layer in the generative decoder, using weight demodulation as the normalization layer as revisited in §3.1. See Appendix A for more implementation details.
Co-modulated GANs are encouraged to be trained with regular discriminator losses, while not requiring any direct guidance like the L 1 term (Isola et al., 2017), to fully exploit their stochastic generative capability.
P AIRED /U NPAIRED I NCEPTION D ISCRIMINATIVE S CORE
Our proposed Paired/Unpaired Inception Discriminative Score (P-IDS/U-IDS) aims to reliably measure the linear separability in a pre-trained feature space, inspired by the “human discriminators” in the user study.
Let I ( · ) be the pre-trained Inception v3 model that maps the input image to the output features of 2048 dimensions.
We sample the same number of real images and their correspondingly generated fake images (drawn from the joint distribution ( x , x (cid:48) )
∈ X , where x corresponds to the real image and x (cid:48) corresponds to the fake image), from which the features are extracted and then ﬁtted by a linear SVM.
The linear SVM reﬂects the linear separability in the feature space and is known to be numerically stable in training.
Let f ( · ) be the (linear) decision function of the SVM, where f ( I ( x )) >
if and only if x is considered real.
The P-IDS is given by
[Equation]
i.e., the probability that a fake sample is considered more realistic than the corresponding real sample.
We also provide an unpaired alternative that could generalize to the settings where no paired information is available.
We similarly sample the same number of real images (drawn from distribution X ) [Figure] still suffers from large variance. Although it achieves unbiased estimates, the huge variance even makes them often negative and hardly dis and fake images (drawn from distribution X (cid:48) ) and ﬁt the linear SVM f ( · ) .
We directly calculate the misclassiﬁcation rate instead:
[Equation]
In addition to the super intuitiveness of P-IDS/U-IDS we would like to emphasize three of their major advantages over FID: the robustness to sampling size, the effectiveness of capturing subtle differences, and the good correlation to human preferences.
Robustness to Sampling Size.
We test the response of P-IDS, U-IDS, FID, and KID to four manipulation strategies: masking the image (to zeros) with a random square of width w = 1 , 2 , 4 , 8 , respectively.
Images are sampled from the FFHQ dataset (Karras et al., 2019a) at 512 × 512 resolution.
The reference distribution for calculating FID is measured using 50k samples.
As plotted in Fig.
4, both P-IDS and U-IDS converge fast within a small number of samples and successfully distinguish the manipulation strategies; FID fails to converge within 10k samples, while the highest convergence line (1.13 when w = 8 , measured using 50k samples) is even below the lowest FID at 10k samples (1.63 when w = 1 ).
Although KID addresses the “biased” problem of FID (Bi´nkowski et al., 2018), we ﬁnd that the estimates are still subject to huge variance like FID especially when the two distributions are close.
KID requires a ﬁxed block size (Bi´nkowski et al., 2018) to achieve unbiased estimates; even with a block size of 1000 that minimizes its variance, the estimates are still hardly distinguishable especially between w = 1 and w = 2 as plotted in Fig.
Effectiveness of Capturing Subtle Differences.
Capturing subtle differences is particularly important in image completion, since the difference between inpainted and real images only exists in a partial region.
We construct subtle image manipulation strategies by masking n random pixels which are then nearest-point interpolated by the neighboring pixels, using the same environment as the last experiment.
As plotted in Fig.
6, P-IDS successfully distinguishes the number of manipulated pixels, [Table] [Figure] while FID and KID fail to respond within 2 9 noisy
We note that U-IDS is still more robust in this case since the central tendency of FID and KID is signiﬁcantly dominated by the variance.
Correlation to Human Preferences.
P-IDS imitates the “human discriminators” and is expected to correlate well with human preferences.
While it seems clear in Fig.
7, we quantitatively measure the correlation using these data points (20 in total): the correlation coefﬁcient is 0 . 870 between P-IDS and human preference rate, signiﬁcantly better than − 0 .
765 of FID.
[-If we disregard the linear relationship, the Spearman’s rank-order correlation of P-IDS is 0 . 
 compared-]Table 3 further provides a case analysis where our P-IDS/U-IDS coincides with clear human preferences as opposed to FID.
Computational Analysis. The time complexity of training a linear SVM is between O ( n 2 ) and O ( n 3 ) (Bottou & Lin, 2007), compared to O ( nd 2 + d 3 ) of FID (Heusel et al., 2017) and O ( n 2 d ) of KID (Bi ´ nkowski et al., 2018), where n is the sampling size and d is the dimension of feature space.
{+In practice, P-IDS/U-IDS incurs mild computational overhead in addition to the feature extraction process. For example, with 10k samples, extracting the Inception features on an NVIDIA P
 GPU takes 221s, and ﬁtting the SVM (which only uses CPU) takes an extra+} of 88s; with 50k samples, the feature extraction process and the SVM take 1080s and 886s respectively.
E XPERIMENTS 5. I MAGE C OMPLETION
We conduct image completion experiments at 512 × 512 resolution on the FFHQ dataset (Karras et al., 2019a) and the Places2 dataset (Zhou et al., 2017).
Implementation details are provided in
Appendix A. FFHQ is augmented with horizontal ﬂips; Places2 is central cropped or padded.
The sampling strategy of free-form masks for training and evaluating is speciﬁed in the appendix.
We preserve 10k out of 70k images from the FFHQ dataset for validation.
Places2 has its own validation set of 36.5k images and a large training set of 8M images.
We train our model for 25M images on FFHQ and 50M images on Places2.
Our model is compared against RFR (Li et al., 2020) and
DeepFillv2 (Yu et al., 2019), the state-of-the-art algorithms for free-form image completion, using both their ofﬁcial pre-trained models and our retrained version of DeepFillv2 (using the ofﬁcial code, our datasets, and our sampling strategy) at 1M iterations (i.e., 32M images).
We sample the output once per validation image for all the metrics (P-IDS, U-IDS, and FID).
The overall results are summarized in Table 1.
Fig.
7 plots the user study results, P-IDS, and FID of DeepFillv2 (retrained) and ours w.r.t.
different masked ratios.
See Fig.
8 for a qualitative comparison.
All these results demonstrate our superior performance.
More qualitative examples, numerical user study results and complete tables w.r.t.
the masked ratio, and details of the user study are provided in the appendix. [Figure]
The Inherent Stochasticity.
Co-modulated GANs are inherently stochastic, i.e., they naturally learn to utilize the stochastic style representations without imposing any external losses, and they are able to produce diverse results even when both the input image and the input mask are ﬁxed.
Furthermore, by tuning the truncation ψ (Karras et al., 2019b; Kynkäänniemi et al., 2019) that explicitly ampliﬁes the stochastic branch by ψ times, co-modulated GANs can easily trade-off between quality and diversity (see Fig. 9).
Ablation Study.
Co-modulation promotes not only stochasticity but also image quality.
We compare vanilla, conditional modulated, and co-modulated GANs as illustrated in Figs. 2(b) to 2(d).
Experiments are run on the FFHQ dataset with the same setting as § 5.1.
While the vanilla version completely fails, our co-modulation approach dominates the conditional modulated version and especially when the masked ratio becomes large (see Fig. 11).
We refer the readers to the appendix for the complete results (Table 6).
Qualitatively, we often observe some unusual artifacts of the conditional modulated one in the large missing regions (see Fig. 10), which we hypothesize is due to the lack of stochastic generative capability.
[-[Figure] Nov, [Figure] Yue Dong YaoClass 
-]5. I MAGE - TO -I MAGE T RANSLATION
Edges to Photos.
Co-modulated GANs are generic image-conditional models that can be easily adopted to image-to-image translation tasks.
[-Formulas: Instructed by [Figure] Nov, 
-]We follow the common setting (DeVries et al., 2019;
Wang et al., 2019b) on the edges to photos datasets (Isola et al., 2017) at 256 × 256 resolution, where
[Figure] Formulas: [Figure]
Formulas: [Figure]
Formulas: [Figure] [Figure] modulated GANs can easily trade-off between quality and diversity by tuning the truncation ψ .
[Figure] [Table] FID samples once per validation image (200 in total) and the training set is used as the reference distribution; LPIPS measures the intra-conditioning diversity for which we sample 2k pairs. As summarized in Table
[Table] our approach easily achieves superior ﬁdelity (FID) over state-of-the-art methods (Huang et al., 2018; Isola et al., 2017; Wang et al., 2019b; Zhu et al., 2017b) despite the fact that MUNIT assumes for the different unpaired setting (Huang et al., 2018) [Table] and also superior diversity on the Edges2Handbags dataset by simply tuning the truncation ψ as well as in the trade-off view (see Fig. 12).
Our model does not learn to produce diverse outputs on the Edges2Shoes dataset despite its high ﬁdelity, which we hypothesize is due to the learned strong correspondence between the input edge map and the color information extracted from the limited training set.
Labels to Photos (COCO-Stuff). We further experiment on the COCO-Stuff dataset (Caesar et al., 2018) at 256 × 256 resolution following the experimental setting of SPADE (Caesar et al., 2018). The real images are resized to a short edge of 256 and then random cropped. The input label map hasclasses; an embedding layer is used before feeding it into the network.
We sample the output once per validation image (5k in total) for all the evaluation metrics. Table 3 shows that our method matches the FID of SPADE but signiﬁcantly outperforms its P-IDS and U-IDS, without any direct supervision like the perceptual loss used in SPADE.
We further conduct a user study between SPADE and ours. The user study indicates consistent human preference of ours over SPADE in accordance with our proposed P-IDS/U-IDS. Qualitative results and the user study details are provided in the appendix.
[Table]
We propose the co-modulated generative adversarial networks , a generic approach that bridges the gap between conditional and unconditional modulated generative architectures, signiﬁcantly improves free-form large scale image completion, and easily generalizes to image-to-image translation.
We also propose the intuitive new metric — P-IDS/U-IDS — for robustly assessing the perceptual ﬁdelity for GANs.
We expect our approach to be a fundamental solution to the image completion literature and contribute as reliable quantitative benchmarks.
A PPENDIX A I MPLEMENTATION D ETAILS
We mostly borrow the network details and hyperparameters from StyleGAN2 (Karras et al., 2019b), including the number of convolutional layers (2) at each level, the number of channels (64 at 512 ×resolution, doubled at each coarser level with a maximum of 512), architecture of the mapping network M (8-layer MLP), layer-wise noise injection, style mixing regularization (with a probability of 0 .instead), non-saturating logistic loss (Goodfellow et al., 2014) with R 1 regularization (Mescheder et al., 2018) of γ = 10 , and the Adam optimizer (Kingma & Ba, 2014) with a learning rate of 0.002.
Our conditional encoder E imitates a similar architecture as the discriminator but without the crosslevel residual connections.
Skip residual connections are used between each level of E and D .
To produce the conditional style representation, the ﬁnal 4 × 4 feature map of E is ﬂattened and passed through a fully connected layer of 1024 channels with a dropout rate of 0 . 5 .
The dropout layer keeps enabled during testing since we observe that it partially correlates to the inherent stochasticity.
Our model has 109M parameters in total.
All the experiments are run on 8 cards of NVIDIA Tesla
V100 GPUs.
The batch size is 4 per GPU, 32 in total.
The training length is 25M images unless speciﬁed, which takes about 1 week at 512 × 512 resolution.
A PPENDIX B F REE -F ORM M ASK S AMPLING
We sample free-form masks for training by simulating random brush strokes and rectangles.
The algorithm of generating brush strokes is borrowed from DeepFillv2 (Yu et al., 2019), while the width of the brush is uniformly sampled within [12 , 48] , the number of vertices is uniformly sampled within [4 , 18] , and the number of strokes is uniformly sampled within [0 , 20] .
We then generate multiple rectangles with uniformly random widths, heights, and locations, while the number of up to full-size rectangles is uniformly sampled within [0 , 5] and the number of up to half-size rectangles is uniformly sampled within [0 , 10] .
See Fig.
13 for the sampled free-form masks.
During evaluation, we use the same sampling strategy of free-form masks as used in training if no masked ratio is speciﬁed; otherwise, we repeatedly apply the same algorithm until the speciﬁed range is satisﬁed. [Figure]
[Equation]
For the user study of image completion, we randomly sample the same number (256) of validation images, free-form masks (using the algorithm above), and the corresponding outputs from each method, for each dataset and each range of masked ratio.
The user is given a pair of fake and the corresponding real images in each round and has 5 seconds to decide which one is fake or “don’t know”; overtime rounds are also treated as “don’t know”.
No user will see a real for more than once.
To compute the user preference rate of fakes over reals, we regard a correct answer as 0, an incorrect answer as 1, and a “don’t know” as 0.5.
We have received totally 14336 rounds of answers fromparticipants.
See Table 4 for the numerical results.
We adopt a similar protocol for the user study on COCO-Stuff.
In each round, the user is given a pair of generated images of SPADE (Park et al., 2019) and ours using the same validation input.
The user has 5 seconds to decide which one is preferred or “don’t know”; overtime rounds are also treated as “don’t know”.
We regard a “don’t know” as 0.5.
We have received 720 rounds of answers fromparticipants, among which 319 prefer ours, 189 prefer SPADE, and 212 “don’t know”.
[Equation]
Table 5 presents the quantitative results for image completion across methods and masked ratios.
Table 6 presents the quantitative results of the ablation experiment.
Experiments demonstrate our superior performance at all masked ratios.
[Equation]
Fig.
15 presents qualitative samples for image-to-image translation on the COCO-Stuff dataset.
Extensive examples for free-form image completion are presented in Figs.
A PPENDIX F D ISCUSSION
Large scale image completion is a challenging task that requires not only generative but also recognition capability.
Although our model generates promising results in most cases, it sometimes fails to recognize the semantic information in the surrounding areas hence produces strange artifacts (see Fig. 14), especially in on challenging Places2 dataset that contains millions of scenes under various style and quality.
The readers are encouraged to discover more examples from our interactive demo.
[Table]
[Table] [Table] [Table]
Input Real SPADE Ours
Input Real SPADE Ours
[Figure] [Figure] [Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure] [Figure]