|
|
||
|
This simulation shows how Singular Value Decomposition (SVD) can compress an image by keeping only the most important components. An image is a matrix A; SVD factors it into A = U Σ VT, where U and V are orthogonal and Σ is diagonal with the singular values (σ1 ≥ σ2 ≥ …). The formulaA = U Σ VT and the rank-k approximation Ak = Σi=1k σi ui viT Using only the first k singular values and corresponding columns of U and V, we reconstruct an approximation that uses far less storage: original m×n pixels vs. m·k + k + n·k numbers for the compressed form. Energy mapThe singular value decay chart shows that the first few σi carry most of the image "energy." Low k gives a blurry base; increasing k adds detail but increases storage linearly. HeatmapWith Heatmap on, the reconstructed image is shown in a thermal color scale (black → red → yellow) to highlight where intensity varies—useful for seeing approximation error and residual detail.
A = U Σ VT → Ak = Σi=1k σi ui viT
Original (grayscale)
SVD reconstructed (rank-k)
k = 1
Upload an image to start.
Singular value decay (red line = current k)
U (left singular vectors)
Σ (singular values)
VT (right singular vectors)
Usage
Visualizations
Controls
|
||