SRDA: Generating Instance Segmentation Annotation Via Scanning, Reasoning And Domain Adaptation
Wenqiang Xu Yonglu Li Cewu Lu
cs.CV

headings





SRDA


Wenqiang Xu, Yonglu Li and Cewu Lu




Department of Computer Science and Engineering,

	Shanghai Jiaotong University

	 {vinjohn,yonglu_li,lucewu}@sjtu.edu.cn


SRDA: Generating Instance Segmentation Annotation Via Scanning, Reasoning And Domain Adaptation
    Wenqiang Xuthese two authors contributed equally, Yonglu Li, Cewu Lu
    December 30, 2023
===============================================================================================




Instance segmentation is a problem of significance in computer vision. However, preparing annotated data for this task is extremely time-consuming and costly. By combining the advantages of 3D scanning, reasoning, and GAN-based domain adaptation techniques, we introduce a novel pipeline named SRDA to obtain large quantities of training samples with very minor effort. Our pipeline is well-suited to scenes that can be scanned, i.e. most indoor and some outdoor scenarios. To evaluate our performance, we build three representative scenes and a new dataset, with 3D models of various common objects categories and annotated real-world scene images. Extensive experiments show that our pipeline can achieve decent instance segmentation performance given very low human labor cost.






§ INTRODUCTION

Instance segmentation <cit.> is one of the fundamental problems in computer vision, which provides many more details in comparison to object detection <cit.>, or semantic segmentation <cit.>. With the development of deep learning, significant progress has been made in instance segmentation. Many annotated datasets of large quantity were proposed <cit.>. However, in practice, when meeting a new environment with many new objects, large-scale training data collection and annotation is inevitable, which is cost-prohibitive and time-consuming.

Researchers have longed for a means of generating numerous training samples with minor effort.
Computer graphics simulation is a promising way, since a 3D scene can be a source of unlimited photorealistic images paired with ground truths. Besides, modern simulation techniques are capable of synthesizing most indoor and outdoor scenes with perceptual plausibility. Nevertheless, these two advantages are double-edged, rendered images would be painstaking to make the simulated scene visually realistic <cit.>. Moreover, for new environment, it is very likely some of the objects in reality are not in the 3D model database. 



We present a new pipeline that attempts to address these challenges. Our pipeline comprises three stages: scanning, physics reasoning, domain adaptation (SRDA) as shown in Fig. <ref>. At the first stage, new objects and environmental background from a certain scene are scanned into 3D models. Unlike other CG based methods that do simulation with existing model datasets, images synthesized by our pipeline can ensure realistic effect and well describe the targeting environment, since we use real-world scanned data. At the reasoning stage, we proposed a reasoning system to generate proper layout for each scene by fully considering physically and commonsense plausible. Physics engine is used to ensure physically plausible and commonsense plausible is checked by commonsense likelihood (CL) function. For example, “a mouse on the mouse pad and they on the table” would have a large output in CL function. In the last stage, we proposed a novel Geometry-guided GAN (GeoGAN) framework. It integrates geometry information (segmentation as edge cue, surface normal, depth) which helps to generate more plausible images. In addition, it includes a new component Predictor which can serve as a useful auxiliary supervision, and also a criterion to score the visual quality of images.

The major advantage of our pipeline is time-saving. Compared with conventional exhausting annotation, we can reduce labor cost by nearly 2000 folds, in the meantime, achieve decent accuracy, preserving 90% performance. (See Fig. <ref>). The most time-consuming stage is scanning, which is easy to accomplish in most of indoor and some of outdoor scenarios.

