summaries: In this paper, the authors propose a generative latent variable model, which is named as SPACE, for unsupervised scene decomposition. The proposed model is built on a hierarchical mixture model: one component for generating foreground and the other one for generating the background, while the model for generating background is also a mixture model. The model is trained by standard ELBO with Gumbel-Softmax relaxation of the binary latent variable. To avoid the bounding box separation, the authors propose the boundary loss, which will be combined with the ELBO for training. The authors evaluated the proposed on 3D-room dataset and Atari.  This paper studies the problem of unsupervised scene decomposition with a foreground-background probabilistic modeling framework. Building upon the idea from the previous work on probabilistic scene decomposition [Crawford & Pineau 2019], this paper further decomposes the scene background into a sequence of background segments. In addition, with the proposed framework, scene foreground-background interactions are decoupled into foreground objects and background segments using chain rules. Experimental evaluations have been conducted on several synthetic datasets including the Atari environments and 3D-Rooms. Results demonstrate that the proposed method is superior to the existing baseline methods in both decomposing objects and background segments. The paper proposes SPACE: a generative latent variable models for scene decomposition (foreground / background separation and object bounding box prediction). The authors state the following contributions relative to prior work in this space: 1) ability to simultaneously perform foreground/background segmentation and decompose the foreground into distinct object bounding box predictions, 2) a parallel spatial attention mechanism that improves the speed of the architecture relative to the closest prior work (SPAIR), 3) a demonstration through qualitative results that the approach can segment into foreground objects elements that remain static across observations (e.g. the key in Montezuma's Revenge).
abstractText: The ability to decompose complex multi-object scenes into meaningful abstractions like objects is fundamental to achieve higher-level cognition. Previous approaches for unsupervised object-oriented scene representation learning are either based on spatial-attention or scene-mixture approaches and limited in scalability which is a main obstacle towards modeling real-world scenes. In this paper, we propose a generative latent variable model, called SPACE, that provides a unified probabilistic modeling framework that combines the best of spatial-attention and scene-mixture approaches. SPACE can explicitly provide factorized object representations for foreground objects while also decomposing background segments of complex morphology. Previous models are good at either of these, but not both. SPACE also resolves the scalability problems of previous methods by incorporating parallel spatial-attention and thus is applicable to scenes with a large number of objects without performance degradations. We show through experiments on Atari and 3D-Rooms that SPACE achieves the above properties consistently in comparison to SPAIR, IODINE, and GENESIS. Results of our experiments can be found on our project website: https://sites.google.com/view/space-project-page
authors.name: {Zhixuan Lin
authors.name: Yi-Fu Wu
authors.name: Skand Vishwanath Peri
authors.name: Weihao Sun
authors.name: Gautam Singh
authors.name: Fei Deng
authors.name: Jindong Jiang
authors.name: Sungjin Ahn
references.authors: Jonathan T. Barron
references.title: Continuously differentiable exponential linear units
references.venue: ArXiv,
references.authors: M.G. Bellemare Y. Naddaf J. Veness M. Bowling
references.title: The arcade learning environment: An evaluation platform for general agents
references.venue: Journal of Artificial Intelligence Research,
references.authors: Christopher P Burgess Loic Matthey Nicholas Watters Rishabh Kabra Irina Higgins Matt Botvinick Alexander Lerchner. Monet
references.title: Unsupervised scene decomposition and representation
references.authors: Djork-Arné Clevert Thomas Unterthiner Sepp Hochreiter
references.title: Fast and accurate deep network learning by exponential linear units (elus)
references.venue: In ICLR,
references.authors: Eric Crawford Joelle Pineau
references.title: Spatially invariant unsupervised object detection with convolutional neural networks
references.venue: In Proceedings of AAAI,
references.authors: Eric Crawford Joelle Pineau
references.title: Exploiting spatial invariance for scalable unsupervised object tracking
references.venue: In Proceedings of AAAI,
references.authors: Martin Engelcke Adam R. Kosiorek Oiwi Parker Jones Ingmar Posner
references.title: Genesis: Generative scene inference and sampling with object-centric latent representations, 2019
references.authors: SM Ali Eslami Nicolas Heess Theophane Weber Yuval Tassa David Szepesvari Geoffrey E Hinton
references.title: Attend, infer, repeat: Fast scene understanding with generative models
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Klaus Greff Sjoerd van Steenkiste Jürgen Schmidhuber
references.title: Neural expectation maximization
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Klaus Greff Raphaël Lopez Kaufmann Rishab Kabra Nick Watters Chris Burgess Daniel Zoran Loic Matthey Matthew Botvinick Alexander Lerchner
references.title: Multi-object representation learning with iterative variational inference
references.authors: Sergey Ioffe Christian Szegedy
references.title: Batch normalization: Accelerating deep network training by reducing internal covariate shift
references.venue: In Proceedings of the 32nd International Conference on Machine Learning,
references.authors: Max Jaderberg Karen Simonyan Andrew Zisserman Koray Kavukcuoglu
references.title: Spatial transformer networks. In Advances in neural information processing
references.authors: Eric Jang Shixiang Gu Ben Poole
references.title: Categorical reparameterization with gumbel-softmax
references.venue: arXiv preprint arXiv:1611.01144,
references.authors: Jindong Jiang Sepehr Janghorbani Gerard De Melo Sungjin Ahn
references.title: Scalor: Scalable objectoriented sequential generative models
references.venue: In International Conference on Learning Representations,
references.authors: Diederik P. Kingma Jimmy Ba
references.title: Adam: A method for stochastic optimization
references.authors: Diederik P Kingma Max Welling
references.title: Auto-encoding variational bayes
references.venue: arXiv preprint arXiv:1312.6114,
references.authors: Adam Kosiorek Hyunjik Kim Yee Whye Teh Ingmar Posner
references.title: Sequential attend, infer, repeat: Generative modelling of moving objects
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Volodymyr Mnih Koray Kavukcuoglu David Silver Alex Graves Ioannis Antonoglou Daan Wierstra Martin A. Riedmiller
references.title: Playing atari with deep reinforcement
references.venue: learning. ArXiv,
references.authors: Joseph Redmon Santosh Divvala Ross Girshick Ali Farhadi
references.title: You only look once: Unified, real-time object detection
references.venue: In Proceedings of the IEEE conference on computer vision and pattern recognition,
references.authors: Adam Santoro David Raposo David G Barrett Mateusz Malinowski Razvan Pascanu Peter Battaglia Timothy Lillicrap
references.title: A simple neural network module for relational reasoning
references.venue: In Advances in neural information processing systems,
references.authors: Wenzhe Shi Jose Caballero Ferenc Huszar Johannes Totz Andrew P. Aitken Rob Bishop Daniel Rueckert Zehan Wang
references.title: Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network
references.venue: In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR),
references.authors: Ron Sun
references.title: On variable binding in connectionist networks
references.venue: Connection Science,
references.authors: Tijmen Tieleman Geoffrey Hinton
references.title: Lecture 6.5-rmsprop, neural networks for machine learning
references.venue: Tech Report,
references.authors: Emanuel Todorov Tom Erez Yuval Tassa
references.title: Mujoco: A physics engine for model-based control
references.venue: In 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems,
references.authors: Sjoerd Van Steenkiste Michael Chang Klaus Greff Jürgen Schmidhuber
references.title: Relational neural expectation maximization: Unsupervised discovery of objects and their interactions
references.venue: arXiv preprint arXiv:1802.10353,
references.authors: Nicholas Watters Loı̈c Matthey Christopher P. Burgess Alexander Lerchner
references.title: Spatial broadcast decoder: A simple architecture for learning disentangled representations in vaes
references.authors: Adam (Kingma Ba
references.title: 2014)) optimizer with a learning rate of 1 × 10−3. We use gradient clipping with a maximum norm of 1.0. For quantitative results, SPACE is trained up to 160000 steps. For Atari games, we find it beneficial to set α to be fixed for the first several thousand steps, and vary the actual value and number of steps for different games
references.authors: E DATASET DETAILS Atari
references.title: For each game, we sample 60,000 random images from a pretrained agent (Wu et al., 2016). We split the images into 50,000 for the training set, 5,000 for the validation set, and 5,000 for the testing set. Each image is preprocessed into a size of 128 × 128 pixels with BGR color channels. We present the results for the following games: Space Invaders, Air Raid, River Raid, Montezuma’s
sections.heading: 1 INTRODUCTION
sections.text: One of the unsolved key challenges in machine learning is unsupervised learning of structured representation for a visual scene containing many objects with occlusion, partial observability, and complex background. When properly decomposed into meaningful abstract entities such as objects and spaces, this structured representation brings many advantages of abstract (symbolic) representation to areas where contemporary deep learning approaches with a global continuous vector representation of a scene have not been successful. For example, a structured representation may improve sample efficiency for downstream tasks such as a deep reinforcement learning agent (Mnih et al., 2013). It may also enable visual variable binding (Sun, 1992) for reasoning and causal inference over the relationships between the objects and agents in a scene. Structured representations also provide composability and transferability for better generalization.
  Recent approaches to this problem of unsupervised object-oriented scene representation can be categorized into two types of models: scene-mixture models and spatial-attention models. In scenemixture models (Greff et al., 2017; 2019; Burgess et al., 2019; Engelcke et al., 2019), a visual scene is explained by a mixture of a finite number of component images. This type of representation provides flexible segmentation maps that can handle objects and background segments of complex morphology. However, since each component corresponds to a full-scale image, important physical features of objects like position and scale are only implicitly encoded in the scale of a full image and further disentanglement is required to extract these useful features. Also, since it does not explicitly reflect useful inductive biases like the locality of an object in the Gestalt principles (Koffka, 2013),
  ∗Visiting Student at Rutgers University. Authors named inside {} equally contributed. Correspondance to zxlin.cs@gmail.com and sjn.ahn@gmail.com.
  the resulting component representation is not necessarily a representation of a local area. Moreover, to obtain a complete scene, a component needs to refer to other components, and thus inference is inherently performed sequentially, resulting in limitations in scaling to scenes with many objects.
  In contrast, spatial-attention models (Eslami et al., 2016; Crawford & Pineau, 2019) can explicitly obtain the fully disentangled geometric representation of objects such as position and scale. Such features are grounded on the semantics of physics and should be useful in many ways (e.g., sample efficiency, interpretability, geometric reasoning and inference, transferability). However, these models cannot represent complex objects and background segments that have too flexible morphology to be captured by spatial attention (i.e. based on rectangular bounding boxes). Similar to scene-mixture models, previous models in this class show scalability issues as objects are processed sequentially.
  In this paper, we propose a method, called Spatially Parallel Attention and Component Extraction (SPACE), that combines the best of both approaches. SPACE learns to process foreground objects, which can be captured efficiently by bounding boxes, by using parallel spatial-attention while decomposing the remaining area that includes both morphologically complex objects and background segments by using component mixtures. Thus, SPACE provides an object-wise disentangled representation of foreground objects along with explicit properties like position and scale per object while also providing decomposed representations of complex background components. Furthermore, by fully parallelizing the foreground object processing, we resolve the scalability issue of existing spatial attention methods. In experiments on 3D-room scenes and Atari game scenes, we quantitatively and qualitatively compare the representation of SPACE to other models and show that SPACE combines the benefits of both approaches in addition to significant speed-ups due to the parallel foreground processing.
  The contributions of the paper are as follows. First, we introduce a model that unifies the benefits of spatial-attention and scene-mixture approaches in a principled framework of probabilistic latent variable modeling. Second, we introduce a spatially parallel multi-object processing module and demonstrate that it can significantly mitigate the scalability problems of previous methods. Lastly, we provide an extensive comparison with previous models where we illustrate the capabilities and limitations of each method.
