Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

🧵1/n This thread covers the linear algebra for modern computer graphics, bridging geometry, physics, and computation. Video 1: Vector Spaces & Cartesian Coordinates Source: CMU. 👇Video 2: Vector Operations, Vector Spaces, Functions as Vectors, and Vectors in Coordinates

52,043 Aufrufe • vor 2 Jahren •via X (Twitter)

10 Kommentare

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵2/n This video explains vector addition, scaling, and how these operations define vector spaces, and shows how functions can also behave like vectors in computer graphics. 👇Measuring Vectors, Norm of a Vector, L2 Norm of Functions

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵3/n This video continues vector addition, scaling in coordinates, and introduces norms to measure vector lengths for functions and images in graphics. 👇Inner Product, L2 Inner Product of Functions

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵4/n This video introduces the inner product (dot product), explaining how it measures the alignment of vectors, and shows how it applies to images and functions in graphics. 👇Linear Maps, Geometric Def, Algebraic Def, Linear Maps in Coordinates, Linear vs. Affine Maps, Span

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵5/n Introduces linear maps, explaining their importance in computer graphics for transformations like rotation and scaling. It also covers how linear maps preserve vector operations and distinguishes them from affine functions 👇Bases, Orthonormal Basis, Gram-Schmidt, Fourier

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵6/n basis and orthonormal basis for vector spaces, how vectors span a space. Gram-Schmidt process and the Fourier transform for creating orthonormal bases in both geometric and function spaces. 👇Systems of Linear Equations, Existence & Uniqueness, Matrices & Linear Maps

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵7/n This video covers solving systems of linear equations, visualizing them geometrically, and highlights the importance of understanding when solutions exist or are unique. It also discusses the role of matrices in encoding linear maps for efficient computation. 👇resources

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵8/n Full Course on computer Graphics : Fall 2024 CMU 👇The C and Assembly Developers Community.

Profilbild von tetsuo.ai - e/acc
tetsuo.ai - e/accvor 2 Jahren

🧵9/n Join the C and Assembly Developers' Community on X!

Profilbild von Larry Daniel
Larry Danielvor 2 Jahren

Program in python

Profilbild von Husam ☣︎
Husam ☣︎vor 2 Jahren

It's fucked up, you're a male apparently, and got this girly profile, anime bullshit and explaining math. You've been feminized.

Ähnliche Videos

SVM by hand ✍️ ~ 19 steps walkthrough below (Linear vs RBF) Support Vector Machines reigned supreme in machine learning before the deep learning revolution. An SVM predicts with dot products, the same matrix multiplication every model uses. What it does not do is train by backpropagation: it is fitted by convex optimization, so there is no matrix-multiplication backward pass for a GPU to accelerate. I drew and calculated two SVMs by hand: a linear one (top) and an RBF one (bottom), classifying the same two test vectors. Goal: turn six training vectors and their learned coefficients into a prediction, and see what changing the kernel actually changes. = 1. Given = Six training vectors, their labels, and the coefficients and bias already learned. A coefficient of zero means that vector is not a support vector: too far from the boundary to matter. = 2. Linear kernel, test vector 1 = Let us take the dot product of the test vector with every training vector. The dot product stands in for cosine similarity, and the column of results is the first column of the kernel matrix K. = 3. Linear kernel, test vector 2 = We do the same for the second, and K is complete. = 4. Signed weights = Let us multiply each coefficient by its label. The second training vector drops out here, because its coefficient is 0. = 5. Weighted combination = We multiply the signed weights through K and add the bias b. The result is a signed distance to the decision boundary: 17 and 5. = 6. Classify = Let us take the sign. Both are positive. = 7 to 11. RBF kernel, test vector 1 = Now the same picture with a different kernel, in five moves: square the differences, sum them, take the square root for the L2 distance, multiply by minus gamma, and raise e to that power. The negation is what turns a distance into a similarity, and gamma controls how far a single training vector's influence reaches. = 12 to 16. RBF kernel, test vector 2 = We repeat all five. The numbers change, the moves do not. = 17 to 19. Decision boundary, again = Signed weights, weighted combination, sign. Identical arithmetic to steps 4 through 6, on a K that was built a completely different way. The outputs: Linear K, first column = [13, 25, 12, 15, 19, 27] Linear decision values = 17 and 5, both positive RBF decision values = -2 and 1, so negative and positive The takeaway: the kernel is the only thing that changed, and it changed the answer. The linear SVM calls both test vectors positive; the RBF one splits them. Everything after the kernel matrix, the signed weights and the weighted combination and the sign, is the same page of arithmetic twice. 💾 Save this post!

Tom Yeh

16,916 Aufrufe • vor 3 Monaten