Lecture

Data Compression and Entropy: Compression

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.

In course

CS-119(d): Information, Computation, Communication

L'objectif de ce cours est d'introduire les étudiants à la pensée algorithmique, de les familiariser avec les fondamentaux de l'Informatique et de développer une première compétence en programmation (langage C++). ...

Description

This lecture covers the concept of lossless data compression, which aims to reduce memory space and transmission time by removing redundancy in data. Examples of compression algorithms like SMS language and Morse code are discussed, emphasizing the importance of being able to recover the original message. The process of minimizing the number of bits required to represent a message is illustrated using the example of sending a message from Ibiza. Different encoding strategies, such as using ASCII extended code and optimizing bit usage based on the frequency of letters, are explored to achieve efficient compression.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Data compression

Related concepts (31)

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).

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.

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.

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.

Compression artifact

A compression artifact (or artefact) is a noticeable distortion of media (including , audio, and video) caused by the application of lossy compression. Lossy data compression involves discarding some of the media's data so that it becomes small enough to be stored within the desired or transmitted (streamed) within the available bandwidth (known as the data rate or bit rate). If the compressor cannot store enough data in the compressed version, the result is a loss of quality, or introduction of artifacts.

Related lectures (64)

Compression: Prefix-Free Codes

Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.

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.

Data Compression and Entropy: Basics and Introduction

Introduces data compression, entropy, and the importance of reducing redundancy in data.

Lossless Compression: Shannon-Fano and Huffman MOOC: Information, Computation, Communication: Introduction to computational thinking

Explores lossless compression using Shannon-Fano and Huffman algorithms, showcasing Huffman's superior efficiency and speed over Shannon-Fano.

JPEG 2000: Image Compression