Obstructions to Compatible Extensions of Mappings Duke University Joint with John Harer Jose Perea.

Slides:



Advertisements
Similar presentations
On Comparing Classifiers : Pitfalls to Avoid and Recommended Approach
Advertisements

Ch 2 section 3 review study helper Scientific Illustrations Photographs and drawings model and illustrate ideas and sometimes make new information clearer.
2nd level analysis in fMRI
1 Chapter 20: Statistical Tests for Ordinal Data.
On Complexity, Sampling, and -Nets and -Samples. Range Spaces A range space is a pair, where is a ground set, it’s elements called points and is a family.
Naïve Bayes. Bayesian Reasoning Bayesian reasoning provides a probabilistic approach to inference. It is based on the assumption that the quantities of.
1 A camera is modeled as a map from a space pt (X,Y,Z) to a pixel (u,v) by ‘homogeneous coordinates’ have been used to ‘treat’ translations ‘multiplicatively’
CSE 486/586, Spring 2012 CSE 486/586 Distributed Systems Consensus Steve Ko Computer Sciences and Engineering University at Buffalo.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
1 Index Coding Part II of tutorial NetCod 2013 Michael Langberg Open University of Israel Caltech (sabbatical)
Degenerations of algebras. José-Antonio de la Peña UNAM, México Advanced School and Conference on Homological and Geometrical Methods in Representation.
Conceptualization and Measurement
1 State Assignment Using Partition Pairs 2  This method allows for finding high quality solutions but is slow and complicated  Only computer approach.
COUNTING AND PROBABILITY
Quantum Theory of What? What does quantum theory describe?
From: Probabilistic Methods for Bioinformatics - With an Introduction to Bayesian Networks By: Rich Neapolitan.
1 Undecidability Andreas Klappenecker [based on slides by Prof. Welch]
SUMS OF RANDOM VARIABLES Changfei Chen. Sums of Random Variables Let be a sequence of random variables, and let be their sum:
Chapter 5 Part II 5.3 Spread of Data 5.4 Fisher Discriminant.
Wilson-’t Hooft operators and the theta angle Måns Henningson Chalmers University of Technology.
1 Department of Computer Science and Engineering, University of South Carolina Issues for Discussion and Work Jan 2007  Choose meeting time.
1 Analysis of Autonomous Multiagent Formations From Rigidity to Persistence DSTO-NICTA Meeting 22 July 2005 Brad C. YU National ICT Australia Limited.
Definition and Properties of the Cost Function
Chapter 5 Objectives 1. Find ordered pairs associated with two equations 2. Solve a system by graphing 3. Solve a system by the addition method 4. Solve.
1 10. Joint Moments and Joint Characteristic Functions Following section 6, in this section we shall introduce various parameters to compactly represent.
Copyright © Cengage Learning. All rights reserved. CHAPTER Right Triangle Trigonometry Right Triangle Trigonometry 2.
Chapter 5 Linear Inequalities and Linear Programming Section 2 Systems of Linear Inequalities in Two Variables.
Nonparametrics and goodness of fit Petter Mostad
Chapter 9 Title and Outline 1 9 Tests of Hypotheses for a Single Sample 9-1 Hypothesis Testing Statistical Hypotheses Tests of Statistical.
Chapter 3: Rational Numbers
1 7.1 Discrete Fourier Transform (DFT) 7.2 DFT Properties 7.3 Cyclic Convolution 7.4 Linear Convolution via DFT Chapter 7 Discrete Fourier Transform Section.
Alternative Measures of Risk. The Optimal Risk Measure Desirable Properties for Risk Measure A risk measure maps the whole distribution of one dollar.
 qT4 qT4  txh/mc_txh3_002.html.
