Jubilee of Fourier Analysis and Applications In Celebration of John - - PowerPoint PPT Presentation

jubilee of fourier analysis and applications in
SMART_READER_LITE
LIVE PREVIEW

Jubilee of Fourier Analysis and Applications In Celebration of John - - PowerPoint PPT Presentation

The Cumulative Distribution Transform For Data Analysis And Machine Learning Akram Aldroubi Vanderbilt University Jubilee of Fourier Analysis and Applications In Celebration of John Benedetto 80th Birthday Typeset by Foil T EX Jubilee-


slide-1
SLIDE 1

The Cumulative Distribution Transform For Data Analysis And Machine Learning Akram Aldroubi Vanderbilt University

Jubilee of Fourier Analysis and Applications In Celebration of John Benedetto 80th Birthday

– Typeset by FoilT EX –

slide-2
SLIDE 2

Jubilee- 2019

Supported by NIH Grant (Gustavo Rohde PI) Gustavo Rohde

– Typeset by FoilT EX – Akram Aldroubi

slide-3
SLIDE 3

Jubilee- 2019

Transports Transform

Transforms: Fourier Transform, Wavelet transform, Zak Transform, Shearlets, Scattering “transform,”...

– Typeset by FoilT EX – Akram Aldroubi

slide-4
SLIDE 4

Jubilee- 2019

Transports Transform

Transforms: Fourier Transform, Wavelet transform, Zak Transform, Shearlets, Scattering “transform,”... Transport Transforms: Non-linear transforms based

  • n

transport theory: Monge and Katorovich Transport theory

– Typeset by FoilT EX – Akram Aldroubi

slide-5
SLIDE 5

Jubilee- 2019

The Monge Problem (1781)

The Monge Problem Let µ be a pile of sand on X ⊂ Rn, find the ”most efficient way” to transport it to the hole in the ground ν on X ⊂ Rn.

– Typeset by FoilT EX – Akram Aldroubi

slide-6
SLIDE 6

Jubilee- 2019

The Monge Problem (1781)

The Monge Problem Let µ be a pile of sand on X ⊂ Rn, find the ”most efficient way” to transport it to the hole in the ground ν on X ⊂ Rn. Let µ, ν be probability measures on Rn find a map T † : Rn → Rn such T † = arg min

ν=T#µ

  • Rn x − T(x)2dµ(x),

where ν(B) = µ(T −1(B)) for all measurable measurable sets B.

– Typeset by FoilT EX – Akram Aldroubi

slide-7
SLIDE 7

Jubilee- 2019

The Monge Problem (1781)

The Monge Problem Let µ be a pile of sand on X ⊂ Rn, find the ”most efficient way” to transport it to the hole in the ground ν on X ⊂ Rn. Let µ, ν be probability measures on Rn find a map T † : Rn → Rn such T † = arg min

ν=T#µ

  • Rn x − T(x)2dµ(x),

where ν(B) = µ(T −1(B)) for all measurable measurable sets B. Weak version

  • f

the Monge problem: The Kantorovich problem (1939).

– Typeset by FoilT EX – Akram Aldroubi

slide-8
SLIDE 8

Jubilee- 2019

Brenier’s Theorem (1991)

(Brenier’s Theorem) Let µ, ν be two probability measures on Rn (finite 2nd moments) that are absolutely continuous w.r.t Lebesgue measure. Then there exists a map T † : Rn → Rn such that T † = arg min

ν=T#µ

  • Rn x − T(x)2dµ(x),

where ν(B) = µ(T −1(B)) for all measurable measurable sets B. Moreover, T † is unique. (Generalization by Gangbo and McCann 1996, Villani 2006)

– Typeset by FoilT EX – Akram Aldroubi

slide-9
SLIDE 9

Jubilee- 2019

Brenier’s Theorem (1991)

(Brenier’s Theorem) Let µ, ν be two probability measures on Rn (finite 2nd moments) that are absolutely continuous w.r.t Lebesgue measure. Then there exists a map T † : Rn → Rn such that T † = arg min

ν=T#µ

  • Rn x − T(x)2dµ(x),

where ν(B) = µ(T −1(B)) for all measurable measurable sets B. Moreover, T † is unique. (Generalization by Gangbo and McCann 1996, Villani 2006) The transport transform: Let dµ(x) = s(x)dx and dν(x) = s0(x)dx, where r is a fixed reference signal, then the transform ˜ s of s is the unique solution to the Monge problem above, i.e., ˜ s = T †.

– Typeset by FoilT EX – Akram Aldroubi

slide-10
SLIDE 10

Jubilee- 2019

The CDT transform

Let s a smooth probability density function on [0, 1] ⊂ R, and s0 a reference probability density function on [0, 1] ⊂ R. The Cumulative Distribution Transform