Our pipeline can be widely adaptive to many scenarios. We choose three representative scenes, namely a shelf from a supermarket (for a self-service supermarket), a desk from an office (for home robot), a tote similar in Amazon Robotic Challenge[https://www.amazonrobotics.com/#/roboticschallenge]. 
	
To the best of our knowledge, no current datasets consist of compact 3D object/scene models and real scene images with instance segmentation annotations. Hence, we build a dataset to prove the efficacy of our pipeline. This dataset have two parts, one for scanned object models (SOM dataset) and one for real scene images with instance level annotations (Instance-60K).
	
Our contributions have two folds: 

	
  * The main contribution is the novel three-stage SRDA pipeline. We added a reasoning system to the feasible layout building and proposed a new domain adaptation framework named GeoGAN. It is time-saving and the output images are close to real ones according to the evaluation experiment.
	
  * To demonstrate the effectiveness, we build up a database which contains 3D models of common objects and corresponding scenes (SOM dataset) and scene images with instance level annotations (instance-60K).

	
We will first review some of the related concepts and works in Sec. <ref> and depict the whole pipeline from Sec. <ref> on. We describe the scanning process in Sec. <ref>, reasoning system in Sec. <ref>, and GAN-based domain adaptation in Sec. <ref>. In Sec. <ref>, we illustrate how Instance-60K dataset is built. Extensive evaluation experiments are carried out in Sec. <ref>. And finally, we discuss the limitation of our pipeline in Sec. <ref>.



§ RELATED WORKS


Instance Segmentation Instance segmentation has become a hot topic in recent years. Dai et al. <cit.> proposed a complex multiple-stage cascaded network that does detection, segmentation, and classification in sequence. Li et al. <cit.> combined a segment proposal system and object detection system, simultaneously producing object classes, bounding boxes, and masks. Mask R-CNN <cit.> supports multiple tasks including instance segmentation, object detection, human pose estimation. Whereas exhausting labeling is required to guarantee a satisfactory performance, if we apply these methods to a new environment.

Generative Adversarial Networks Since introduced by Goodfellow <cit.>, GAN-based methods have fruitful results in various fields, such as image generation <cit.>, image-to-image translation <cit.>, 3D model generation <cit.>, etc. The former paper on image-to-image translation inspired our work, it indicates GAN has the potential to bridge the gap between simulation domain and real domain.
	
Image-to-Image Translation A general image-to-image translation framework was first introduced by Pix2Pix <cit.>, but it required a great amount of paired data. Chen <cit.> proposed a cascaded refinement network free of adversarial training, which gets high-resolution results, but still demands paired data. Taigman et al. <cit.> proposed an unsupervised approach to learn cross-domain conversion, however it needs a pre-trained function to map samples from two domains into an intermediate representation. Dual learning <cit.> is soon imported for unpaired image translation, but currently, dual learning methods encounter setbacks when camera viewpoint or object position varies. On the contrary to CycleGAN, Benaim et al. <cit.> learned one-side mapping.
Refining rendered image using GAN is also not unknown <cit.>.
Our work is a complementary to these approaches, where we deal with more complex data and tasks. We will compare <cit.> with our GeoGAN in Sec. <ref>. 
	
Synthetic Data for Training Some researchers attempt to generate synthetic data for vision tasks such as viewpoint estimation <cit.>, object detection <cit.>, semantic segmentation <cit.>. In <cit.>, Alhaija et al. addressed generation of instance segmentation training data for street scenes with technical effort in producing realistically rendered and positioned cars. However, they focus on street scenes and do not use an adversarial formulation.
	
Scene Generation by Computer Graphics Scene generation by CG techniques is a well-studied area in the computer graphics community <cit.>. These methods are capable of generating plausible layout of indoor or outdoor scene, but they have no intention to transfer the rendered images to real domain.



§ SCANNING PROCESS


In this section, we describe the scanning process.
Objects and scene backgrounds are scanned in two ways due to the scale issue.
	
We choose the multi-view environment (MVE) <cit.> to perform dense reconstruction for objects, since it is image-based and thus requires only a RGB sensor. Objects are first videotaped, which can be easily done by most RGB sensors. In the experiment, we use an iPhone5s. The videos are sliced into images with multiple viewpoints, and fed into MVE to generate 3D models.
We can videotape multiple objects (at least 4) and generate corresponding models per time, which can alleviate the scalability issue when new objects are too many to scan one by one.
MVE is capable of generating dense meshes with a fine texture. As for the texture-less objects, we scan the object with hand holding, and the hand-object interaction can be a useful cue for reconstruction, as indicated in <cit.>.
	
For the environmental background, scenes without targeting objects were scanned by Intel RealSense R200 and reconstructed by ReconstructMe[http://reconstructme.net/]. We follow the official instruction to operate reconstruction.
	
Resolution for iPhone5s is 1920×1080 and for R200 is 640×480 at 60 FPS. Remaining settings are by default.


	


§ LAYOUT BUILDING WITH REASONING





	
	


 §.§ Scene Layout Building With Knowledge

With 3D models of objects and environmental background at hand, we are ready to generate scenes by our reasoning system. A proper scene layout must obey physics laws and human conventions. To make scene physically plausible, we select an off-the-shelf physics engine, Project Chrono <cit.>. However, it is not as direct to make object layout convincing, some commonsense knowledge should be incorporated. To produce a feasible layout, we need to make object pose and location reasonable. For example, a cup always has the pose of “standing up”, but not “lying down”, meanwhile, it is always on the table not the ground. This prior falls in common daily knowledge that can not be achieved by physics reasoning. Therefore, we present how to annotate the pose and location prior in what follows. 

Pose Prior: For each object, we show annotators its 3D model in 3D graphics environment, and ask annotators to draw all its possible poses that she/he can imagine. For each possible pose, the annotator should suggest a probability that this pose would happen. We record the the probability of i^th object in pose k  as D_p[k|i]. We use interpolation to ensure most of pose has correponding probability value.

Location Prior: The same as pose prior, we show annotators the environmental background in 3D graphics environment, thus annotators label all its possible locations that an object may be placed. For each possible location, the annotator should suggest a probability that this object would be placed. We denoted the probability of i^th object in location k  as D_l[k|i]. We use interpolation to make most of location has correponding probability value.

Relationship Prior: Some objects have strong co-occurrence prior. For example, mouse is always close to laptop. Given an object name list, we use language prior to select a set of object pair that have high co-occurrence probability, we call them as occurrence object pair (OOP). For each OOP,  annotator suggests a probability of occurrence of corresponding object pairs. For object i^th and j^th, their probability of occurrence is denoted as D_r[i,j] and a suggested distance (by annotators) is H_r[i,j].

Note that the annotation maybe subjective, but we found that we only need a prior for layout generation guidance. Extensive experiments show that roughly subjective labeling is sufficient for producing satisfactory results. We will report the experiment details in supplementary file. 



 §.§ Layout Generation by Knowledge

We generate layout by considering both physics laws and human conventions. First, we randomly generate a layout and check its physically plausible by Chrono. If it is not physically reasonable, we reject this layout. Second, we check its commonsense plausible by three priors above. In detail, all object pairs are extracted in layout scene. We denote ({c_1(i),c_2(i)}, ({p_1(i),p_2(i)} and ({l_1(i),l_2(i)} as category, pose and 3D location of i^th extracted object pair in scene layout. The likelihood of pose is expressed as 

    K_p[i] = D_p[p_1(i)|c_1(i)] D_p[p_2(i)|c_2(i)].

The likelihood of location for i^th object pair is written as,

    K_l[i] = D_l[l_1(i)|c_1(i)] D_l[l_2(i)|c_2(i)].

The likelihood of occurrence for i^th object pair is presented as

    K_r[i] = 
        G_σ(|l_1(i)- l_2(i)| - D_r[c_1(i),c_2(j)])    if  H_r[i,j] > γ
    1,   otherwise.

where G_σ is a Gaussian function with parameter σ (σ=0.1 in our paper). We compute occurrence prior in the case where the probability H_r[i,j]  is larger than a threshold γ (γ = 0.5 in our paper).   

We denote commonsense likelihood function of a scene layout as 

    K =  ∏_i K_l[i] K_l[i] K_r[i] ∝∑_i log(K_l[i]) + log(K_p[i]) + log(K_r[i])

Thus, we can judge commonsense plausible by K. If K is smaller than a threshold, we reject its corresponding layout. In this way, we can generate large quantities of layouts that is both physics and commonsense plausible.
 


 §.§ Annotation Cost
 We annotate scanned model one by one. So, the annotation cost is linear scale with respect to scanned object model number M. Note that only a small set of object have strong object occurrence assumption (e.g. laptop and mouse). So, the complexity of object occurrence annotation is close to O(M). We carry out experiment to find that 10 seconds is taken to label knowledge for a scanned object model in average, which is minor (one hour for hundreds of objects).  
    


§ DOMAIN ADAPTATION WITH GEOMETRY-GUIDED GAN


Now, we have collection of the rough (RGB) image { I_i^r}^M_i=1∈ℐ^r and its corresponding ground truths, instance segmentation { I_i^s-gt}^M_i=1∈ℐ^s-gt, surface normal { I_i^n-gt}^M_i=1∈ℐ^n-gt, depth image { I_i^d-gt}^M_i=1∈ℐ^d-gt. Besides, the real image captured from targeting environment is denoted as { I_j}^N_j=1. M,N are the sample sizes for rendered samples and real samples. With these data, we can embark on training GeoGAN.
	

	
	


 §.§ Objective Function

GeoGAN has a “GDP" structure, as sketched in Fig. <ref>, which comprises a generator (G), a discriminator (D) and a predictor (P) which serves as a geometry prior guidance. Such structure leads to the design of the objective function, which consists of four loss functions that will be presented in what follows.
	
LSGAN Loss We adopt a least-square generative adversarial objective (LSGAN)<cit.> to help G and D training stable. The LSGAN adversarial loss can be written as

    ℒ_GAN(G,D)=𝔼_y∼ p_data(y)[(D(y)-1)^2 ]+𝔼_x∼ p_data(x)[(D(G(x)))^2],

x and y stand for a sample from the rough image and the real image domain respectively.
	
We denote the output of the generator with parameter Φ_G for i^th rough image as I^*_i, i.e. I^*_i≜ G(I^r_i|Φ_G)
	
Structure Loss A structure loss is introduced to ensure I^*_i maintains the original structure of I^r_i. A Pairwise Mean Square Error (PMSE) loss is imported from <cit.>, expressed as:

    ℒ_PMSE(G)=1/N∑_i(I_i^r-I^*_i)^2-1/N^2(∑_i,j(I_i^r-I^*_i))^2.

	
Reconstruction Loss To ensure the geometry information successfully encoded in the network. We also use ℓ^1 as a reconstruction loss for the geometric images.

    ℒ_rec(G)=||[I^r,I^s,I^n,I^d|Φ_G]_rec,[I^r,I^s,I^n,I^d]||_1

	
Geometry-guided Loss Given an excellent geometer predictor, a high-quality image should be able to produce desirable instance segmentation, depth map and normal map. It is a useful criterion that judges whether I^*_i is qualified or not. An unqualified image (with artifacts, distorted structure) will induce large geometry-guided loss (Geo Loss).  
	
To achieve this goal, we pretrained the predictor with following formula:

    [I^s, I^n, I^d] = P(I |Φ_P),

	
It means given an input image I, with the parameter Φ_P, the predictor can output instance segmentation I^s, normal map I^n and depth map I^d respectively.
In the first few iterations, the predictor is pretrained with the rough image, that is, I=I^r. When the generator starts to produce reasonable results, Φ_P can be updated with I=I^*. And then, the predictor is ready to supervise the generator, and Φ_G will be updated as follow:
	

    ℒ_Geo(G,P) = ||P(I^*_i|Φ_P) , [I^s-gt_i, I^n-gt_i, I^d-gt_i]||^2_2.

In this equation, Φ_P is not updated, and it is a ℓ^2 loss.
	
Overall Objective Function
In sum, our objective function can be expressed as:

    min_Φ_Gmax_Φ_Dλ_1 ℒ_GAN(G,D) +λ_2 ℒ_PMSE(G)+λ_3 ℒ_rec(G)+λ_4 ℒ_Geo(G, P), 
       min_Φ_Pℒ_Geo(G, P).

	
This objective function reveals the iterative nature of our GeoGAN framework, as sketched in Fig. <ref>.




 §.§ Implementation

	
We will dive into details of how to implement and train our model. 
	
Dual Path Generator (G)
Our generator has dual forward data paths (color path and geometry path), which help to integrate the color and geometry information. For color path, input rough image will firstly pass three convolutional layers, and then downsample to 64× 64 and pass 6 resnet blocks <cit.>. After that, output feature maps are upsampled to 256× 256 with bilinear upsampling. During upsampling, color information path will concatenate feature maps from geometry information path.
	
Geometry information are firstly convolutioned to feature maps and concatenated together, resulting in a 3-dimensional 256× 256 feature map before passing to geometry path described below. After the last layer, we split the output of the last layer into three parts, and produce three reconstruction images for three kinds of geometric images.
	
Let 3n64s1ReLU denote 3× 3-Convolution-InstanceNorm-ReLU layer with 64 filters and stride 1. Rk denotes a residual block that contains two 3× 3 convolutional layers with the same number of filters on both. upk denotes a bilinear upsampling layer followed with a 3 × 3 Convolution-InstanceNorm-ReLU layer with k filters and stride 1.
	
The generator architecture is:
	
color path: 7n3s1ReLU-3n64s2ReLU-3n128s2ReLU-R256-R256-R256-R256
-R256-R256-up512-up256
	
geometry path: 7n3s1ReLU-3n64s2ReLU-3n128s2ReLU-R256-R256-R256
-R256-R256-R256-up256-up128
	
Markovian Discriminator (D)
The discriminator is a typical PatchGAN or Markovian discriminator described in <cit.>. We also found 70×70 is a proper receptive field size, hence the architecture is exactly like <cit.>.
	
Geometry Predictor (P)
FCN-like networks<cit.> or UNet<cit.> are good candidates for the geometry predictor. In implementation, we choose a UNet architecture. downk denotes a 3 × 3 Convolution-InstanceNorm-LeakyReLU layer with k filters and stride 2, the slope of leaky ReLU is 0.2. upk denotes a bilinear upsampling layer followed with a 3 × 3 Convolution-InstanceNorm-ReLU layer with k filters and stride 1. k in upk is 2 times larger than that in downk, since a skip connection between corresponding layers. After the last layer, feature maps are split into three parts and convolution to a three dimension layer separately, activated by tanh function.

The predictor architecture is:
down64-down128-down256-down512-down512-down512-up1024-up1024-up1024-up512-up256-up128
	
	
Training Details Adam optimizer<cit.> is used for all three “GDP" components, with batch size of 1. G, D and P are trained from scratch. We firstly trained geometry predictor with 5 epochs to get a good initialization, then began the iterative procedures. In the iterative procedures, learning rate for the first 100 epochs are 0.0002 and linearly decay to zero in the next 100 epochs. All training images are of size 256× 256.
	
All models are trained with λ_1=2, λ_2=5, λ_3=10, λ_4=3 in Eq. <ref>. The generator is trained twice before the discriminator updates once.



§ INSTANCE-60K BUILDING PROCESS

	
As we found no existing Instance segmentation datasets <cit.> can benchmark our task, we have to build a new dataset to benchmark our method. 
	
Instance-60K is an ongoing effort to annotate instance segmentation for scenes can be scanned. Currently it contains three representative scenes, namely supermarket shelf, office desk and tote. These three scenes are chosen since they potentially benefit real-world applications in the future. Supermarket cases are well-suited to self-service supermarkets like Amazon Go[https://www.amazon.com/b?node=16008589011]. Home robots will always meet the scene of an office desk. The tote is in the same setting as Amazon Robotic Challenge. 
	

	
To note that our pipeline does not restrict to these three scenes, technically any scenes can be simulated are suitable to our pipeline.
	
Shelf scene has objects of 30 categories, which items such as soft drinks, biscuits, and tissues. 15 categories for desk scene and tote scene. All are common objects in the corresponding scenes. Objects and scenes are scanned for building SOM dataset as described in section <ref>.
	
For instance-60K dataset, these objects are placed in corresponding scenes and then videotaped by iPhone5s under various viewpoints. We arranged 10 layouts for the shelf, and over 100 layouts for desk and tote. Videos are then sliced into 6000 images in total, 2000 for each scene. The number of labeled instance is 60894, that is the reason why we call it instance-60K. We have average 966 instances per category. This scale is about three times larger than PASCAL VOC <cit.> level (346 instances per category), so it is qualified to benchmark this problem. Again, we found instance segmentation annotation is laborious, it took more than 4000 man-hours on building this dataset. Some representative real images and annotation are shown in Fig. <ref>. As we can see, annotating them is time-consuming.
	


§ EVALUATION


In this section, we evaluate our generated instance segmentation samples quantitatively and qualitatively.
	


 §.§ Evaluation on Instance-60K




	

    
We employed instance segmentation tasks to evaluate on generated samples. To prove that the proposed pipeline generally works, we will report results using Mask R-CNN <cit.>.
	
We train segmentation model on resulting images produced by our GeoGAN. The trained model is denoted as “fake-model”. Likewise, model trained on rough images is denoted as “rough-model”. One question we should ask is that how about “fake-model” compare to models train on real images. To answer this question, we train segmentation models on training set of instance-60K dataset, which is denoted as “real-model”. It is pre-trained on COCO dataset <cit.>. 
	
Training procedures on real images strictly follow the procedures mentioned in <cit.>. We find the learning rate for real images is not workable to rough and GAN generated images, so we lower the learning rate and make it decay earlier.
	
All models are trained with 4500 images, though we can generate endless training sample for “rough-model” and “fake-model”, since “real-model” only can train on 4500 images in the training set of instance-60K dataset. Finally, all models are evaluated on testing set of instance-60K dataset.


	
Experiment results shown in Tab. <ref>. Overall mAP of the rough image is generally low, while “fake-model” significantly outperformed it. Noticeably, it still has a clear gap between “fake-model" results and real one, though the gap has been bridged a lot.
	
Naturally, we would like to know how many refined training images is sufficient to achieve comparable results with “real-model". Hence, we conducted experiments on 15000 GAN generated images, and named model as “fake_plus-model". As we can see from Tab. <ref>, “fake_plus" and “real" is really close. We try to augment more training samples to “fake_plus-model", but, the improvement is marginal. In this way, our synthetic “images + annotation" is comparable with “real image + human annotation" for instance segmentation.
	
The results for real-model may imply that our instance-60K is not that difficult for Mask R-CNN. Extension of the dataset is on-going. However, it is undeniable that the dataset is capable of proving the ability of GeoGAN.
	
In contrast to exhausting annotation using over 1000 human-hours per scene, our pipeline takes 0.7 human-hours per scene. Admittedly, the results suffer from performance loss, but save the whole task 3-order of human-hours.
	


 §.§ Comparison With Other Domain Adaptation Framework

Previous domain adaptation framework focus on different tasks, such as gaze and hand pose estimation <cit.>, object classification and pose estimation <cit.>. To the best of our knowledge, we are the first to propose a GAN-based framework to do instance segmentation. Comparison with each other is indirect. We reproduced the work of <cit.>  and <cit.>. For <cit.>, we substituted the task component with our P. The experiments are conducted on the scenes same in the paper. Results are shown in Fig.<ref> and Tab.<ref>.


	


 §.§ Ablation Study

Ablation study is carried out by removing geometry-guided loss and structure loss separately. We applied Mask R-CNN to train the segmentation models on resulting images from GeoGAN without geometry-guided loss (denoted as “fake_plus,w/o- geo-model") or structure loss (denoted as “fake_plus, w/o-pmse-model"). As we can see, it suffers a significant performance loss when removing geometry-guided loss or structure loss. Besides, we also need to prove the necessity of reasoning system. After removing reasoning system, resulting in unrealistic images and performance loss. Results are shown in Tab. <ref>.




	


§ LIMITATIONS AND FUTURE WORK


If the environmental background changes dynamically, we should scan a large number of environmental backgrounds to cover this variance and take much effort. Due to the limitations of the physics engine, it is hard to handle highly non-rigid objects such as a towel. For another limitation, our method does not consider illumination effects in rendering, since it is much more complicated. GeoGAN that transfers illumination conditions of the real image may partially address this problem, but it is still imperfect. In addition, the size of our benchmark dataset is relatively small in comparison with COCO. Future work is necessary to address these limitations.

splncs




§ APPENDIX



 §.§ Extended Ablative Study

We add experiments to address how each geometry information in the geometry path affects the results. As shown in table <ref>, model name with "w/o" means remove corresponding geometric information, while name without "w/o" means only corresponding geometric information is used for geometry path. As we can see, geometry path have some contributions for the final results, but not as much as geometry loss.







 §.§ Knowledge Acquiring With Many Or One

In the experiment, knowledge (pose prior, location prior and relationship prior) annotated on objects can be acquired with ease. One or two people are more than enough to handle the workload. Nonetheless, annotation in this way seems subjective at the first glance. What if one annotator thinks object A should stands upright in scene B, which the other thinks otherwise. We admit the cognitive bias exists as pointed out by <cit.>. However, to our surprise, experiments show that such bias does not have that significant influence on the domain adaption results (See Fig. <ref>) and segmentation results (See Tab. <ref>).



C2.8cmC1.cmC2.36cmC1.0cmC1.0cm
        	3cmAP     0.5     0.7 
 3*Annotator 1     shelf     fake_plus     66.31     47.25 
 2-5
			    desk     fake_plus     82.07     71.82 
 2-5
			    tote     fake_plus     82.69     76.84 
 2-5
			3*Annotator 2     shelf     fake_plus     65.62     41.48 
 2-5
			    desk     fake_plus     81.52     72.06 
 2-5
			    tote     fake_plus     82.14     75.94 
 2-5
            3*Annotator 3     shelf     fake_plus     62.18     51.61 
 2-5
			    desk     fake_plus     81.91     72.39 
 2-5
			    tote     fake_plus     79.02     64.49 
 2-5
            3*Annotator 4     shelf     fake_plus     66.22     57.03 
 2-5
			    desk     fake_plus     81.08     74.09 
 2-5
			    tote     fake_plus     81.78     70.37 
 2-5
            3*Annotator 5     shelf     fake_plus     63.27     52.53 
 2-5
			    desk     fake_plus     81.54     72.45 
 2-5
			    tote     fake_plus     82.89     73.27 
 2-5
            3*Annotator 6     shelf     fake_plus     66.05     46.90 
 2-5
			    desk     fake_plus     80.17     73.30 
 2-5
			    tote     fake_plus     78.12     63.76 
 2-5
            3*Annotator 7     shelf     fake_plus     65.33     50.15 
 2-5
			    desk     fake_plus     80.08     68.18 
 2-5
			    tote     fake_plus     81.94     70.27 
 2-5
            3*Annotator 8     shelf     fake_plus     66.37     53.67 
 2-5
			    desk     fake_plus     79.69     66.24 
 2-5
			    tote     fake_plus     82.74     64.20 
 2-5
            3*Annotator 9     shelf     fake_plus     62.51     52.48 
 2-5
			    desk     fake_plus     77.32     68.47 
 2-5
			    tote     fake_plus     82.35     70.71 
 2-5
            3*Annotator 10     shelf     fake_plus     64.03     57.93 
 2-5
			    desk     fake_plus     78.77     70.42 
 2-5
			    tote     fake_plus     77.89     69.11 
 2-5
            3*Annotator 11     shelf     fake_plus     66.14     52.13 
 2-5
			    desk     fake_plus     81.02     74.66 
 2-5
			    tote     fake_plus     80.36     68.57 
 2-5
            3*Annotator 12     shelf     fake_plus     68.45     49.90 
 2-5
			    desk     fake_plus     82.62     73.46 
 2-5
			    tote     fake_plus     81.80     68.15 
 2-5
            3*Annotator 13     shelf     fake_plus     66.23     56.17 
 2-5
			    desk     fake_plus     78.42     65.43 
 2-5
			    tote     fake_plus     79.42     68.80 
 2-5
            3*Annotator 14     shelf     fake_plus     64.16     51.81 
 2-5
			    desk     fake_plus     80.10     66.98 
 2-5
			    tote     fake_plus     79.65     65.01 
 2-5
            3*Annotator 15     shelf     fake_plus     66.39     49.60 
 2-5
			    desk     fake_plus     81.40     67.20 
 2-5
			    tote     fake_plus     82.51     71.63 
 2-5
            3*Annotator 16     shelf     fake_plus     66.21     54.94 
 2-5
			    desk     fake_plus     79.91     71.88 
 2-5
			    tote     fake_plus     81.83     72.17 
 2-5
            3*Annotator 17     shelf     fake_plus     65.46     51.92 
 2-5
			    desk     fake_plus     81.45     71.64 
 2-5
			    tote     fake_plus     82.19     69.23 
 2-5
            3*Annotator 18     shelf     fake_plus     61.83     52.75 
 2-5
			    desk     fake_plus     80.59     68.95 
 2-5
			    tote     fake_plus     77.71     63.43 
 2-5
            3*Annotator 19     shelf     fake_plus     69.15     51.08 
 2-5
			    desk     fake_plus     79.25     65.11 
 2-5
			    tote     fake_plus     81.74     67.75 
 2-5
            3*Annotator 20     shelf     fake_plus     66.78     57.10 
 2-5
			    desk     fake_plus     76.81     68.52 
 2-5
			    tote     fake_plus     82.27     69.93 
 Results of instance segmentation tasks where training samples generated by priors of 20 annotators. Segmentation tasks are conducted by Mask R-CNN.
		
        

To make sure the diversity, we summoned 20 people with different ages, genders, nationalities to annotate the objects parallel, and then generated the scene layout accordingly.



The reason why different priors lead to insignificant difference, as we assume, is that despite that different people have different preferences on how to place an object in a given scene, they agree on what pose, location or relationship is possible. There are also extreme cases when one person thinks one form of placement never happens, and others think not (i.e. whether a drink bottle can be placed upside down). But in general, they achieved an agreement unconsciously. Thus, the distribution of layouts generated under diverse preferences are not very different. Another reason might be that current CNN networks are proved to have sufficient capabilities to cope with these minor differences of pose, location and relationship. And at the same time, some data augmentation techniques incorporated default can also facilitate to further reduce the impacts.



 §.§ GAN Refined Results

More refined results are listed in Figure <ref>. And Figure <ref> shows more visualized details of the GeoGAN structure. 



