Lecture

Applied Topology: Compression Schemes and Range Patches

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 application of density understanding to develop compression schemes, including the comparison between Kleinlets and Wedgelets. It also explores texture recognition on the Klein bottle and the analysis of range patches using persistent homology. Additionally, it delves into the evolution of trees and the study of persistence barcodes in metric spaces, particularly in the context of evolution. The lecture further discusses experiments with unevoked data and variants on persistence, such as Zig-Zags, with a focus on classification and practical applications.

Official source

Related concepts (31)

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.

Metric space

In mathematics, a metric space is a set together with a notion of distance between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry. The most familiar example of a metric space is 3-dimensional Euclidean space with its usual notion of distance. Other well-known examples are a sphere equipped with the angular distance and the hyperbolic plane.

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.

Complete metric space

In mathematical analysis, a metric space M is called complete (or a Cauchy space) if every Cauchy sequence of points in M has a limit that is also in M. Intuitively, a space is complete if there are no "points missing" from it (inside or at the boundary). For instance, the set of rational numbers is not complete, because e.g. is "missing" from it, even though one can construct a Cauchy sequence of rational numbers that converges to it (see further examples below).

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

Related lectures (64)

Data Compression and Entropy: Basics and Introduction

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

Compression: Prefix-Free Codes

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

Decomposition Storage Model: Column-Oriented Storage

Explores the advantages of Decomposition Storage Model with column-oriented storage and various compression techniques.

Neural Signal Compression

Explores analog-to-digital conversion, neural signal optimization, multichannel architectures, and on-chip compression techniques in neuroengineering.

Data Compression and Shannon-Fano Algorithm