An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference

Similar documents
Persistence stability for geometric complexes

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

A Multicover Nerve for Geometric Inference. Don Sheehy INRIA Saclay, France

Geometric Inference. 1 Introduction. Frédéric Chazal 1 and David Cohen-Steiner 2

Geometric Inference. 1 Introduction. Frédéric Chazal 1 and David Cohen-Steiner 2

Clustering algorithms and introduction to persistent homology

Reconstruction of Filament Structure

M3P1/M4P1 (2005) Dr M Ruzhansky Metric and Topological Spaces Summary of the course: definitions, examples, statements.

Lecture 5: Simplicial Complex

Analyse Topologique des Données

Walheer Barnabé. Topics in Mathematics Practical Session 2 - Topology & Convex

Computational Topology in Reconstruction, Mesh Generation, and Data Analysis

Bounded subsets of topological vector spaces

arxiv: v1 [math.st] 11 Oct 2017

T. Background material: Topology

Statistical properties of topological information inferred from data

Lecture 0: Reivew of some basic material

Detection and approximation of linear structures in metric spaces

Manifolds. Chapter X. 44. Locally Euclidean Spaces

Final Exam, F11PE Solutions, Topology, Autumn 2011

Lecture 1 Discrete Geometric Structures

Topology and Topological Spaces

In class 75min: 2:55-4:10 Thu 9/30.

Simplicial Hyperbolic Surfaces

Simplicial Complexes: Second Lecture

Math 734 Aug 22, Differential Geometry Fall 2002, USC

Topological space - Wikipedia, the free encyclopedia

However, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Lecture notes for Topology MMA100

H = {(1,0,0,...),(0,1,0,0,...),(0,0,1,0,0,...),...}.

Elementary Topology. Note: This problem list was written primarily by Phil Bowers and John Bryant. It has been edited by a few others along the way.

A Tour of General Topology Chris Rogers June 29, 2010

2 A topological interlude

Topology I Test 1 Solutions October 13, 2008

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Introduction to Algebraic and Geometric Topology Week 5

Don t just read it; fight it! Ask your own questions, look for your own examples, discover your own proofs. Is the hypothesis necessary?

Stability and Statistical properties of topological information inferred from metric data

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

Geometric Data. Goal: describe the structure of the geometry underlying the data, for interpretation or summary

MATH 54 - LECTURE 10

Cell-Like Maps (Lecture 5)

Data Analysis, Persistent homology and Computational Morse-Novikov theory

Notes on Topology. Andrew Forrester January 28, Notation 1. 2 The Big Picture 1

INTRODUCTION TO TOPOLOGY

66 III Complexes. R p (r) }.

Brian Hamrick. October 26, 2009

Lectures on topology. S. K. Lando

Lecture 2. Topology of Sets in R n. August 27, 2008

Math 528 Jan 11, Geometry and Topology II Fall 2005, USC

1 Point Set Topology. 1.1 Topological Spaces. CS 468: Computational Topology Point Set Topology Fall 2002

Definition A metric space is proper if all closed balls are compact. The length pseudo metric of a metric space X is given by.

751 Problem Set I JWR. Due Sep 28, 2004

EC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 2: Convex Sets

25 HIGH-DIMENSIONAL TOPOLOGICAL DATA ANALYSIS

Part 3. Topological Manifolds

2. Metric and Topological Spaces

Notes on point set topology, Fall 2010

Effective Computational Geometry for Curves and Surfaces. Chapter 7 Computational Topology: An Introduction

On Soft Topological Linear Spaces

Estimating Geometry and Topology from Voronoi Diagrams

Topology - I. Michael Shulman WOMP 2004

Metric and metrizable spaces

TOPOLOGY, DR. BLOCK, FALL 2015, NOTES, PART 3.

1 Euler characteristics

Introduction to Immersion, Embedding, and the Whitney Embedding Theorems

Notes on categories, the subspace topology and the product topology

Lecture-12: Closed Sets

Point-Set Topology II

Reflection groups 4. Mike Davis. May 19, Sao Paulo

Observing Information: Applied Computational Topology.

Math 6510 Homework 3

Introduction to Topology MA3F1

The Classification Problem for 3-Manifolds

FAST POINT LOCATION, RAY SHOOTING AND INTERSECTION TEST FOR 3D NEF POLYHEDRA

1.7 The Heine-Borel Covering Theorem; open sets, compact sets

Exact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )

CSE 5559 Computational Topology: Theory, algorithms, and applications to data analysis. Lecture 0: Introduction. Instructor: Yusu Wang