sections.heading: 2 THE PROPOSED MODEL: SPACE
sections.text: In this section, we describe our proposed model, Spatially Parallel Attention and Component Extraction (SPACE). The main idea of SPACE, presented in Figure 1, is to propose a unified probabilistic generative model that combines the benefits of the spatial-attention and scene-mixture models.
sections.heading: 2.1 GENERATIVE PROCESS
sections.text: SPACE assumes that a scene x is decomposed into two independent latents: foreground zfg and background zbg. The foreground is further decomposed into a set of independent foreground objects zfg = {zfgi } and the background is also decomposed further into a sequence of background segments zbg = zbg1:K . While our choice of modeling the foreground and background independently worked well empirically, for better generation, it may also be possible to condition one on the other. The image distributions of the foreground objects and the background components are combined together with a pixel-wise mixture model to produce the complete image distribution:
  p(x|zfg, zbg) = αp(x|zfg)︸ ︷︷ ︸ Foreground +(1− α) K∑ k=1 πk p(x|zbgk )︸ ︷︷ ︸ Background . (1)
  Here, the foreground mixing probability α is computed as α = fα(zfg). This way, the foreground is given precedence in assigning its own mixing weight and the remaining is apportioned to the background. The mixing weight assigned to the background is further sub-divided among the K background components. These weights are computed as πk = fπk(z bg 1:k) and ∑ k πk = 1. With these notations, the complete generative model can be described as follows.
  p(x) = ∫∫ p(x|zfg, zbg)p(zbg)p(zfg)dzfgdzbg (2)
  We now describe the foreground and background models in more detail.
  Foreground. SPACE implements zfg as a structured latent. In this structure, an image is treated as if it were divided into H ×W cells and each cell is tasked with modeling at most one (nearby) object in the scene. This type of structuring has been used in (Redmon et al., 2016; Santoro et al., 2017; Crawford & Pineau, 2019). Similar to SPAIR, in order to model an object, each cell i is associated with a set of latents (zpresi , z where i , z depth i , z what i ). In this notation, z
  pres is a binary random variable denoting if the cell models any object or not, zwhere denotes the size of the object and its location relative to the cell, zdepth denotes the depth of the object to resolve occlusions and zwhat models the object appearance and its mask. These latents may then be used to compute the foreground image component p(x|zfg) which is modeled as a Gaussian distribution N (µfg, σ2fg). In practice, we treat σ2fg as a hyperparameter and decode only the mean image µ
  fg. In this process, SPACE reconstructs the objects associated to each cell having zpresi = 1. For each such cell, the model uses the z what i to decode the object glimpse and its mask and the glimpse is then positioned on a full-resolution canvas using zwherei via the Spatial Transformer (Jaderberg et al., 2015). Using the object masks and z depth i , all the foreground objects are combined into a single foreground mean-image µfg and the foreground mask α (See Appendix D for more details).
  SPACE imposes a prior distribution on these latents as follows:
  p(zfg) = H×W∏ i=1 p(zpresi ) ( p(zwherei )p(z depth i )p(z what i ) )zpresi (3)
  Here, only zpresi is modeled using a Bernoulli distribution while the remaining are modeled as Gaussian.
  Background. To model the background, SPACE implements zbgk , similar to GENESIS, as (z m k , z c k) where zmk models the mixing probabilities πk of the components and z c k models the RGB distribution p(x|zbgk ) of the kth background component as a Gaussian N (µ bg i , σ 2 bg). The following prior is
  imposed upon these latents.
  p(zbg) = K∏ k=1 p(zck|zmk )p(zmk |zm<k) (4)
