The geometry and statistics of geometric trees Current Topic - - PowerPoint PPT Presentation

the geometry and statistics of geometric trees
SMART_READER_LITE
LIVE PREVIEW

The geometry and statistics of geometric trees Current Topic - - PowerPoint PPT Presentation

Dept. of Computer Science, University of Copenhagen The geometry and statistics of geometric trees Current Topic Workshop on Statistics, Geometry, and Combinatorics on Stratified Spaces arising from Biological Problems Mathematical Biosciences


slide-1
SLIDE 1
  • Dept. of Computer Science, University of Copenhagen

The geometry and statistics of geometric trees

Current Topic Workshop on Statistics, Geometry, and Combinatorics on Stratified Spaces arising from Biological Problems

Mathematical Biosciences Institute, Ohio, May 25 2012 Aasa Feragen aasa@diku.dk

slide-2
SLIDE 2

In collaboration with!

CPH Lung imaging The MDs! Can compute... Math and imaging

aasa@diku.dk,

slide-3
SLIDE 3

Introduction Airway shape modeling

Airway shape modeling

Starting point: What does the average human airway tree look like? Wanted: Parametric statistical model for trees, allowing variations in branch count, tree-topological structure and branch geometry

aasa@diku.dk,

slide-4
SLIDE 4

Introduction Airway shape modeling

Airway shape modeling

◮ Smoker’s lung (COPD) is caused by inhaling damaging

particles.

◮ Likely that damage made depends on airway geometry ◮ Reversely: COPD changes the airway geometry, e.g. airway

wall thickness.

◮ Geometry can help diagnosis/prediction.

aasa@diku.dk,

slide-5
SLIDE 5

Introduction Airway shape modeling

Airway shape modeling

Properties of airway trees:

◮ Topology, branch shape, branch radius ◮ Somewhat variable topology (combinatorics) in anatomical

tree

◮ Substantial amount of noise in segmented trees (missing or

spurious branches), especially in COPD patients, i.e. inherently incomplete data

aasa@diku.dk,

slide-6
SLIDE 6

Introduction Airway shape modeling

Airway shape modeling

Wanted properties:

Figure: Tolerance of structural noise.

aasa@diku.dk,

slide-7
SLIDE 7

Introduction Airway shape modeling

Airway shape modeling

Wanted properties:

Figure: Handling of internal structural differences.

aasa@diku.dk,

slide-8
SLIDE 8

Introduction Airway shape modeling

Airway shape modeling

We shall consider airway centerline trees embedded in R3.

aasa@diku.dk,

slide-9
SLIDE 9

Introduction Airway shape modeling

A little metric geometry – geodesics

◮ Let (X, d) be a metric space. The length of a curve

c : [a, b] → X is l(c) = supa=t0≤t1≤...≤tn=b

n−1

  • i=0

d(c(ti, ti+1)).

aasa@diku.dk,

slide-10
SLIDE 10

Introduction Airway shape modeling

A little metric geometry – geodesics

◮ Let (X, d) be a metric space. The length of a curve

c : [a, b] → X is l(c) = supa=t0≤t1≤...≤tn=b

n−1

  • i=0

d(c(ti, ti+1)).

◮ A geodesic from x to y in X is a path c : [a, b] → X such that

c(a) = x, c(b) = y and l(c) = d(x, y).

◮ (X, d) is a geodesic space if all pairs x, y can be joined by a

geodesic.

aasa@diku.dk,

slide-11
SLIDE 11

Introduction Airway shape modeling

Curvature in metric spaces

◮ A CAT(0) space is a metric space in which geodesic triangles

are ”thinner” than for their comparison triangles in the plane; that is, d(x, a) ≤ d(¯ x, ¯ a).

aasa@diku.dk,

slide-12
SLIDE 12

Introduction Airway shape modeling

Curvature in metric spaces

◮ A CAT(0) space is a metric space in which geodesic triangles

are ”thinner” than for their comparison triangles in the plane; that is, d(x, a) ≤ d(¯ x, ¯ a).

◮ A space has non-positive curvature if it is locally CAT(0).

aasa@diku.dk,

slide-13
SLIDE 13

Introduction Airway shape modeling

Curvature in metric spaces

◮ A CAT(0) space is a metric space in which geodesic triangles

are ”thinner” than for their comparison triangles in the plane; that is, d(x, a) ≤ d(¯ x, ¯ a).

