Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

Check out ๐Œ๐จ๐ญ๐ข๐จ๐ง๐Ÿ๐•๐ž๐œ๐’๐ž๐ญ๐ฌ, a 4D diffusion model for dynamic surface reconstruction from imperfect observations of sparse, noisy, or partial point clouds. Main idea: we represent time-varying shapes via 4D neural representation with latent vector sets, and then explicitly learns the shape and motion distribution of non-rigid objects through an...

29,058 Aufrufe โ€ข vor 2 Jahren โ€ขvia X (Twitter)

1 Kommentare

Profilbild von ็”ฐไธญ็พฉๅผ˜ | taziku CEO / AI ร— Creative
็”ฐไธญ็พฉๅผ˜ | taziku CEO / AI ร— Creativevor 2 Jahren

Technology that may take 3D generative AI one step forward! Thanks for the info.

ร„hnliche Videos

[NeurIPS '24] DreamMesh4D: Video-to-4D Generation with Sparse-Controlled Gaussian-Mesh Hybrid Representation Abstract (excerpt) We introduce DreamMesh4D, a novel framework that combines mesh representation with sparse-controlled deformation technique to generate high-quality 4D object from a monocular video. To overcome the limitation of classical texture representation, we bind Gaussian splats to the surface of the triangular mesh for differentiable optimization of both the texture and mesh vertices. In particular, DreamMesh4D begins with a coarse mesh provided by a single image based 3D generation method. Sparse points are then uniformly sampled across the surface of the mesh, and are used to build a deformation graph to drive the motion of the 3D object for the sake of computational efficiency and providing additional constraint. For each step, transformations of sparse control points are predicted using a deformation network, and the mesh vertices as well as the bound surface Gaussians are deformed via a geometric skinning algorithm. The skinning algorithm is a hybrid approach combining LBS (linear blending skinning) and DQS (dual-quaternion skinning), mitigating drawbacks associated with both approaches. The static surface Gaussians and mesh vertices as well as the dynamic deformation network are learned via reference view photometric loss, score distillation loss as well as other regularization losses in a two-stage manner. Extensive experiments demonstrate that our method outperforms prior video-to-4D generation methods in terms of rendering quality and spatial-temporal consistency.

MrNeRF

12,323 Aufrufe โ€ข vor 1 Jahr

SORA by Hand โœ๏ธ OpenAIโ€™s #SORA took over the Internet when it was announced earlier this year. The technology behind Sora is the Diffusion Transformer (DiT) developed by William Peebles and Shining Xie. How does DiT work? ๐—š๐—ผ๐—ฎ๐—น: Generate a video conditioned by a text prompt and a series of diffusion steps [1] Given โ†ณ Video โ†ณ Prompt: "sora is sky" โ†ณ Diffusion step: t = 3 [2] Video โ†’ Patches โ†ณ Divide all pixels in all frames into 4 spacetime patches [3] Visual Encoder: Pixels ๐ŸŸจ โ†’ Latent ๐ŸŸฉ โ†ณ Multiply the patches with weights and biases, followed by ReLU โ†ณ The result is a latent feature vector per patch โ†ณ The purpose is dimension reduction from 4 (2x2x1) to 2 (2x1). โ†ณ In the paper, the reduction is 196,608 (256x256x3)โ†’ 4096 (32x32x4) [4] โฌ› Add Noise โ†ณ Sample a noise according to the diffusion time step t. Typically, the larger the t, the smaller the noise. โ†ณ Add the Sampled Noise to latent features to obtain Noised Latent. โ†ณ The goal is to purposely add noise to a video and ask the model to guess what that noise is. โ†ณ This is analogous to training a language model by purposely deleting a word in a sentence and ask the model to guess what the deleted word was. [5-7] ๐ŸŸช Conditioning by Adaptive Layer Norm [5] Encode Conditions โ†ณ Encode "sora is sky" into a text embedding vector [0,1,-1]. โ†ณ Encode t = 3 to as a binary vector [1,1]. โ†ณ Concatenate the two vectors in to a 5D column vector. [6] Estimate Scale/Shift โ†ณ Multiply the combined vector with weights and biases โ†ณ The goal is to estimate the scale [2,-1] and shift [-1,5]. โ†ณ Copy the result to (X) and (+) [7] Apply Scale/Sift โ†ณ Scale the noised latent by [2,-1] โ†ณ Shifted the scaled noised latent by [-1, 5] โ†ณ The result is "conditioned" noise latent. [8-10] Transformer [8] Self-Attention โ†ณ Feed the conditioned noised latent to Query-Key function to obtain a self-attention matrix โ†ณ Value is omitted for simplicity [9] Attention Pooling โ†ณ Multiply the conditioned noised latent with the self-attention matrix โ†ณ The result are attention weighted features [10] Pointwise Feed Forward Network โ†ณ Multiply the attention weighted features with weights and biases โ†ณ The result is the Predicted Noise ๐Ÿ‹๏ธโ€โ™‚๏ธ ๐—ง๐—ฟ๐—ฎ๐—ถ๐—ป [11] โ†ณ Calculate MSE loss gradients by taking the different between the Predicted Noise and the Sampled Noise (ground truth). โ†ณ Use the loss gradients to kick off backpropagation to update all learnable parameters (red borders) โ†ณ Note the visual encoder and decoder's parameters are frozen (blue borders) ๐ŸŽจ ๐—š๐—ฒ๐—ป๐—ฒ๐—ฟ๐—ฎ๐˜๐—ฒ (๐—ฆ๐—ฎ๐—บ๐—ฝ๐—น๐—ฒ) [12] Denoise โ†ณ Subtract the predicted noise from the noised latent to obtain the noise-free latent [13] Visual Decoder: Latent ๐ŸŸฉ โ†’ Pixels ๐ŸŸจ โ†ณ Multiply the patches with weights and biases, followed by ReLU [14] Patches โ†’ Video โ†ณ Rearrange patches into a sequence of video frames.

Tom Yeh

238,151 Aufrufe โ€ข vor 2 Jahren