sections.heading: 2.2 INFERENCE AND TRAINING
sections.text: Since we cannot analytically evaluate the integrals in equation 2 due to the continuous latents zfg and zbg1:K , we train the model using a variational approximation. The true posterior on these variables is approximated as follows.
  p(zbg1:K , z fg|x) ≈ q(zfg|x) K∏ k=1 q(zbgk |z bg <k,x) (5)
  This is used to derive the following ELBO to train the model using the reparameterization trick and SGD (Kingma & Welling, 2013).
  L(x) = Eq(zfg,zbg|x) [ log p(x|zfg, zbg)− K∑ k=1 DKL(q(z bg k |z bg <k,x) ‖ p(z bg k |z bg <k))
  − H×W∑ i=1 DKL(q(z fg i |x) ‖ p(zfgi )) ] (6) See Appendix B for the detailed decomposition of the ELBO and the related details.
  Parallel Inference of Cell Latents. SPACE uses mean-field approximation when inferring the cell latents, so zfgi = (z pres i , z where i , z depth i , z what i ) for each cell does not depend on other cells.
  q(zfg|x) = H×W∏ i=1 q(zpresi |x) ( q(zwherei |x)q(zdepthi |x)q(zwhati |zwherei ,x) )zpresi (7)
  As shown in Figure 1, this allows each cell to act as an independent object detector, spatially attending to its own local region in parallel. This is in contrast to inference in SPAIR, where each cell’s latents auto-regressively depend on some or all of the previously traversed cells in a row-major order i.e., q(zfg|x) = ∏HWi=1 q(zfgi |zfg<i,x). However, this method becomes prohibitively expensive in practice as the number of objects increases. While Crawford & Pineau (2019) claim that these lateral connections are crucial for performance since they model dependencies between objects and thus prevent duplicate detections, we challenge this assertion by observing that 1) due to the bottom-up encoding conditioning on the input image, each cell should have information about its nearby area without explicitly communicating with other cells, and 2) in (physical) spatial space, two objects cannot exist at the same position. Thus, the relation and interference between objects should not be severe and the mean-field approximation is a good choice in our model. In our experiments, we verify empirically that this is indeed the case and observe that SPACE shows comparable detection performance to SPAIR while having significant gains in training speeds and efficiently scaling to scenes with many objects.
  Preventing Box-Splitting. If the prior for the bounding box size is set to be too small, then the model could split a large object by multiple bounding boxes and when the size prior is too large, the model may not capture small objects in the scene, resulting in a trade-off between the prior values of the bounding box size. To alleviate this problem, we found it sometimes helpful to introduce an auxiliary loss which we call the boundary loss. In the boundary loss, we construct a boundary of thickness b pixels along the borders of each glimpse. Then, we restrict an object to be inside this boundary and penalize the model if an object’s mask overlaps with the boundary area. Thus, the model is penalized if it tries to split a large object by multiple smaller bounding boxes. A detailed implementation of the boundary loss is mentioned in Appendix C.