◮ A space has non-positive curvature if it is locally CAT(0). ◮ (Similarly define curvature bounded by κ by using comparison

triangles in hyperbolic space or spheres of curvature κ.)

aasa@diku.dk,

slide-14
SLIDE 14

Introduction Airway shape modeling

Curvature in metric spaces

Example

a b c d a b c d a b c d a b c d a b c d a b c d

Theorem (see e.g. Bridson-Haefliger)

Let (X, d) be a CAT(0) space; then all pairs of points have a unique geodesic joining them. The same holds locally in CAT(κ) spaces, κ = 0.

aasa@diku.dk,

slide-15
SLIDE 15

Introduction Airway shape modeling

Statistics in metric spaces?

Theorem (Sturm)

Frechet means are unique in CAT(0) spaces. Other midpoint-finding algorithms also converge in CAT(0) spaces:

◮ centroid (BHV) ◮ Birkhoff shortening ◮ circumcenters

aasa@diku.dk,

slide-16
SLIDE 16

Introduction Airway shape modeling

Plan of action?

◮ Tree representation where size, topology and edge geometry

can be consistently and simultaneously compared

◮ Geodesic metric tree-space!

Airway tree-space

◮ Do statistics in this space (CAT(0)-ish space?)

aasa@diku.dk,

slide-17
SLIDE 17

Introduction Airway shape modeling

A space of tree-like shapes: Intuition

aasa@diku.dk,

What would a path-connected space of deformable trees look like?

◮ Easy: Trees with same topology in their own ”component” ◮ Harder: How are the components connected? ◮ Solution: glue collapsed trees, deforming one topology to another ◮ Stratified space, self intersections

slide-18
SLIDE 18

Introduction Airway shape modeling

A space of tree-like shapes: Intuition

The tree-space has conical ”bubbles”

a a a a c c c e e e d d d b b b b Path 1 Path 2 T ree 1 T ree 2

a c e d b a e b a c d b a c e d b

aasa@diku.dk,

slide-19
SLIDE 19

A space of geometric trees

Classical example: Tree edit distance (TED)

◮ TED is a classical, algorithmic distance ◮ tree-space with TED is a nonlinear metric space ◮ dist(T1, T2) is the minimal total cost of changing T1 into T2

through three basic operations:

◮ Remove edge, add edge, deform edge.

aasa@diku.dk,

slide-20
SLIDE 20

A space of geometric trees

Classical example: Tree edit distance (TED)

◮ TED is a classical, algorithmic distance ◮ tree-space with TED is a nonlinear metric space ◮ dist(T1, T2) is the minimal total cost of changing T1 into T2

through three basic operations:

◮ Remove edge, add edge, deform edge.

aasa@diku.dk,

slide-21
SLIDE 21

A space of geometric trees

Classical example: Tree edit distance (TED)

◮ TED is a classical, algorithmic distance ◮ tree-space with TED is a nonlinear metric space ◮ dist(T1, T2) is the minimal total cost of changing T1 into T2

through three basic operations:

◮ Remove edge, add edge, deform edge.

aasa@diku.dk,

slide-22
SLIDE 22

A space of geometric trees

Classical example: Tree edit distance (TED)

◮ Tree-space with TED is a geodesic space, but almost all

geodesics between pairs of trees are non-unique (infinitely many).

◮ Then what is the average of two trees? Many! ◮ Tree-space with TED has everywhere unbounded curvature. ◮ TED is not suitable for statistics.

aasa@diku.dk,

slide-23
SLIDE 23

A space of geometric trees

Classical example: Tree edit distance (TED)

Many state-of-the-art approaches to distance measures and statistics on tree- and graph-structured data are based on TED!

◮ Ferrer, Valveny, Serratosa, Riesen, Bunke: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recognition 43 (4), 2010. ◮ Riesen and Bunke: Approximate Graph Edit Distance by means of Bipartite Graph Matching. Image and Vision Computing 27 (7), 2009. ◮ Trinh and Kimia, Learning Prototypical Shapes for Object Categories. CVPR workshops 2010.

aasa@diku.dk,

slide-24
SLIDE 24

A space of geometric trees

Classical example: Tree edit distance (TED)

The problems can be ”solved” by choosing specific geodesics. OBS! Geometric methods can no longer be used for proofs, and

  • ne risks choosing problematic paths.

Figure: Trinh and Kimia (CVPR workshops 2010) compute average shock graphs using TED with the simplest possible choice of geodesics.

aasa@diku.dk,

