1 / 12

Digital Image Compression via Singular Value Decomposition Robert White Ray Buhr Math 214

Digital Image Compression via Singular Value Decomposition Robert White Ray Buhr Math 214 Prof. Buckmire May 3, 2006. The Problem. High resolution digital images are dense files and take up lots of bandwidth Cost of: time spent online accepting large files capable machinery.

whiteheadj
Download Presentation

Digital Image Compression via Singular Value Decomposition Robert White Ray Buhr Math 214

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. Digital Image Compression via Singular Value Decomposition Robert WhiteRay Buhr Math 214 Prof. Buckmire May 3, 2006

  2. The Problem • High resolution digital images are dense files and take up lots of bandwidth • Cost of: • time spent online • accepting large files • capable machinery

  3. The Solution • Using Singular Value Decomposition, we can reduce the size of the image’s matrix • Eliminates the end SVDs • Cuts out the boring parts

  4. The Matrix/Image • Matrix represents a grayscale image (126x128) • Each component is represented by a # 0-255

  5. The Process • A = U*Σ*VT • ∑= the normalized singular values (√λ for ATA) • V= columns are eigenvectors of ATA • U= columns are eigenvectors of AAT • [U,S,V]=svd(A) factors A in Matlab

  6. For Example A = 4 x 4 =

  7. U = ∑ = VT =

  8. Taking Care of Business • SVD, singular values = rank(A) • A = σ1u1vT1 + …σkukvTk + 0*uk+1vTk+1 • Approximate A by eliminating small singular values

  9. The Pictures The original, k=126 k=4

  10. The Pictures k=8 k=20

  11. The Pictures k=50 Original, again, k=126

  12. The Results How much space is this process saving? 4 + 4(126) + 4(128) = 1020 8 + 8(126) + 4(128) = 2040 20 + 20(126) + 20(128) = 5100 (~31.6%) 50 + 50(126) + 50(128) = 12750 (~79.0%) (126)*(128) = 16128! x + x(126) + x(128) = 16128, x ≈ 63.247

More Related