sections.heading: 3 RELATED WORKS
sections.text: Our proposed model is inspired by several recent works in unsupervised object-oriented scene decomposition. The Attend-Infer-Repeat (AIR) (Eslami et al., 2016) framework uses a recurrent neural network to attend to different objects in a scene and each object is sequentially processed one
  at a time. An object-oriented latent representation is prescribed that consists of ‘what’, ‘where’, and ‘presence’ variables. The ‘what’ variable stores the appearance information of the object, the ‘where’ variable represents the location of the object in the image, and the ‘presence’ variable controls how many steps the recurrent network runs and acts as an interruption variable when the model decides that all objects have been processed.
  Since the number of steps AIR runs scales with the number of objects it attends to, it does not scale well to images with many objects. Spatially Invariant Attend, Infer, Repeat (SPAIR) (Crawford & Pineau, 2019) attempts to address this issue by replacing the recurrent network with a convolutional network. Similar to YOLO (Redmon et al., 2016), the locations of objects are specified relative to local grid cells rather than the entire image, which allow for spatially invariant computations. In the encoder network, a convolutional neural network is first used to map the image to a feature volume with dimensions equal to a pre-specified grid size. Then, each cell of the grid is processed sequentially to produce objects. This is done sequentially because the processing of each cell takes as input feature vectors and sampled objects of nearby cells that have already been processed. SPAIR therefore scales with the pre-defined grid size which also represents the maximum number of objects that can be detected. Our model uses an approach similar to SPAIR to detect foreground objects, but importantly we make the foreground object processing fully parallel to scale to large number of objects without performance degradation. Works based on Neural Expectation Maximization (Van Steenkiste et al., 2018; Greff et al., 2017) do achieve unsupervised object detection but do not explicitly model the presence, appearance, and location of objects. These methods also suffer from the problem of scaling to images with a large number of objects. In a related line of research, AIR has also recently been extended to track objects in a sequence of images (Kosiorek et al., 2018; Crawford & Pineau, 2020; Jiang et al., 2020).
  For unsupervised scene-mixture models, several recent models have shown promising results. MONet (Burgess et al., 2019) leverages a deterministic recurrent attention network that outputs pixel-wise masks for the scene components. A variational autoencoder (VAE) (Kingma & Welling, 2013) is then used to model each component. IODINE (Greff et al., 2019) approaches the problem from a spatial mixture model perspective and uses amortized iterative refinement of latent object representations within the variational framework. GENESIS (Engelcke et al., 2019) also uses a spatial mixture model which is encoded by component-wise latent variables. Relationships between these components are captured with an autoregressive prior, allowing complete images to be modeled by a collection of components.
sections.heading: 4 EVALUATION
sections.text: We evaluate our model on two datasets: 1) an Atari (Bellemare et al., 2013) dataset that consists of random images from a pretrained agent playing the games, and 2) a generated 3D-room dataset that consists of images of a walled enclosure with a random number of objects on the floor. In order to test the scalability of our model, we use both a small 3D-room dataset that has 4-8 objects and a large 3D-room dataset that has 18-24 objects. Each image is taken from a random camera angle and the colors of the objects, walls, floor, and sky are also chosen at random. Additional details of the datasets can be found in the Appendix E.
  Baselines. We compare our model against two scene-mixture models (IODINE and GENESIS) and one spatial-attention model (SPAIR). Since SPAIR does not have an explicit background component, we add an additional VAE for processing the background. Additionally, we test against two implementations of SPAIR: one where we train on the entire image using a 16×16 grid and another where we train on random 32 × 32 pixel patches using a 4 × 4 grid. We denote the former model as SPAIR and the latter as SPAIR-P. SPAIR-P is consistent with the SPAIR’s alternative training regime on Space Invaders demonstrated in Crawford & Pineau (2019) to address the slow training of SPAIR on the full grid size because of its sequential inference. Lastly, for performance reasons, unlike the original SPAIR implementation, we use parallel processing for rendering the objects from their respective latents onto the canvas1 for both SPAIR and SPAIR-P. Thus, because of these improvements, our SPAIR implementation can be seen as a stronger baseline than the original SPAIR. More details of the baselines are given in Appendix D.
  1It is important to note that the worst case complexity of rendering is O(hw ×HW ), (where (h,w) is the image size) which is extremely time consuming when we have large image size and/or large number of objects.
sections.heading: 4.1 QUALITATIVE COMPARISON OF INFERRED REPRESENTATIONS
sections.text: In this section, we provide a qualitative analysis of the generated representations of the different models. For each model, we performed a hyperparameter search and present the results for the best settings of hyperparameters for each environment. Figure 2 shows sample scene decompositions of our baselines from the 3D-Room dataset and Figure 3 shows the results on Atari. Note that SPAIR does not use component masks and IODINE and GENESIS do not separate foreground from background, hence the corresponding cells are left empty. Additionally, we only show a few representative components for IODINE and GENESIS since we ran those experiments with larger K than can be displayed. More qualitative results of SPACE can be found in Appendix A.
  IODINE & GENESIS. In the 3D-Room environment, IODINE is able to segment the objects and the background into separate components. However, it occasionally does not properly decompose objects (in the Large 3D-room results, the orange sphere on the right is not reconstructed) and may generate blurry objects. GENESIS is able to segment the background walls, floor, and sky into multiple components. It is able to capture blurry foreground objects in the Small 3D-Room, but is not able to cleanly capture foreground objects with the larger number of objects in the Large 3DRoom. In Atari, both IODINE and GENESIS fail to capture the foreground properly or try to encode all objects in a single component. We believe this is because the objects in Atari games are smaller, less regular and lack the obvious latent factors like color and shape as in the 3D dataset, and thus detection-based approaches are more appropriate in this case.
  SPAIR & SPAIR-P. SPAIR is able to detect tight bounding boxes in both 3D-Rooms and the two Atari games. SPAIR-P, however, often fails to detect the foreground objects in proper bounding boxes, frequently uses multiple bounding boxes for one object and redundantly detects parts of the background as foreground objects. This is a limitation of the patch training as the receptive field of
  each patch is limited to a 32× 32 glimpse, prohibiting it from detecting larger objects and making it difficult to distinguish the background from foreground. These two properties are illustrated well in Space Invaders, where it is able to detect the small aliens, but it detects the long piece of background ground on the bottom of the image as foreground objects.
  SPACE. In both 3D-Room, SPACE is able to accurately detect almost all objects despite the large variations in object positions, colors, and shapes, while producing a clean segmentation of the background walls, ground, and sky. This is in contrast to the SPAIR model, while being able to provide similar foreground detection quality, encodes the whole background into a single component, which makes the representation less disentangled. Notably, in River Raid where the background is constantly changing, SPACE is able to perfectly segment the blue river while accurately detecting all foreground objects, while SPAIR often cannot properly separate foreground and background.
  Joint Training. Figure 4 shows the results of training SPACE jointly across 10 Atari games. We see that even in this setting, SPACE is able to correctly detect foreground objects and cleanly segment the background.
  Foreground vs Background. Typically, foreground is the dynamic local part of the scene that we are interested in, and background is the relatively static and global part. This definition, though intuitive, is ambiguous. Some objects, such as the red shields in Space Invaders and the key in Montezuma’s Revenge (Figure 6) are static but important to detect as foreground objects. We found that SPACE tends to detect these as foreground objects while SPAIR considers it background. Similar behavior is observed in Atlantis (Figure 4), where SPACE tends to detect some foreground objects from the middle base that is above the water. One reason for this behavior is because we limit the capacity of the background module by using a spatial broadcast decoder (Watters et al., 2019) which is much weaker when compared to other decoders like sub-pixel convolutional nets (Shi et al. (2016)). This would favor modeling static objects as foreground rather than background.
