1 / 12

EE 441

EE 441. Some example projects. Singular Value Decomposition for Image Compression. A = U Λ V T = . σ 1. σ 2. σ 3. Use svd command in MATLAB…. Singular Value Decomposition for Image Compression. Original (N=350). Compressed (N=100).

senwe
Download Presentation

EE 441

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EE 441 Some example projects

  2. Singular Value Decompositionfor Image Compression A = U Λ VT = σ1 σ2 σ3 Use svd command in MATLAB…

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

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

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

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

  7. Graph Theory Gameshttps://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?

  8. Graph Theory Gameshttps://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?

  9. Graph Theory Gameshttps://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?

  10. Graph Theory Gameshttps://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?

  11. Graph Theory Gameshttps://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?

  12. Graph Theory Gameshttps://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?

More Related