Using Multiple Generative Adversarial Networks to Build Better-Connected Levels for Mega Man

• URL: http://arxiv.org/abs/2102.00337v1
• Date: Sat, 30 Jan 2021 23:34:15 GMT
• Title: Using Multiple Generative Adversarial Networks to Build Better-Connected Levels for Mega Man
• Authors: Benjamin Capps and Jacob Schrum
• Abstract summary: This paper focuses on combining GAN-generated segments in a snaking pattern to create levels for Mega Man. Multiple GANs were trained on different types of segments to ensure better flow between segments.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative Adversarial Networks (GANs) can generate levels for a variety of games. This paper focuses on combining GAN-generated segments in a snaking pattern to create levels for Mega Man. Adjacent segments in such levels can be orthogonally adjacent in any direction, meaning that an otherwise fine segment might impose a barrier between its neighbor depending on what sorts of segments in the training set are being most closely emulated: horizontal, vertical, or corner segments. To pick appropriate segments, multiple GANs were trained on different types of segments to ensure better flow between segments. Flow was further improved by evolving the latent vectors for the segments being joined in the level to maximize the length of the level's solution path. Using multiple GANs to represent different types of segments results in significantly longer solution paths than using one GAN for all segment types, and a human subject study verifies that these levels are more fun and have more human-like design than levels produced by one GAN.

Related papers

• Unsupervised Universal Image Segmentation [59.0383635597103]
  We propose an Unsupervised Universal model (U2Seg) adept at performing various image segmentation tasks. U2Seg generates pseudo semantic labels for these segmentation tasks via leveraging self-supervised models. We then self-train the model on these pseudo semantic labels, yielding substantial performance gains.
  arXiv  Detail & Related papers  (2023-12-28T18:59:04Z)
• SemAffiNet: Semantic-Affine Transformation for Point Cloud Segmentation [94.11915008006483]
  We propose SemAffiNet for point cloud semantic segmentation. We conduct extensive experiments on the ScanNetV2 and NYUv2 datasets.
  arXiv  Detail & Related papers  (2022-05-26T17:00:23Z)
• On Linking Level Segments [3.04585143845864]
  We present a Markov chain and a tree search algorithm that finds a link between two level segments. This method reliably finds links between segments and is customizable to meet a designer's needs.
  arXiv  Detail & Related papers  (2022-03-09T21:32:41Z)
• HS3: Learning with Proper Task Complexity in Hierarchically Supervised Semantic Segmentation [81.87943324048756]
  We propose Hierarchically Supervised Semantic (HS3), a training scheme that supervises intermediate layers in a segmentation network to learn meaningful representations by varying task complexity. Our proposed HS3-Fuse framework further improves segmentation predictions and achieves state-of-the-art results on two large segmentation benchmarks: NYUD-v2 and Cityscapes.
  arXiv  Detail & Related papers  (2021-11-03T16:33:29Z)
• Hybrid Encoding For Generating Large Scale Game Level Patterns With Local Variations Using a GAN [5.144809478361604]
  We propose a new hybrid approach that evolves CPPNs first, but allows the latent vectors to evolve later, and combines the benefits of both approaches. These approaches are evaluated in Super Mario Bros. and The Legend of Zelda.
  arXiv  Detail & Related papers  (2021-05-27T06:27:19Z)
• Segmenter: Transformer for Semantic Segmentation [79.9887988699159]
  We introduce Segmenter, a transformer model for semantic segmentation. We build on the recent Vision Transformer (ViT) and extend it to semantic segmentation. It outperforms the state of the art on the challenging ADE20K dataset and performs on-par on Pascal Context and Cityscapes.
  arXiv  Detail & Related papers  (2021-05-12T13:01:44Z)
• Labels4Free: Unsupervised Segmentation using StyleGAN [40.39780497423365]
  We propose an unsupervised segmentation framework for StyleGAN generated objects. We report comparable results against state-of-the-art supervised segmentation networks.
  arXiv  Detail & Related papers  (2021-03-27T18:59:22Z)
• SegGroup: Seg-Level Supervision for 3D Instance and Semantic Segmentation [88.22349093672975]
  We design a weakly supervised point cloud segmentation algorithm that only requires clicking on one point per instance to indicate its location for annotation. With over-segmentation for pre-processing, we extend these location annotations into segments as seg-level labels. We show that our seg-level supervised method (SegGroup) achieves comparable results with the fully annotated point-level supervised methods.
  arXiv  Detail & Related papers  (2020-12-18T13:23:34Z)
• Affinity Space Adaptation for Semantic Segmentation Across Domains [57.31113934195595]
  In this paper, we address the problem of unsupervised domain adaptation (UDA) in semantic segmentation. Motivated by the fact that source and target domain have invariant semantic structures, we propose to exploit such invariance across domains. We develop two affinity space adaptation strategies: affinity space cleaning and adversarial affinity space alignment.
  arXiv  Detail & Related papers  (2020-09-26T10:28:11Z)
• Sequential Segment-based Level Generation and Blending using Variational Autoencoders [5.33024001730262]
  We train VAEs to learn a sequential model of segment generation such that generated segments logically follow from prior segments. We obtain a pipeline that enables the generation of arbitrarily long levels that progress in any of these four directions. In addition to generating more coherent levels of non-fixed length, this method also enables implicit blending of levels from separate games.
  arXiv  Detail & Related papers  (2020-07-17T04:11:51Z)
• CPPN2GAN: Combining Compositional Pattern Producing Networks and GANs for Large-scale Pattern Generation [8.719982934025417]
  CPPN2GAN can organize level segments output by a GAN into a complete level. This new CPPN2GAN approach is validated in both Super Mario Bros. and The Legend of Zelda.
  arXiv  Detail & Related papers  (2020-04-03T04:29:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.