Other Voronoi/Delaunay Structures

The Space of Closed Subsets of a Convergent Sequence

Final Test in MAT 410: Introduction to Topology Answers to the Test Questions

Basics of Combinatorial Topology

Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012)

Gromov-Hausdorff distances in Euclidean Spaces. Facundo Mémoli

Lecture 2 September 3

Homology and Persistent Homology Bootcamp Notes 2017

Mathematical Tools for 3D Shape Analysis and Description

Divided-and-Conquer for Voronoi Diagrams Revisited. Supervisor: Ben Galehouse Presenter: Xiaoqi Cao

Pacific Journal of Mathematics

Lecture 11 COVERING SPACES

Stable and Multiscale Topological Signatures

Heegaard splittings and virtual fibers

Geometry of manifolds

Homological and Combinatorial Proofs of the Brouwer Fixed-Point Theorem

Topology notes. Basic Definitions and Properties.

Topological Inference via Meshing

Convex Geometry arising in Optimization

Correctness. The Powercrust Algorithm for Surface Reconstruction. Correctness. Correctness. Delaunay Triangulation. Tools - Voronoi Diagram

Transcription:

Sophia-Antipolis, January 2016 Winter School An introduction to Topological Data Analysis through persistent homology: Intro and geometric inference Frédéric Chazal INRIA Saclay - Ile-de-France frederic.chazal@inria.fr Some notes related to the course: J-D. Boissonnat, F. Chazal, M. Yvinec, Computational Geometry and Topology for Data Analysis http://geometrica.saclay.inria.fr/team/fred.chazal/

Introduction [Shape database] [Galaxies data] [Scanned 3D object] Data often come as (sampling of) metric spaces or sets/spaces endowed with a similarity measure with, possibly complex, topological/geometric structure. Data carrying geometric information are becoming high dimensional. Topological Data Analysis (TDA): - infer relevant topological and geometric features of these spaces. - take advantage of topol./geom. information for further processing of data (classification, recognition, learning, clustering, parametrization...).

Introduction Problem: how to compare topological properties of close shapes/data sets? Challenges and goals: no direct access to topological/geometric information: need of intermediate constructions (simplicial complexes); distinguish topological signal from noise; topological information may be multiscale; statistical analysis of topological information.

Challenges: - define a relevant class of objects to be considered (no hope to get a positive answer in full generality); - define a relevant notion of distance between the objects (approximation); - topological and geometric properties cannot be directly infered from approximations. Topological and geometric Inference Question: Given an approximation C of a geometric object K, is it possible to reliably estimate the topological and geometric properties of K, knowing only the approximation C?

Two strategies 1. Reconstruction 1. Topological inference + Full reconstruction of the underlying shape. + Estimation of topological information without explicit reconstruction. + Strong topological and geometric information. + A well-developped theory. - Strong regularity assumptions. + Lighter regularity assumptions. + A powerful theory that extends to general data. - Weaker information. - Severe practical/algo issues in high dimensions. This course

Background mathematical notions Topological space A topology on a set X is a family O of subsets of X that satisfies the three following conditions: i) the empty set and X are elements of O, ii) any union of elements of O is an element of O, iii) any finite intersection of elements of O is an element of O. The set X together with the family O, whose elements are called open sets, is a topological space. A subset C of X is closed if its complement is an open set. A map f : X X between two topological spaces X and X is continuous if and only if the pre-image f 1 (O ) = {x X : f(x) O } of any open set O X is an open set of X. Equivalently, f is continuous if and only if the pre-image of any closed set in X is a closed set in X (exercise). A topological space X is a compact space if any open cover of X admits a finite subcover, i.e. for any family {U i } i I of open sets such that X = i I U i there exists a finite subset J I of the index set I such that X = j J U j.

Background mathematical notions Metric space A metric (or distance) on X is a map d : X X [0, + ) such that: i) for any x, y X, d(x, y) = d(y, x), ii) for any x, y X, d(x, y) = 0 if and only if x = y, iii) for any x, y, z X, d(x, z) d(x, y) + d(y, z). The set X together with d is a metric space. The smallest topology containing all the open balls B(x, r) = {y X : d(x, y) < r} is called the metric topology on X induced by d. Example: the standard topology in an Euclidean space is the one induced by the metric defined by the norm: d(x, y) = x y. Compacity: a metric space X is compact if and only if any sequence in X has a convergent subsequence. In the Euclidean case, a subset K R d (endowed with the topology induced from the Euclidean one) is compact if and only if it is closed and bounded (Heine-Borel theorem).