slide-25
SLIDE 25

A space of geometric trees

Build a tree-space: Tree representation

How to represent geometric trees mathematically? Tree-like (pre-)shape = pair (T , x)

◮ T = (V , E, r, <) rooted, ordered/planar binary tree,

describing the tree topology (combinatorics)

◮ x ∈ e∈E A, each coordinate in an attribute space A

describing edge shape

aasa@diku.dk,

slide-26
SLIDE 26

A space of geometric trees

Build a tree-space: Tree representation

We are allowing collapsed edges, which means that

◮ we can represent higher order vertices ◮ we can represent trees of different sizes using the same

combinatorial tree T (dotted line = collapsed edge = zero/constant attribute)

aasa@diku.dk,

slide-27
SLIDE 27

A space of geometric trees

Build a tree-space: Tree representation

aasa@diku.dk,

◮ Edge representation through landmark points: ◮ Edge shape space is (Rd)n, d = 2, 3. ◮ (For most results, this can be generalized to other

vector spaces)

slide-28
SLIDE 28

A space of geometric trees

The space of tree-like preshapes

First: T an infinite, ordered (planar), rooted binary tree

Definition

Define the space of tree-like pre-shapes as the direct sum

  • e∈E

(Rd)n where (Rd)n is the edge shape space. This is just a space of pre-shapes.

aasa@diku.dk,

slide-29
SLIDE 29

A space of geometric trees

From pre-shapes to shapes

Many shapes have more than one representation

aasa@diku.dk,

slide-30
SLIDE 30

A space of geometric trees

From pre-shapes to shapes

Not all shape deformations can be recovered as natural paths in the pre-shape space:

aasa@diku.dk,

slide-31
SLIDE 31

A space of geometric trees

Shape space definition

◮ Start with the pre-shape space X = e∈E(Rd)n. ◮ Define an equivalence ∼ by identifying points in X that

represent the same tree-shape.

◮ This corresponds to identifying, or gluing together, subspaces

{x ∈ X|xe = 0 if e / ∈ E1} and {x ∈ X|xe = 0 if e / ∈ E2} in X.

◮ The space of ordered (planar) tree-like shapes ¯

X = X/ ∼ is a folded vector space.

aasa@diku.dk,

slide-32
SLIDE 32

A space of geometric trees

Shape space definition

Remark

◮ Tree-shape definition a little unorthodox: we do not factor out

scale and rotation of the tree.

◮ Our data (segmented airway trees) are incomplete; the

number of segmented branches is unstable and depends on the health of the patient.

aasa@diku.dk,

slide-33
SLIDE 33

Tree-space geometry

Definition of metric on tree-space

Given a metric d on the vector space X =

e∈E(Rd)n we define

the quotient pseudometric ¯ d on the quotient space ¯ X = X/ ∼ by setting ¯ d(¯ x, ¯ y) = inf k

  • i=1

d(xi, yi)|x1 ∈ ¯ x, yi ∼ xi+1, yk ∈ ¯ y

  • .

(1)

Theorem

The quotient pseudometric ¯ d is a metric on ¯ X.

aasa@diku.dk,

slide-34
SLIDE 34

Tree-space geometry

Definition of metric on tree-space

◮ Two metrics on ¯

X from two product norms on X =

e∈E(Rd)n:

l1 norm: d1(x, y) =

e∈E xe − ye

l2 norm: d2(x, y) =

  • e∈E xe − ye2

◮ ¯

d1 = Tree Edit Distance

◮ Terminology: ¯

d2 = QED (Quotient Euclidean Distance) metric.

Theorem

Let ¯ d = ¯ d1 or ¯

  • d2. Then ( ¯

X, ¯ d) is a geodesic space.

aasa@diku.dk,

slide-35
SLIDE 35

Tree-space geometry

Unordered trees

◮ Give each tree a random order ◮ Denote by G the group of reorderings of the edges (in T )

that do not alter the connectivity of the tree.

◮ The space of spatial/unordered trees is the space ¯

¯ X = ¯ X/G

◮ Give ¯

¯ X the quotient pseudometric ¯ ¯ d.

◮ ¯

¯ d(¯ ¯ x, ¯ ¯ y) chooses the order that minimizes ¯ ¯ d(¯ ¯ x, ¯ ¯ y).

Theorem

For the quotient pseudometric ¯ ¯ d induced by either ¯ d1 or ¯ d2, the function ¯ ¯ d is a metric and ( ¯ ¯ X, ¯ ¯ d) is a geodesic space.

