EE 441
Some example projects
Singular Value Decomposition
for Image Compression
A = U Λ VT
=
σ1
σ2
σ3
Use svd command in MATLAB…
Singular Value Decomposition
for Image Compression
Original (N=350)
Compressed (N=100)
Singular Value Decomposition
for Image Compression
Original (N=350)
Compressed (N=75)
Singular Value Decomposition
for Image Compression
Original (N=350)
Compressed (N=50)
Singular Value Decomposition
for Image Compression
Original (N=350)
Compressed (N=25)
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?
Graph Theory Games
https://www.math.lsu.edu/~verrill/teaching/linearalgebra/linalg/linalg7.html#game
Ax = b
mod 2 Field
x
Clicking on a node flips the color of that node and
its neighbors.
Can we color all nodes by a sequence of clicks?