Background mathematical notions Shapes and Hausdorff distance In the first lectures : shape = compact subset of R d The distance function to a compact K R d, d K : R d R + is defined by d K (x) = inf p K x p The Hausdorf distance between two compact sets K, K R d : d H (K, K ) = sup x R d d K (x) d K (x) Exercise: Show that ( d H (K, K ) = max sup d K (y), sup y K z K d K (z) )

Distance functions and geometric inference The distance function to a compact K R d, d K : R d R + is defined by d K (x) = inf p K x p The Hausdorf distance between two compact sets K, K R d : d H (K, K ) = sup x R d d K (x) d K (x) The idea: Replace K and C by d K and d C Compare the topology of the offsets K r = d 1 K ([0, r]) and C r = d 1 C ([0, r])

Comparing topological spaces Homeomorphy and isotopy X and Y are homeomorphic if there exists a bijection h : X Y s. t. h and h 1 are continuous. X, Y R d are ambient isotopic if there exists a continuous map F : R d [0, 1] R d s. t. F (., 0) = Id R d, F (X, 1) = Y and t [0, 1], F (., t) is an homeomorphim of R d.

Comparing topological spaces Homotopy, homotopy type f 0 (x) = x homotopy equiv. f t (x) = (1 t)x not homotopy equiv. f 1 (x) = 0 homotopy equiv. Two maps f 0 : X Y and f 1 : X Y are homotopic if there exists a continuous map H : [0, 1] X Y s. t. x X, H(0, x) = f 0 (x) and H 1 (1, x) = f 1 (x). X and Y have the same homotopy type (or are homotopy equivalent) if there exists continuous maps f : X Y and g : Y X s. t. g f is homotopic to Id X and f g is homotopic to Id Y.

Comparing topological spaces Homotopy, homotopy type f 0 (x) = x homotopy equiv. f t (x) = (1 t)x not homotopy equiv. f 1 (x) = 0 homotopy equiv. If X Y and if there exists a continuous map H : [0, 1] X X s.t.: i) x X, H(0, x) = x, ii) x X, H(1, x) Y iii) y Y, t [0, 1], H(t, y) Y, then X and Y are homotopy equivalent. If one replaces condition iii) by y Y, t [0, 1], H(t, y) = y then H is a deformation retract of X onto Y.

Medial axis and critical points Γ K (x) Γ K (x) = {y K : d K (x) = d(x, y)} The Medial axis of K: M(K) = {x R d : Γ K (x) 2} x R d is a critical point of d K iff x is contained in the convex hull of Γ K (x). x K Exercise: What is the medial axis of a finite set of point K = {p 1, p n } R d? What are the critical points of d K?

Medial axis and critical points Γ K (x) Γ K (x) = {y K : d K (x) = d(x, y)} The Medial axis of K: M(K) = {x R d : Γ K (x) 2} x R d is a critical point of d K iff x is contained in the convex hull of Γ K (x). x K Theorem: [Grove, Cheeger,...] Let K R d be a compact set. if r is a regular value of d K, then d 1 K (r) is a topological submanifold of Rd of codim 1. Let 0 < r 1 < r 2 be such that [r 1, r 2 ] does not contain any critical value of d K. Then all the level sets d 1 K (r), r [r 1, r 2 ] are isotopic and is homeomorphic to d 1 K (r 1) (r 1, r 2 ]. K r 2 \ K r 1 = {x R d : r 1 < d K (x) r 2 }

Reach and weak feature size wfs(k) reach(k) M(K) K The reach of K, τ(k) is the smallest distance from M(K) to K: τ(k) = inf d K(y) y M(K) The weak feature size of K, wfs(k), is the smallest distance from the set of critical points of d K to K: wfs(k) = inf{d K (y) : y R d \ K and y crit. point of d K }

Reach, µ-reach and geometric inference (Not considered in this course - see course notes for details) Theorem: Let K R d be such that τ = τ(k) > 0 and let C R d be such that d H (K, C) < cτ for some (explicit) constant c. Then, for well-chosen (and explicit) r, C r is homotopy equivalent to K. More generally, for compact sets with positive µ-reach ( wfs(k) r µ (K) τ(k) ): Topological/geometric properties of the offsets of K are stable with respect to Hausdorff approximation: 1. Topological stability of the offsets of K (CCSL 06, NSW 06). 2. Approximate normal cones (CCSL 08). 3. Boundary measures (CCSM 07), curvature measures (CCSLT 09), Voronoi covariance measures (GMO 09).