Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

The best new feature in Blender 4 is NODE TOOLS 🔥 Before this, you could only use geometry nodes as modifiers. Now you can use them as quick one-time operations! This is beyond powerful. Best thing to ever happen to Blender Here's a simple node tree to make pipes...

180,849 Aufrufe • vor 2 Jahren •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

If you think this is just another silly demo made with AI, read this post. You might change your mind, because this demo is about MATH. What you see on the screen is not a render from Blender (obviously, it’s not that good). It’s a three.js app built with Toolcraft. Available on the web and rendered in real time(link in the comments). But Blender still has a lot to do with it. Blender has Geometry Nodes - a powerful node-based system for creating and manipulating procedural geometry. In other words, it’s math. And math is a universal language. And who do you think is pretty good at math? >>> AI. Now you can download or buy Blender files from marketplaces, and when they contain Geometry Nodes for procedural animations, objects, surfaces, or effects, you can transfer that logic to the web. Make it real-time, make it interactive. Materials are a separate story, of course. They can still suck unless you use the right tricks: PBR, HDRIs, material blending, displacement, and faked surface relief. So why is Blender important here? Blender is open source, and many tools around it are open source too. An AI trained on their code. That means it can translate the math from one environment to another quite accurately. If you’ve been struggling to reproduce some idea with AI that you had in your head or seen in some references, and it has something to do with Geometry Nodes, and you can find that idea or a close one in the Blender ecosystem - it means you can transfer it to the web. Thank me later.

Alex Barashkov

28,300 Aufrufe • vor 1 Monat

[Graph Convolutional Network] by hand ✍️ Graph Convolutional Networks (GCNs), introduced by Thomas Kipf and Max Welling in 2017, have emerged as a powerful tool in the analysis and interpretation of data structured as graphs. This exercise demonstrates how GCN works in a simple application: binary classification. -- Goal -- Predict if a node in a graph is X. -- Architecture -- 🟪 Graph Convolutional Network (GCN) 1. GCN1(4,3) 2. GCN2(3,3) 🟦 Fully Connected Network (FCN) 1. Linear1(3,5) 2. ReLU 3. Linear2(5,1) 4. Sigmoid Simplications: • Adjacent matrices are not normalized. • ReLU is applied to messages directly. -- Walkthrough -- [1] Given ↳ A graph with five nodes A, B, C, D, E [2] 🟩 Adjacency Matrix: Neighbors ↳ Add 1 for each edge to neighbors ↳ Repeat in both directions (e.g., A->C, C->A) ↳ Repeat for both GCN layers [3] 🟩 Adjacency Matrix: Self ↳ Add 1's for each self loop ↳ Equivalent to adding the identity matrix ↳ Repeat for both GCN layers [4] 🟪 GCN1: Messages ↳ Multiply the node embeddings 🟨 with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [5] 🟪 GCN1: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The purpose is the pool messages from each node's neighbors as well as from the node itself. ↳ The result is a new feature per node [6] 🟪 GCN1: Visualize ↳ For node 1, visualize how messages are pooled to obtain a new feature for better understanding ↳ [3,0,1] + [1,0,0] = [4,0,1] [7] 🟪 GCN2: Messages ↳ Multiply the node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is one message per node [8] 🟪 GCN2: Pooling ↳ Multiply the messages with the adjacent matrix ↳ The result is a new feature per node [9] 🟪 GCN2: Visualize ↳ For node 3, visualize how messages are pooled to obtain a new feature for better understanding ↳ [1,2,4] + [1,3,5] + [0,0,1] = [2,5,10] [10] 🟦 FCN: Linear 1 + ReLU ↳ Multiply node features with weights and biases ↳ Apply ReLU (negatives → 0) ↳ The result is a new feature per node ↳ Unlike in GCN layers, no messages from other nodes are included. [11] 🟦 FCN: Linear 2 ↳ Multiply node features with weights and biases [12] 🟦 FCN: Sigmoid ↳ Apply the Sigmoid activation function ↳ The purpose is to obtain a probability value for each node ↳ One way to calculate Sigmoid by hand ✍️ is to use the approximation below: • >= 3 → 1 • 0 → 0.5 • <= -3 → 0 -- Outputs -- A: 0 (Very unlikely) B: 1 (Very likely) C: 1 (Very likely) D: 1 (Very likely) E: 0.5 (Neutral)

Tom Yeh

46,779 Aufrufe • vor 2 Jahren