Skip to content

Performed Image Compression using Singular Value Decomposition (SVD) and K Means Clustering.

License

Notifications You must be signed in to change notification settings

Balajirvp/Image-Compression-using-SVD-and-K-Means-Clustering

Repository files navigation

In this project, I performed image compression through two beautiful concepts - Singular Value Decomposition (SVD) and K Means Clustering. The code files will give a background behind each of the concepts used. The repository also contains the images used for reference.

Please use the notebooks to play around with the K values to see how the compressed image looks like. The SVD notebook has interactive widgets, which you can use to choose different images and k values and check real-time how the choice of k values affect the quality of the compressed image. Find below the results from the compression which shows the original image against the compressed image. It also shows the Compression ratio (for SVD) and the compressed file sizes (for K Means) to give a sense of how compressed the images are for the chosen K.

Singular Value Decomposition (SVD)

I) Comparison for Black and White images:

Lower number of Singular Values

image

Higher number of Singular Values

image

II) Comparison for Color images:

Lower number of Singular Values

image

Higher number of Singular Values

image

K Means Clustering

I) Comparison of the images:

image

image

image

II) Comparison of the file sizes:

image

About

Performed Image Compression using Singular Value Decomposition (SVD) and K Means Clustering.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published