mlsanityData to 14 Oct 2026

Feature Disentanglement in generating three-dimensional structure from two-dimensional slice with sliceGAN

arXiv 2105.00194 ↗First posted 1 May 2021cs.CV cs.LG eess.IVcited by 2

Not on the map. Why?

Abstract (arXiv)

Deep generative models are known to be able to model arbitrary probability distributions. Among these, a recent deep generative model, dubbed sliceGAN, proposed a new way of using the generative adversarial network (GAN) to capture the micro-structural characteristics of a two-dimensional (2D) slice and generate three-dimensional (3D) volumes with similar properties. While 3D micrographs are largely beneficial in simulating diverse material behavior, they are often much harder to obtain than their 2D counterparts. Hence, sliceGAN opens up many interesting directions of research by learning the representative distribution from 2D slices, and transferring the learned knowledge to generate arbitrary 3D volumes. However, one limitation of sliceGAN is that latent space steering is not possible. Hence, we combine sliceGAN with AdaIN to endow the model with the ability to disentangle the features and control the synthesis.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 6 of its 11 references that are in the map. First posted on arXiv 1 May 2021.

Builds on

6 of 11 references.

References · 6

  1. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  2. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
  3. 2017Arbitrary Style Transfer in Real-time with Adaptive Instance Normalizationcited by 2,010
  4. 2017Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networkscited by 707
  5. 2021Generating 3D structures from a 2D slice with GAN-based dimensionality expansioncited by 29
  6. 2020Continuous Conversion of CT Kernel using Switchable CycleGAN with AdaINcited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.