aasa@diku.dk,

slide-36
SLIDE 36

Tree-space geometry

Distances between airways?

Evaluation of metric: Approximate geodesic distances between 30 airways of healthy individuals and individuals with moderate COPD.

−250 −200 −150 −100 −50 50 100 150 200 250 −150 −100 −50 50 100 150

aasa@diku.dk,

slide-37
SLIDE 37

Tree-space geometry

Curvature of shape space?

◮ This space has everywhere unbounded curvature!

aasa@diku.dk,

slide-38
SLIDE 38

Tree-space geometry

Curvature of shape space?

◮ This space has everywhere unbounded curvature! ◮ Oh dear.

aasa@diku.dk,

slide-39
SLIDE 39

Tree-space geometry

Complexity of computing geodesics?

Assume edge attributes have dimension > 1 (for dim = 1, Scott Provan).

Theorem

Computing QED geodesics is NP complete.

... ...

= =

aasa@diku.dk,

slide-40
SLIDE 40

Tree-space geometry

Complexity of computing geodesics?

Assume edge attributes have dimension > 1 (for dim = 1, Scott Provan).

Theorem

Computing QED geodesics is NP complete.

... ...

= =

Oh dear.

aasa@diku.dk,

slide-41
SLIDE 41

Tree-space geometry

First set of assumptions:

◮ Assume: underlying rooted, ordered, binary tree T is

finite.

◮ Study the new shape space ¯

X.

aasa@diku.dk,

slide-42
SLIDE 42

Tree-space geometry

Curvature of shape space

Theorem

◮ Consider ( ¯

X, ¯ d2) and ( ¯ ¯ X, ¯ ¯ d2), ordered/unordered tree-shape space.

◮ At generic points, the space is locally CAT(0). ◮ Its geodesics are locally unique at generic points. ◮ At non-generic points, the curvature is unbounded.

aasa@diku.dk,

slide-43
SLIDE 43

Tree-space geometry

Curvature of shape space

In fact, curvature is one of:

◮ +∞ ◮ 0 ◮ −∞

quotient quotient

=

Figure: Space of ordered/unordered trees with at most 2 edges

aasa@diku.dk,

slide-44
SLIDE 44

Tree-space geometry

How much better did it get?

◮ How local is ”local”? ◮ The CAT(0) neighborhoods in ¯

X now mainly consist of trees with the topology T .

◮ Transitions such as

do not take place in CAT(0) neighborhoods.

◮ Computational complexity? Still NP complete.

aasa@diku.dk,

slide-45
SLIDE 45

Tree-space geometry

Second set of assumptions:

◮ Restrict to: all representations of certain restricted tree

topologies.

◮ Example 1: Restrict to the set ¯

¯ XN of trees with N leaves.

◮ Example 2: Restrict to all topologies occuring in airway trees.

aasa@diku.dk,

slide-46
SLIDE 46

Tree-space geometry

How much better did it get?

◮ The CAT(0) neighborhoods are now larger and can contain

different top-dimensional tree topologies.

◮ Computational complexity? Still NP complete.

aasa@diku.dk,

slide-47
SLIDE 47

Tree-space geometry

We can compute means!

Leaf vasculature data:

Figure: A set of vascular trees from ivy leaves form a set of planar tree-shapes. Figure: a): The vascular trees are extracted from photos of ivy leaves. b) The mean vascular tree.

aasa@diku.dk,

slide-48
SLIDE 48

Tree-space geometry

We can compute means!

The mean upper airway tree1

Figure: A set of upper airway tree-shapes along with their mean tree-shape.

1Feragen et al, Means in spaces of treelike shapes, ICCV2011 aasa@diku.dk,

slide-49
SLIDE 49

Tree-space geometry

We can compute means!

Figure: A set of upper airway tree-shapes (projected).1

QED TED

Figure: The QED and TED (algorithm by Trinh and Kimia) means.

1Feragen et al, Towards a theory of statistical tree-shape analysis, submitted aasa@diku.dk,

slide-50
SLIDE 50

Tree-space geometry

Third (a) set of assumptions

◮ Order your edges: Left-right for each set of siblings ◮ For the L1 distances (TED), there are now polynomial time

algorithms for distance.

◮ Open question: QED? ◮ Too restrictive for our data!

aasa@diku.dk,

slide-51
SLIDE 51

Tree-space geometry

Property of airways