Math 3121 Abstract Algebra I Section 0: Sets. The axiomatic approach to Mathematics The notion of definition - from the text: "It is impossible to define.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
LURE 2009 SUMMER PROGRAM John Alford Sam Houston State University.
Flows and Networks Plan for today (lecture 4): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
Pythagorean Theorem. Pythagoras of Samos Birth: 570 B.C.E Samos, Greece Death: 495 B.C.E.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
1.6 Compound and Absolute Value Inequalities Compound inequalities are just more than one inequality at the same time. Sometimes, they are connected by.
Thinking Architecturally An information theory and complex system viewpoint.
CS 611: Lecture 6 Rule Induction September 8, 1999 Cornell University Computer Science Department Andrew Myers.
MA/CSSE 474 Theory of Computation Decision Problems DFSMs.
Using Substitution – Solve the system of linear equations. 1.
Key Concepts and Themes of Geography Chapter 1 section 1.
Chapter Integration of substitution and integration by parts of the definite integral.
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
Produced in cooperation with: HP Technology Forum & Expo 2009 © 2009 Hewlett-Packard Development Company, L.P. The information contained herein is subject.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
The Further Mathematics network
Flows and Networks Plan for today (lecture 3): Last time / Questions? Output simple queue Tandem network Jackson network: definition Jackson network: equilibrium.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
11-5 Linkage and Gene Maps.
Psychology 202a Advanced Psychological Statistics
Automatically trivial fibrations
Mathematical Descriptions of Systems
Vapnik–Chervonenkis Dimension
Unsupervised learning
9 Tests of Hypotheses for a Single Sample CHAPTER OUTLINE
Limits and Continuity A BRIEF PREVIEW OF CALCULUS: TANGENT LINES AND THE LENGTH OF A CURVE 1.2 THE CONCEPT OF LIMIT 1.3 COMPUTATION OF LIMITS 1.4.
COUNTING AND PROBABILITY
TOPOLOGICAL COMPLEXITY OF KINEMATIC MAPS
CSCI B609: “Foundations of Data Science”
Markov Networks Independencies Representation Probabilistic Graphical
Section 11-1 Review and Preview
The so-called “classical probability concept” is nothing more than what you’ve heard before called “equally likely outcomes”... In many experiments, the.
Section 8.1 – 8.2 Geometric Mean Pythagorean Theorem
EE384Y: Packet Switch Architectures II
Presentation transcript:

Obstructions to Compatible Extensions of Mappings Duke University Joint with John Harer Jose Perea

June 1994 Monday (05/26/2014)

June 1994 Incremental ‘s Monday (05/26/2014)

June 1994 Incremental ‘s Monday (05/26/2014)

June 1994 Incremental ‘s 2002 Topological Persistence Monday (05/26/2014)

June 1994 Incremental ‘s 2002 Topological Persistence 2005 Computing P.H. Monday (05/26/2014)

June 1994 Incremental ‘s 2002 Topological Persistence 2005 Computing P.H Extended Persistence Monday (05/26/2014)

June 1994 Incremental ‘s 2002 Topological Persistence 2005 Computing P.H Extended Persistence 2009 Zig-Zag Persistence … Monday (05/26/2014)

June 1994Monday (05/26/2014) Incremental ‘s 2002 Topological Persistence 2005 Computing P.H Extended Persistence 2009 Zig-Zag Persistence

What have we learned? Study the whole multi-scale object at once Is not directionality, but compatible choices … …

For Point-cloud data: 1.Encode multi-scale information in a filtration-like object 2.Make compatible choices across scales 3.Rank significance of such choices

To leverage the power of the relative-lifting paradigm and the language of obstruction theory The Goal:

To leverage the power of the relative-lifting paradigm and the language of obstruction theory The Goal: For data analysis!

Why do we care?

Useful concepts/invariants can be interpreted this way: 1.The retraction problem: 2.Extending sections: 3.Characteristic classes.

Back to Point-clouds: Model fitting

Example (model fitting): (3-circle model) (Klein bottle model) Mumford Data

Model fitting Only birth-like events

Local to global Example: Compatible extensions of sections

Local to global Only death-like events

Local to global Model fitting

Combine the two: The compatible-extension problem

How do we set it up?

Definition : The diagram Extends compatibly, if there exist extensions of the so that.

For instance :

Let be the tangent bundle over, and fix classifying maps If then, where Thus, Extend separately but not compatibly

Let be the tangent bundle over, and fix classifying maps If then, where Thus, Extend separately but not compatibly

Let be the tangent bundle over, and fix classifying maps If then, where Thus, Extend separately but not compatibly

Let be the tangent bundle over, and fix classifying maps If then, where Thus, Extend separately but not compatibly

Observation: Relative lifting problem up to homotopy rel Compatible extension problem

How do we solve it?

Solving the classic extension problem: The set-up Assume Want

Solving the classic extension problem: The set-up Assume Want

Solving the classic extension problem: The set-up Assume Want

Solving the classic extension problem: Assume Want The obstruction cocycle

is a cocycle, and if and only if extends. Moreover, if for some then there exists a map so that on, and Theorem

is a cocycle, and if and only if extends. Moreover, if for some then there exists a map so that on, and Theorem

Solving the compatible extension problem: The set-up Assume

Let for some. Then is a cocycle, which is zero if and only if Theorem I (Perea, Harer)

Theorem II (Perea, Harer) Let. If for, then and extend compatibly.

The upshot: Once we fix so that, then parametrizes the redefinitions of that extend. Moreover, if a pair, satisfies then the redefinitions of and via and, extend compatibly.

The upshot: Once we fix so that, then parametrizes the redefinitions of that extend. Moreover, if a pair, satisfies then the redefinitions of and via and, extend compatibly.

Putting everything together

… … … … …

Example

Can we actually compute this thing?

* Some times

Coming soon: Applications to database consistency Topological model fitting Bargaining/consensus in social networks

Thanks!!