$μ$NCA: Texture Generation with Ultra-Compact Neural Cellular Automata
원문 초록
We study the problem of example-based procedural texture synthesis using highly compact models. Given a sample image, we use differentiable programming to train a generative process, parameterised by a recurrent Neural Cellular Automata (NCA) rule. Contrary to the common belief that neural networks should be significantly over-parameterised, we demonstrate that our model architecture and training procedure allows for representing complex texture patterns using just a few hundred learned parameters, making their expressivity comparable to hand-engineered procedural texture generating programs. The smallest models from the proposed $\mu$NCA family scale down to 68 parameters. When using quantisation to one byte per parameter, proposed models can be shrunk to a size range between 588 and 68 bytes. Implementation of a texture generator that uses these parameters to produce images is possible with just a few lines of GLSL or C code.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Hunyuan3D 2.5: Towards High-Fidelity 3D Assets Generation with Ultimate Details
TexTailor: Customized Text-aligned Texturing via Effective Resampling
UniTEX: Universal High Fidelity Generative Texturing for 3D Shapes
TetWeave: Isosurface Extraction using On-The-Fly Delaunay Tetrahedral Grids for Gradient-Based Mesh Optimization
Program Semantic Inequivalence Game with Large Language Models
GPRat: Gaussian Process Regression with Asynchronous Tasks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.