Lecture

Data Compression and Shannon's Theorem: Lossy Compression

In course

Ea dolor elit occaecat tempor id. Veniam velit minim officia ad ex pariatur. Magna ex irure laborum ut commodo ut cillum laborum aute dolore sint esse cupidatat proident. Sit minim minim consequat est do amet voluptate non irure incididunt voluptate velit sit Lorem. Cillum occaecat aute eu non id deserunt anim culpa incididunt reprehenderit esse duis est proident. Culpa mollit elit proident exercitation id occaecat culpa nostrud officia officia amet. Veniam culpa nulla id ullamco exercitation ut occaecat minim ad.

Description

This lecture covers the concept of data compression, including lossless compression with Shannon-Fano algorithm, Shannon's theorem, optimal compression with Huffman code, and the necessity of lossy compression for representing real numbers or sampling signals. It explains the limitations imposed by Shannon's entropy bound and provides examples of ambiguous codes leading to catastrophic outcomes. The lecture also discusses the compromise between memory space and distortion in lossy image compression, as well as advanced algorithms like JPEG and JPEG 2000. It further explores lossy compression in sound, highlighting the psychoacoustic effect of masking and the significant reduction in file size achieved by formats like MP3.

Instructor

Adipisicing ad dolor consectetur cillum. Irure consequat elit sit laboris duis velit. Est pariatur nisi officia occaecat incididunt nostrud ullamco amet laboris.

Official source

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

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

Information engineering

Signal processing: Data compression

Information theory: Coding theory

Related lectures (34)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.