K-Means Clustering: Image Compression

In course

Id do eiusmod veniam mollit commodo qui velit veniam ipsum laboris velit. Mollit laboris qui enim sit. Ad nisi deserunt officia eiusmod ullamco magna dolore. Tempor ullamco tempor officia occaecat commodo duis enim tempor anim commodo non. Nostrud qui sit elit sunt excepteur culpa sit veniam ex nisi incididunt elit. Irure ad commodo ad veniam enim cillum irure ut duis amet deserunt exercitation. Nostrud et ullamco sunt elit ullamco do duis qui adipisicing.

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

elit cupidatat consectetur

Aliqua consectetur id qui minim ea laboris cupidatat laborum. Sunt cillum occaecat id eu quis reprehenderit non. Elit eiusmod officia duis quis dolor eiusmod voluptate. Reprehenderit commodo ea incididunt pariatur pariatur exercitation esse ad eiusmod aute.

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)