˜ s(x)

  • s(ξ)dξ =

x

  • s0(ξ)dξ,

x ∈ [0, 1].

– Typeset by FoilT EX – Akram Aldroubi

slide-11
SLIDE 11

Jubilee- 2019

The CDT transform

Let s a smooth probability density function on [0, 1] ⊂ R, and s0 a reference probability density function on [0, 1] ⊂ R. The Cumulative Distribution Transform

˜ s(x)

  • s(ξ)dξ =

x

  • s0(ξ)dξ,

x ∈ [0, 1]. Typically s0 = χ[0, 1].

– Typeset by FoilT EX – Akram Aldroubi

slide-12
SLIDE 12

Jubilee- 2019

The CDT transform

Let s a smooth probability density function on [0, 1] ⊂ R, and s0 a reference probability density function on [0, 1] ⊂ R. The Cumulative Distribution Transform

˜ s(x)

  • s(ξ)dξ =

x

  • s0(ξ)dξ,

x ∈ [0, 1]. Typically s0 = χ[0, 1]. Inverse Transform: ˜ s′(x)s(˜ s(x)) = s0(x).

– Typeset by FoilT EX – Akram Aldroubi

slide-13
SLIDE 13

Jubilee- 2019

CDT and its inverse

– Typeset by FoilT EX – Akram Aldroubi

slide-14
SLIDE 14

Jubilee- 2019

Radon-CDT

– Typeset by FoilT EX – Akram Aldroubi

slide-15
SLIDE 15

Jubilee- 2019

Convexification properties

Ts : R → L2(R): Ts(µ)(x) = sµ(x) = s(x − µ).

– Typeset by FoilT EX – Akram Aldroubi

slide-16
SLIDE 16

Jubilee- 2019

Convexification properties

– Typeset by FoilT EX – Akram Aldroubi

slide-17
SLIDE 17

Jubilee- 2019

Convexification properties

– Typeset by FoilT EX – Akram Aldroubi

slide-18
SLIDE 18

Jubilee- 2019

Wasserstein distance between two measures

Let Π(µ, ν) be the set of all probability measures on Rn × Rn with marginals µ and ν. 2-Wasserstein distance between µ and ν: W 2

2 (µ, ν) = min π∈Π

  • Rn x − y2dπ(x, y).

– Typeset by FoilT EX – Akram Aldroubi

slide-19
SLIDE 19

Jubilee- 2019

Wasserstein distance between two measures

Let Π(µ, ν) be the set of all probability measures on Rn × Rn with marginals µ and ν. 2-Wasserstein distance between µ and ν: W 2

2 (µ, ν) = min π∈Π

  • Rn x − y2dπ(x, y).

Existence of a minimizer is due to Kantorovich.

– Typeset by FoilT EX – Akram Aldroubi

slide-20
SLIDE 20

Jubilee- 2019

Wasserstein distance between two measures

Let Π(µ, ν) be the set of all probability measures on Rn × Rn with marginals µ and ν. 2-Wasserstein distance between µ and ν: W 2

2 (µ, ν) = min π∈Π

  • Rn x − y2dπ(x, y).

Existence of a minimizer is due to Kantorovich. The solution T † of the transport map of the Monge problem give rise to the minimizer to the Kantorovich problem: d(µ(x)δ(y = T †(x)) ∈ Π and minimizes W2(µ, ν).

– Typeset by FoilT EX – Akram Aldroubi

slide-21
SLIDE 21

Jubilee- 2019

Wasserstein distance between two measures

Theorem (Kolouri, Rohde ) Let s1 and s2 be two signals (PDFs) and ˜ s1, ˜ s2 be their CDT transform with respect to fixed reference s0. Then ˜ s2 − ˜ s12

L2(Rn) = W2(µ, ν) = min π∈Π

  • Rn x − y2dπ(x, y)

where dµ(x) = s1(x)dx and dν = s2(x)dx.

– Typeset by FoilT EX – Akram Aldroubi

slide-22
SLIDE 22

Jubilee- 2019 – Typeset by FoilT EX – Akram Aldroubi

slide-23
SLIDE 23

Jubilee- 2019

Applications

– Typeset by FoilT EX – Akram Aldroubi

slide-24
SLIDE 24

Jubilee- 2019

Applications

– Typeset by FoilT EX – Akram Aldroubi

slide-25
SLIDE 25

Jubilee- 2019

Applications

– Typeset by FoilT EX – Akram Aldroubi

slide-26
SLIDE 26

Jubilee- 2019 – Typeset by FoilT EX – Akram Aldroubi

slide-27
SLIDE 27

Jubilee- 2019 – Typeset by FoilT EX – Akram Aldroubi

slide-28
SLIDE 28

Jubilee- 2019

Happy Birthday Caro

– Typeset by FoilT EX – Akram Aldroubi