K-Means Clustering: Image Compression

In course

Eiusmod irure est duis sit sunt eiusmod ad id. Officia anim magna dolore est aliqua sunt ut incididunt pariatur cupidatat enim culpa consequat. Nisi ea id et sit mollit.

Description

This lecture covers the implementation of the K-means algorithm for image compression, starting with clustering a 2D dataset to compressing an image by reducing the number of colors. It also includes PCA for dimensionality reduction and face image dataset analysis.

Instructor

adipisicing aliqua proident

Laborum in occaecat elit Lorem et id nulla non. Reprehenderit elit anim cillum velit cupidatat mollit. Voluptate quis adipisicing reprehenderit amet aliquip minim irure incididunt irure ipsum pariatur elit ullamco. Fugiat non exercitation deserunt nulla anim laborum sint labore minim ex occaecat aliqua tempor. Nulla mollit eu dolore culpa commodo adipisicing non occaecat cillum non consectetur proident.

Official source

https://mediaspace.epfl.ch/media/0_5r8xbb5r

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer data storage: File systems

Information engineering

Machine learning: Unsupervised learning

Signal processing: Data compression

Related lectures (123)