sections.heading: 4.2 QUANTITATIVE COMPARISON
sections.text: In this section we compare SPACE with the baselines in several quantitative metrics2. We first note that each of the baseline models has a different decomposition capacity (C), which we define as the capability of the model to decompose the scene into its semantic constituents such as the foreground objects and the background segmented components. For SPACE, the decomposition capacity is equal to the number of grid cells H × W (which is the maximum number of foreground objects that can be detected) plus the number of background components K. For SPAIR, the decomposition capacity is equal to the number of grid cells H × W plus 1 for background. For IODINE and GENESIS, it is equal to the number of components K.
  For each experiment, we compare the metrics for each model with similar decomposition capacities. This way, each model can decompose the image into the same number of components. For a setting in SPACE with a grid size of H ×W with KSPACE components, the equivalent settings in IODINE and GENESIS would be with C = (H ×W ) +KSPACE. The equivalent setting in SPAIR would be a grid size of H ×W .
  Gradient Step Latency. The leftmost chart of Figure 5 shows the time taken to complete one gradient step (forward and backward propagation) for different decomposition capacities for each of the models. We see that SPAIR’s latency grows with the number of cells because of the sequential
  2As previously shown, SPAIR-P does not work well in many of our environments, so we do not include it in these quantitative experiments. As in the qualitative section, we use the SPAIR implementation with sequential inference and parallel rendering in order to speed up the experiments.
  Published as a conference paper at ICLR 2020
  4× 4 8× 8 16× 16 24× 242 −2
  2−1
  20
  21
  22
  23
  24
  Number of Cells (H ×W )
  G ra di en t S te p L at en cy
  (i n s)
  Training Latency Plot
  2 4 6
  ·104
  200
  400
  600
  800
  1,000
  1,200
  Wall Clock Time (in s)
  R ec on st ru ct io n P ix el M S E
  Convergence 3D Room (4× 4)
  2 4 6
  ·104
  200
  600
  1,000
  1,400
  1,800
  2,200
  2,600
  3,000
  Wall Clock Time (in s)
  Convergence 3D Room (8× 8)
  2 4 6
  ·104
  200
  400
  600
  800
  1,000
  1,200
  Wall Clock Time (in s)
  Convergence 3D Room (16× 16)
  4× 4 8× 8 16× 16 24× 24
  2−1
  2
  21
  22
  23
  24
  Number of Cells (H ×W ) G ra di en t S te p L at en cy
  (i n s)
sections.heading: Training Latency Plot
sections.text: SPACE (C = H ×W + 5) SPAIR (C = H ×W + 1) IODINE (C = H ×W + 5) GENESIS (C = H ×W + 5)
  Figure 5: Quantitative performance comparison between SPACE , SPAIR, IODINE and GENESIS in terms of batch-processing time during training, training convergence and converged pixel MSE. Convergence plots showing pixel-MSE were computed on a held-out set during training.
  nature of its latent inference step. Similarly GENESIS and IODINE’s latency grows with the number of components K because each component is processed sequentially in both the models. IODINE is the slowest overall with its computationally expensive iterative inference procedure. Furthermore, both IODINE and GENESIS require storing data for each of the K components, so we were unable to run our experiments on 256 components or greater before running out of memory on our 22GB GPU. On the other hand, SPACE employs parallel processing for the foreground which makes it scalable to large grid sizes, allowing it to detect a large number of foreground objects without any significant performance degradation. Although this data was collected for gradient step latency, this comparison implies a similar relationship exists with inference time which is a main component in the gradient step.
  Time for Convergence. The remaining three charts in Figure 5 show the amount of time each model takes to converge in different experimental settings. We use the pixel-wise mean squared error (MSE) as a measurement of how close a model is to convergence. In all settings, SPAIR and SPACE converge much faster than IODINE and GENESIS. In the 4 × 4 and 8 × 8 setting, SPAIR and SPACE converge equally fast. But as we scale up to 16×16, SPAIR becomes much slower than SPACE .
  Average Precision and Error Rate. In order to assess the quality of our bounding box predictions, we measure the Average Precision and Object Count Error Rate of our predictions. Our results are shown in Table 1. We only report these metrics for 3D-Room since we have access to the ground truth bounding boxes for each of the objects in the scene. Both models have very similar average precision and error rate. Despite being parallel in its inference, SPACE has a comparable count error rate to that of SPAIR.
  From our experiments, we can assert that SPACE can produce similar quality bounding boxes as SPAIR while 1) having orders of magnitude faster inference and gradient step time, 2) scaling to a large number of objects without significant performance degradation, and 3) providing complex background segmentation.