The first 6-8 generations of the airway tree are ”similar” in different people. NB!: Not all present in all people; not all present in all segmentations.

aasa@diku.dk,

slide-52
SLIDE 52

Tree-space geometry

Third (b) set of assumptions

◮ Label the ”leaves” of your trees and insist that all trees have

the same leaf label set.

◮ Vector version of the phylogenetic tree-space. ◮ Polynomial time algorithms ◮ Also: Factor out leaf labels via leaf permutation group NP

complete.

aasa@diku.dk,

slide-53
SLIDE 53

Tree-space geometry

Mean airway tree

Joint with Megan Owen.

aasa@diku.dk,

slide-54
SLIDE 54

Tree-space geometry

Heuristic for geodesic airway branch labeling2

Idea:

◮ Generate leaf label configurations and the corresponding tree

spanning the labels

R7 R8 R9 R10 R7 R8 R9 R10

◮ Evaluate configuration in comparison with training data using

geodesic deformations between leaf-labeled airway trees (Owen, Provan)

2F., Petersen, Owen, Lo, Thomsen, Dirksen, Wille, de Bruijne, A hierarchical

scheme for geodesic anatomical labeling of airway trees, MICCAI 2012.

aasa@diku.dk,

slide-55
SLIDE 55

Tree-space geometry

Heuristic for geodesic airway branch labeling2

Idea:

◮ Make tractable using a hierarchical labeling scheme

LLB Trachea LMB L6 LUL L2 L3 L1 L4+5 L4 L5 L8 L9 L10 RMB RUL R1 R3 R2 BronchInt R6 R4 R5 R7 R8 R9 R10 L7 RLL LLB Trachea LMB L6 LUL L2 L3 L1 L4+5 L4 L5 RMB RUL R1 R3 R2 BronchInt R6 R4 R5 RLL LLB Trachea LMB L6 LUL L2 L3 L1 L4+5 L4 L5 RMB RUL R1 R3 R2 BronchInt R6 R4 R5 RLL LLB Trachea LMB L6 LUL L2 L3 L1 L4+5 L4 L5 RMB RUL R1 R3 R2 BronchInt R6 R4 R5 RLL

search 3 generations search 2 and 2 generations search 2, 2, 2 and 3 generations search 3 and 2 generations

R7 R8 R9 R10 R7 R8 R9 R10 R7 R8 R9 R10 L8 L9 L10 L7 L8 L9 L10 L7 L8 L9 L10 L7

2F., Petersen, Owen, Lo, Thomsen, Dirksen, Wille, de Bruijne, A hierarchical

scheme for geodesic anatomical labeling of airway trees, MICCAI 2012.

aasa@diku.dk,

slide-56
SLIDE 56

Tree-space geometry

Heuristic for geodesic airway branch labeling3

◮ 40 airway trees from 20 subjects with different stages of

COPD, hand labeled by 3 experts in pulmonary medicine.

◮ All 20 segmental labels were assigned (segmental = most

distal branches) at an average success rate of 72.8%.

◮ Performance: as good as the performance of an expert in

pulmonary medicine.

◮ Not significanly correlated with stage of COPD.

3Feragen et al, A hierarchical scheme for geodesic anatomical labeling of

airway trees, MICCAI 2012.

aasa@diku.dk,

slide-57
SLIDE 57

Tree-space geometry

What did we just do?

◮ Used leaf-labeled tree distance ◮ Coincides with QED distances when

◮ QED geodesic induces same leaf matching as the leaf labelings ◮ Everything below the leaves is dropped ◮ Everything dropped above the leaves is considered noise

R7 R8 R9 R10 R7 R8 R9 R10 ◮ Used right, this can be used as a heuristic to compute

unordered, unlabeled tree distance via phylogenetic tree distance

◮ Heuristic takes care of noise above the leaf level.

aasa@diku.dk,

slide-58
SLIDE 58

Tree-space geometry

Conclusion

◮ Unlabeled, unordered tree distances are NP hard ◮ Unlabeled, unordered trees live in spaces of unbounded

curvature

◮ Adding assumptions gives some bounds on curvature and

complexity, but decreases the ability to represent the data

aasa@diku.dk,

slide-59
SLIDE 59

Tree-space geometry

Open question

◮ Conjecture 1: Given a tree T1, for a generic tree T2, there is a

unique geodesic joining them

◮ Conjecture 2: CAT(0) generic CAT(0) – unique means for

generic datasets?

aasa@diku.dk,