The reviewed record of science sign in
Pith

arxiv: 2402.13251 · v3 · pith:KVYEJQAT · submitted 2024-02-20 · cs.GR · cs.CV· cs.LG

FlashTex: Fast Relightable Mesh Texturing with LightControlNet

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:KVYEJQATrecord.jsonopen to challenge →

classification cs.GR cs.CVcs.LG
keywords lightcontrolnetlightingmeshtextureapproachfastmaterialmodel
0
0 comments X
read the original abstract

Manually creating textures for 3D meshes is time-consuming, even for expert visual content creators. We propose a fast approach for automatically texturing an input 3D mesh based on a user-provided text prompt. Importantly, our approach disentangles lighting from surface material/reflectance in the resulting texture so that the mesh can be properly relit and rendered in any lighting environment. We introduce LightControlNet, a new text-to-image model based on the ControlNet architecture, which allows the specification of the desired lighting as a conditioning image to the model. Our text-to-texture pipeline then constructs the texture in two stages. The first stage produces a sparse set of visually consistent reference views of the mesh using LightControlNet. The second stage applies a texture optimization based on Score Distillation Sampling (SDS) that works with LightControlNet to increase the texture quality while disentangling surface material from lighting. Our algorithm is significantly faster than previous text-to-texture methods, while producing high-quality and relightable textures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. PHAF-Personalized Hand Avatars in a Flash

    cs.CV 2026-06 unverdicted novelty 4.0

    A method to generate personalized hand avatars from two views in a fraction of the time of optimization-based approaches.