sections.heading: 5 CONCLUSION
sections.text: We propose SPACE, a unified probabilistic model that combines the benefits of the object representation models based on spatial attention and the scene decomposition models based on component mixture. SPACE can explicitly provide factorized object representation per foreground object while also decomposing complex background segments. SPACE also achieves a significant speed-up and thus makes the model applicable to scenes with a much larger number of objects without performance degradation. Besides, the detected objects in SPACE are also more intuitive than other methods. We show the above properties of SPACE on Atari and 3D-Rooms. Interesting future directions are to replace the sequential processing of background by a parallel one and to improve the model for natural images. Our next plan is to apply SPACE for object-oriented model-based reinforcement learning.
sections.heading: ACKNOWLEDGMENTS
sections.text: SA thanks to Kakao Brain and Center for Super Intelligence (CSI) for their support. ZL thanks to the ZJU-3DV group for its support. The authors would also like to thank Chang Chen and Zhuo Zhi for their insightful discussions and help in generating the 3D-Room dataset.
sections.heading: A ADDITIONAL RESULTS OF SPACE
sections.heading: B ELBO DERIVATIONS
sections.text: In this section, we derive the ELBO for the log-likelihood log p(x).
  log p(x) ≥ Eq(zfg,zbg|x) [ p(x|zfg, zbg) ] −DKL(q(zfg|x) ‖ p(zfg))−DKL(q(zbg|x) ‖ p(zbg))
  = Eq(zfg,zbg|x) [ p(x|zfg, zbg)−DKL(q(zfg|x) ‖ p(zfg))−DKL(q(zbg|x) ‖ p(zbg)) ] = Eq(zfg,zbg|x) [ p(x|zfg, zbg)−
  K∑ k=1 DKL(q(z bg k |x, z bg <k) ‖ p(zbg|z bg <k))−
  H×W∑ i=1 DKL(q(z fg i |x) ‖ p(zfgi )) ] KL Divergence for the Foreground Latents Under the SPACE ’s approximate inference, the DKL(q(z fg i |x) ‖ p(zfgi )) inside the expectation can be evaluated as follows.
  Eq(zfg,zbg|x) [ DKL(q(z fg i |x) ‖ p(zfgi )) ] = Eq(zfg,zbg|x) [ DKL(q(z pres i |x) ‖ p(zpresi )) + Eq(zpresi |x)z pres i [ DKL(q(z where i |x) ‖ p(zwherei ))
  + Eq(zwherei |x)DKL(q(z what i |x, zwherei ) ‖ p(zwhati )) +DKL(q(zdepthi |x) ‖ p(zdepthi ))
  ]]
  = Eq(zfg,zbg|x) [ DKL(q(z pres i |x) ‖ p(zpresi )) + zpresi [ DKL(q(z where i |x) ‖ p(zwherei ))
  +DKL(q(z what i |x, zwherei ) ‖ p(zwhati )) +DKL(q(zdepthi |x) ‖ p(zdepthi )) ]] KL Divergence for the Background Latents Under our GENESIS-like modeling of inference for the background latents, the KL term inside the expectation for the background is evaluated as follows.
  Eq(zfg,zbg|x) [ DKL(q(z bg k |z bg <k,x) ‖ p(z bg k |z bg <k)) ] = Eq(zfg,zbg|x) [ DKL(q(z m k |zm<k,x) ‖ p(zmk |zm<k)) + Eq(zmk |zm<k,x)DKL(q(z c k|zmk ,x) ‖ p(zck|zmk ))
  ] = Eq(zfg,zbg|x) [DKL(q(zmk |zm<k,x) ‖ p(zmk |zm<k)) +DKL(q(zck|zmk ,x) ‖ p(zck|zmk ))]
  Relaxed treatment of zpres In our implementation, we model the Bernoulli random variable zpresi using the Gumbel-Softmax distribution (Jang et al., 2016). We use the relaxed value of zpres in the entire training and use hard samples only for the visualizations.
sections.heading: C BOUNDARY LOSS
sections.text: In this section we elaborate on the implementation details of the boundary loss. We construct a kernel of the size of the glimpse, gs × gs (we use gs = 32) with a boundary gap of b = 6 having negative uniform weights inside the boundary and a zero weight in the region between the boundary and the glimpse. This ensures that the model is penalized when the object is outside the boundary. This kernel is first mapped onto the global space via STN Jaderberg et al. (2015) to obtain the global kernel. This is then multiplied element-wise with global object mask α to obtain the boundary loss map. The objective of the loss is to minimize the mean of this boundary loss map. In addition to the ELBO, this loss is also back-propagated via RMSProp (Tieleman & Hinton. (2012)). This loss, due to the boundary constraint, enforces the bounding boxes to be less tight and results in lower average precision, so we disable the loss and optimize only the ELBO after the model has converged well.
  D IMPLEMENTATION DETAILS
sections.heading: D.1 ALGORITHMS
sections.text: Algorithm 1 and Algorithm 3 present SPACE’s inference for foreground and background. Algorithm 2 describe the details of rescalei function in Algorithm 1 that transforms local shift zshifti to global shift ẑshifti .Algorithm 4 show the details of the generation process of the background module. For foreground generation, we simply sample the latent variables from the priors instead of conditioning on the input. Note that, for convenience the algorithms for the foreground module and background module are presented with for loops, but inference for all variables of the foreground module are implemented as parallel convolution operations and most operations of the background module (barring the LSTM module) are parallel as well.
  Algorithm 1: Foreground Inference Input: image x Output: foreground mask α, appearance µfg, grid height H and width W êimg = ImageEncoderFg(x) rimg = ResidualConnection(êimg) eimg = ResidualEncoder([êimg, rimg]) for i← 1 to HW do
  /* The following is performed in parallel */ ρi = ZPresNet(e img i ) [µdepthi ,σ depth i ] = ZDepthNet(e img i ) [µscalei ,σ scale i ] = ZScaleNet(e img i ) [µshifti ,σ shift i ] = ZShiftNet(e img i ) zpresi ∼ Bern(ρi) zdepthi ∼ N (µdepthi ,σdepth,2i ) zscalei ∼ N (µscalei ,σscale,2i ) zshifti ∼ N (µshifti ,σshift,2i ) /* Rescale local shift to global shift as in SPAIR */ ẑscalei = σ(z scale i ) ẑshifti = rescalei(z shift i ) zwherei = [ẑ scale i , ẑ shift i ] /* Extract glimpses with a Spatial Transformer */ x̂i = ST(x, zwherei ) [µwhati ,σ what i ] =GlimpseEncoder(x̂i) zwhati ∼ N (µwhati ,σwhat,2i ) /* Foreground mask and appearance of glimpse size */ [αatti ,o att i ] = GlimpseDecoder(z what i ) α̂atti = α att i zpresi yatti = α̂ att i oatti /* Transform both to canvas size */ α̂atti = ST −1(α̂atti , z where i ) yatti = ST −1(yatti , z where i ) end /* Compute weights for each component */ w = softmax(−100 · σ(zdepth) α̂att) /* Compute global weighted mask and foreground appearance */ α = sum(w α̂att) µfg = sum(w yatt)
  Algorithm 2: Rescale zshifti Input: Shift latent zshifti , cell index i, grid height H and width W Output: Rescaled shift latent ẑshifti /* Get width and heigh index of cell i */ [k, j] = [i%H, i÷H] /* Center of this cell */ ci = [k + 0.5, j + 0.5] /* Get global shift */ z̃shifti = ci + tanh(z shift i ) /* Normalize to range (-1, 1) */ ẑshifti = 2 · z̃shifti /[W,H]− 1
  Algorithm 3: Background Inference Input: image x, initial LSTM states h0, c0, initial dummy mask zm0 Output: background masks πk, appearance µbgk , for k = 1, . . . ,K eimg = ImageEncoderBg(x) for k ← 1 to K do
  hk, ck = LSTM([z m k−1, e img], ck−1,hk−1) [µmk ,σ m k ] = PredictMask(hk) zm ∼ N (µmk ,σm,2k ) /* Actually decoded in parallel */ π̂k = MaskDecoder(z m k ) /* Stick breaking process as described in GENESIS */ πk = SBP(π̂1:k) [µck,σ c k] = CompEncoder([πk,x]) zc ∼ N (µck,σc,2k ) µbgk =CompDecoder(z c k)
  end
  Algorithm 4: Background Generation Input: initial LSTM states h0, c0, initial dummy mask zm0 Output: background masks πk, appearance µbgk , for k = 1, . . . ,K for k ← 1 to K do
  hk, ck = LSTM(z m k−1, ck−1,hk−1) [µmk ,σ m k ] = PredictMaskPrior(hk) zm ∼ N (µmk ,σm,2k ) /* Actually decoded in parallel */ π̂k = MaskDecoder(z m k ) /* Stick breaking process as described in GENESIS */ πk = SBP(π̂1:k) [µck,σ c k] = PredictComp(z m k ) zck ∼ N (µck,σc,2k ) µbgk =CompDecoder(z c k)
  end
