IMIIMI

1

Approximation Theory

Metric:

Complicated Function

SignalImage

Solution to PDE

Simple Function

PolynomialsSplines

Rational Func

IMIIMI

2

1. Linear space of

dimension n.

2. Nonlinear manifold of

dimension n.

3. Highly nonlinear: Highly

redundant dictionary.

Functions g chosen from:

IMIIMI

3

Examples:

(i) -- Alg. poly. of degree .

(ii) -- Trig. poly. of degree .

(iii) Splines -- piecewise poly. of degree r, pieces.

(iv) span ,CONS

0 1

Linear: 1, 2 , . . . , n,. . .

IMIIMI

4

Nonlinear: n dimensional manifold

(i) : Rational function .

(ii) Splines with

(iii) - term approximation

CONS

free knots.

0 1

pieces

IN

IMIIMI

5

Highly Nonlinear

, arbitrary,

Bases B1, B2, . . . Bm, . . .

Bj best n-term

choose best basis choose n-term approximation

IMIIMI

6

Main Question

Characterize

We shall restrict ourselves toapproximation by piecewise constants in what follows.

IMIIMI

7

Linear

Theorem (DeVore-Richards) Fix

Piecewise Constants

0 11/n

.

close to

IMIIMI

8

Theorem (DeVore-Richards)

, ,

for .

IMIIMI

9

Noninear

Theorem (Kahane)

.

Linear Nonlinear

Know (Petrushev)

.

IMIIMI

10

n - term

Haar Basis0 1

1

-1

Dyadic Interval

I0 1

IMIIMI

11

CONS

IMIIMI

12

Theorem (DeVore-Jawerth-Popov)

known.

Simple strategy:

Choose n terms where

largest.

IMIIMI

13

Lin

ear

Nonlin

ear

IMIIMI

14

ApplicationImage Compression

Piecewise constant function

(Haar)

Threshold

Problem: Need to encode positions.

Dominate Bits

Image

IMIIMI

15

Tree Approximation

Cohen-Dahmen-Daubechies-DeVore:

are almost the same requirements.

IMIIMI

16

Generate tree as follows:

1) Threshold:

2) Complete to Tree:

3) Encode the subtree:

1

00 0 0

0

0

0

0 1

1 1

1 1

(Each bit tells whether the child is in the tree.)

IMIIMI

17

• Progressive

• Universal

• Optimal

• Burn In

Features of Tree Encoder

IMIIMI

18

Encoder

P BB B B B BP P0 00 1 10 11 2 20 21 22 . . .

Pk = Position Bits of

B { bit bjk = j of , }

IMIIMI

19

Cohen-Dahmen-DeVore

Elliptic Equation

Wavelet transform gives

- positive definite.

- has decay properties.

CDD gives an adaptive algorithm

IMIIMI

20

Theorem If , then

using n computations the adaptive algorithm produces :

Theorem If , then the

adaptive algorithm produces :

IMIIMI

21

Error:

“Error Indicators”:

Refinement: Let be the smallest

set of indices such that

residual

Define new set

.