1. EE 441 Some example projects

2. Singular Value Decomposition for Image Compression A = U Λ V T = σ1σ1 σ2σ2 σ3σ3 Use svd command in MATLAB…

3. Original (N=350)Compressed (N=100) Singular Value Decomposition for Image Compression

4. Original (N=350)Compressed (N=75) Singular Value Decomposition for Image Compression

5. Original (N=350)Compressed (N=50) Singular Value Decomposition for Image Compression

6. Original (N=350)Compressed (N=25) Singular Value Decomposition for Image Compression

7. x Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? Ax = b mod 2 Field Graph Theory Games https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game

8. x Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? Ax = b mod 2 Field Graph Theory Games https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game

9. x Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? Ax = b mod 2 Field Graph Theory Games https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game

10. Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? x Ax = b mod 2 Field Graph Theory Games https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game

11. Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? x Ax = b mod 2 Field Graph Theory Games https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game

12. Clicking on a node flips the color of that node and its neighbors. Can we color all nodes by a sequence of clicks? x Ax = b mod 2 Field