sections.heading: D.2 TRAINING REGIME AND HYPERPARAMETERS
sections.text: For all experiments we use an image size of 128 × 128 and a batch size of 12 to 16 depending on memory usage. For the foreground module, we use the RMSProp (Tieleman & Hinton. (2012)) optimizer with a learning rate of 1 × 10−5 except for Figure 5, for which we use a learning rate of 1×10−4 as SPAIR. For the background module, we use the Adam (Kingma & Ba (2014)) optimizer with a learning rate of 1 × 10−3. We use gradient clipping with a maximum norm of 1.0. For quantitative results, SPACE is trained up to 160000 steps. For Atari games, we find it beneficial to set α to be fixed for the first several thousand steps, and vary the actual value and number of steps for different games. This allows both the foreground as well as the background module to learn in the early stage of training.
  We list out our hyperparameters for 3D large dataset and joint training for 10 static Atari games below. Hyperparameters for other experiments are similar, but are finetuned for each dataset individually. In the tables below, (m→ n) : (p→ q) denotes annealing the hyperparameter value from m to n, starting from step p until step q.
  3D Room Large Name Symbol Value
  zpres prior prob ρ (0.1→ 0.01) : (4000→ 10000) zscale prior mean µscale (−1.0→ −2.0) : (10000→ 20000) zscale prior stdev σscale 0.1 zshift prior µshift,σshift N (0, I) zdepth prior µdepth,σdepth N (0, I) zwhat prior µwhat,σwhat N (0, I) foreground stdev σfg 0.15 background stdev σbg 0.15 component number K 5 gumbel-softmax temperature τ (2.5→ 0.5) : (0→ 20000) #steps to fix α N/A fixed α value N/A boundary loss Yes turn off boundary loss at step 100000
  Joint Training on 10 Atari Games Name Symbol Value
  zpres prior prob ρ 1× 10−10 zscale prior mean µscale −2.5 zscale prior stdev σscale 0.1 zshift prior µshift,σshift N (0, I) zdepth prior µdepth,σdepth N (0, I) zwhat prior µwhat,σwhat N (0, I) foreground stdev σfg 0.20 background stdev σbg 0.10 component number K 3 gumbel-softmax temperature τ (2.5→ 1.0) : (0→ 10000) #steps to fix α 4000 fixed α value 0.1 boundary loss No turn off boundary loss at step N/A
