Lecture

Entropy and Compression I

Graph Chat

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.

Description

This lecture covers the theory of entropy, including the upper bound demonstration and two quizzes. It explores properties of entropy, such as the relationship between probability and entropy, the concept of total order, and concavity. The lecture delves into compression without loss, explaining how data compression reduces storage space and transmission time by eliminating redundancy. It introduces algorithms like Shannon-Fano, demonstrating how to assign bit sequences to letters based on the number of questions needed to guess them. The lecture concludes by discussing the performance of the Shannon-Fano algorithm in reducing the number of bits required to represent a message, showcasing its efficiency in data compression.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Information engineering

Signal processing: Data compression

Related concepts (32)

Data compression

In information theory, data compression, source coding, or bit-rate reduction is the process of encoding information using fewer bits than the original representation. Any particular compression is either lossy or lossless. Lossless compression reduces bits by identifying and eliminating statistical redundancy. No information is lost in lossless compression. Lossy compression reduces bits by removing unnecessary or less important information.

Lossless compression

Lossless compression is a class of data compression that allows the original data to be perfectly reconstructed from the compressed data with no loss of information. Lossless compression is possible because most real-world data exhibits statistical redundancy. By contrast, lossy compression permits reconstruction only of an approximation of the original data, though usually with greatly improved compression rates (and therefore reduced media sizes).

Lossy compression

In information technology, lossy compression or irreversible compression is the class of data compression methods that uses inexact approximations and partial data discarding to represent the content. These techniques are used to reduce data size for storing, handling, and transmitting content. The different versions of the photo of the cat on this page show how higher degrees of approximation create coarser images as more details are removed. This is opposed to lossless data compression (reversible data compression) which does not degrade the data.

Image compression

Image compression is a type of data compression applied to s, to reduce their cost for storage or transmission. Algorithms may take advantage of visual perception and the statistical properties of image data to provide superior results compared with generic data compression methods which are used for other digital data. Image compression may be lossy or lossless. Lossless compression is preferred for archival purposes and often for medical imaging, technical drawings, clip art, or comics.

Fractal compression

Fractal compression is a lossy compression method for s, based on fractals. The method is best suited for textures and natural images, relying on the fact that parts of an image often resemble other parts of the same image. Fractal algorithms convert these parts into mathematical data called "fractal codes" which are used to recreate the encoded image. Iterated function system Fractal image representation may be described mathematically as an iterated function system (IFS).

Related lectures (64)

Entropy and Data Compression: Huffman Coding Techniques

Discusses entropy, data compression, and Huffman coding techniques, emphasizing their applications in optimizing codeword lengths and understanding conditional entropy.

Conditional Entropy and Information Theory Concepts

Discusses conditional entropy and its role in information theory and data compression.

Data Compression and Shannon's Theorem: Entropy Calculation Example

Demonstrates the calculation of entropy for a specific example, resulting in an entropy value of 2.69.

Data Compression and Shannon's Theorem: Lossy Compression

Explores data compression, including lossless methods and the necessity of lossy compression for real numbers and signals.

Entropy and Algorithms: Applications in Sorting and Weighing