sections.heading: D.3 MODEL ARCHITECTURE
sections.text: Here we describe the architecture of our 16 × 16 SPACE model. The model for 8 × 8 grid cells is the same but with a stride-2 convolution for the last layer of the image encoder.
  All modules that output distribution parameters are implemented with either one single fully connected layer or convolution layer, with the appropriate output size. Image encoders are fully convolutional networks that output a feature map of shape H ×W , and the glimpse encoder comprises of convolutional layers followed by a final linear layer that computes the parameters of a Gaussian distribution. For the glimpse decoder of the foreground module and the mask decoder of the background module we use the sub-pixel convolution layer (Shi et al. (2016)). On the lines of GENESIS (Engelcke et al. (2019)) and IODINE (Greff et al. (2019)), we adopt Spatial Broadcast Network (Watters et al. (2019)) as the component decoder to decode zck into background components.
  For inference and generation of the background module, the dependence of zmk on z m 1:k−1 is implemented with LSTMs, with hidden sizes of 64. Dependence of zck on z m k is implemented with a MLP with two hidden layers with 64 units per layer. We apply softplus when computing standard deviations for all Gaussian distributions, and apply sigmoid when computing reconstruction and masks. We use either Group Normalization (GN) (Wu & He (2018)) and CELU (Barron (2017)) or Batch Normalization (BN) (Ioffe & Szegedy (2015)) and ELU (Clevert et al. (2016)) depending on the module type.
  The rest of the architecture details are described below. In the following tables, ConvSub(n) denotes a sub-pixel convolution layer implemented as a stride-1 convolution and a PyTorch PixelShuffle(n) layer, and GN(n) denotes Group Normalization with n groups.
  Name Value Comment
  zdepth dim 1 zpres dim 1 zscale dim 2 for x and y axis zshift dim 2 for x and y axis zwhat dim 32 zm dim 32 zc dim 32 glimpse shape (32, 32) for oatt,αatt image shape (128, 128)
  Foreground Image Encoder Layer Size/Ch. Stride Norm./Act.
  Input 3 Conv 4× 4 16 2 GN(4)/CELU Conv 4× 4 32 2 GN(8)/CELU Conv 4× 4 64 2 GN(8)/CELU Conv 3× 3 128 1 GN(16)/CELU Conv 3× 3 256 1 GN(32)/CELU Conv 1× 1 128 1 GN(16)/CELU
  Residual Connection Layer Size/Ch. Stride Norm./Act.
  Input 128 Conv 3× 3 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU
  Residual Encoder Layer Size/Ch. Stride Norm./Act.
  Input 128 + 128 Conv 3× 3 128 1 GN(16)/CELU
  Glimpse Encoder Layer Size/Ch. Stride Norm./Act.
  Input 3 Conv 3× 3 16 1 GN(4)/CELU Conv 4× 4 32 2 GN(8)/CELU Conv 3× 3 32 1 GN(4)/CELU Conv 4× 4 64 2 GN(8)/CELU Conv 4× 4 128 2 GN(8)/CELU Conv 4× 4 256 1 GN(16)/CELU Linear 32 + 32
  Glimpse Decoder Layer Size/Ch. Stride Norm./Act.
  Input 32 Conv 1× 1 256 1 GN(16)/CELU ConvSub(2) 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU ConvSub(2) 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU ConvSub(2) 64 1 GN(8)/CELU Conv 3× 3 64 1 GN(8)/CELU ConvSub(2) 32 1 GN(8)/CELU Conv 3× 3 32 1 GN(8)/CELU ConvSub(2) 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU
  Background Image Encoder Layer Size/Ch. Stride Norm./Act.
  Input 3 Conv 3× 3 64 2 BN/ELU Conv 3× 3 64 2 BN/ELU Conv 3× 3 64 2 BN/ELU Conv 3× 3 64 2 BN/ELU Flatten Linear 64 ELU
  Mask Decoder Layer Size/Ch. Stride Norm./Act.
  Input 32 Conv 1× 1 256 1 GN(16)/CELU ConvSub(4) 256 1 GN(16)/CELU Conv 3× 3 256 1 GN(16)/CELU ConvSub(2) 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU ConvSub(4) 64 1 GN(8)/CELU Conv 3× 3 64 1 GN(8)/CELU ConvSub(4) 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 1 1
  Component Encoder Layer Size/Ch. Stride Norm./Act.
  Input 3+1 (RGB+mask) Conv 3× 3 32 2 BN/ELU Conv 3× 3 32 2 BN/ELU Conv 3× 3 64 2 BN/ELU Conv 3× 3 64 2 BN/ELU Flatten Linear 32+32
  Component Decoder Layer Size/Ch. Stride Norm./Act.
  Input 32 (1d) Spatial Broadcast 32+2 (3d) Conv 3× 3 32 1 BN/ELU Conv 3× 3 32 1 BN/ELU Conv 3× 3 32 1 BN/ELU Conv 3× 3 3 1
sections.heading: D.4 BASELINES
sections.text: Here we give out the details of the background decoder in training of SPAIR (both full image as well as patch-wise training). The foreground and background image encoder is same as that of SPACE with the only difference that the inferred latents are conditioned on previous cells’ latents as described in Section 2.2. For the background image encoder, we add an additional linear layer so that the encoded background latent is one dimensional.
  SPAIR Background Decoder Layer Size/Ch. Stride Norm./Act.
  Input 32 Conv 1× 1 256 1 GN(16)/CELU ConvSub(4) 256 1 GN(16)/CELU Conv 3× 3 256 1 GN(16)/CELU ConvSub(4) 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU ConvSub(2) 64 1 GN(8)/CELU Conv 3× 3 64 1 GN(8)/CELU ConvSub(4) 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 3 1
sections.heading: SPAIR Background Encoder For Patch Training
sections.text: Layer Size/Ch. Stride Norm./Act.
  Input 3 Conv 2× 2 16 2 GN(4)/CELU Conv 2× 2 32 2 GN(8)/CELU Conv 2× 2 64 2 GN(8)/CELU Conv 2× 2 128 2 GN(16)/CELU Conv 2× 2 32 2 GN(4)/CELU
sections.heading: SPAIR Background Decoder For Patch Training
sections.text: Layer Size/Ch. Stride Norm./Act.
  Input 16 Conv 1× 1 256 1 GN(16)/CELU Conv 1× 1 2048 1 ConvSub(4) 128 1 GN(16)/CELU Conv 3× 3 128 1 GN(16)/CELU Conv 1× 1 256 1 ConvSub(2) 64 1 GN(8)/CELU Conv 3× 3 64 1 GN(8)/CELU Conv 1× 1 256 1 ConvSub(4) 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 16 1 GN(4)/CELU Conv 3× 3 3 1
  For IODINE, we use our own implementation following the details as described in (Greff et al., 2019). For GENESIS, we also use our own implementation following the same architecture as in (Engelcke et al., 2019), but the details of individual networks are similar to SPACE’s background module.
sections.heading: E DATASET DETAILS
sections.text: Atari. For each game, we sample 60,000 random images from a pretrained agent (Wu et al., 2016). We split the images into 50,000 for the training set, 5,000 for the validation set, and 5,000 for the testing set. Each image is preprocessed into a size of 128 × 128 pixels with BGR color channels. We present the results for the following games: Space Invaders, Air Raid, River Raid, Montezuma’s Revenge.
  We also train our model on a dataset of 10 games jointly, where we have 8,000 training images, 1,000 validation images, and 1,000 testing images for each game. We use the following games: Asterix, Atlantis, Carnival, Double Dunk, Kangaroo, Montezuma Revenge, Pacman, Pooyan, Qbert, Space Invaders.
  Room 3D. We use MuJoCo (Todorov et al., 2012) to generate this dataset. Each image consists of a walled enclosure with a random number of objects on the floor. The possible objects are randomly sized spheres, cubes, and cylinders. The small 3D-Room dataset has 4-8 objects and the large 3DRoom dataset has 18-24 objects. The color of the objects are randomly chosen from 8 different colors and the colors of the background (wall, ground, sky) are chosen randomly from 5 different colors. The angle of the camera is also selected randomly. We use a training set of 63,000 images, a validation set of 7,000 images, and a test set of 7,000 images. We use a 2-D projection from the camera to determine the ground truth bounding boxes of the objects so that we can report the average precision of the different models.