<< Chapter < Page Chapter >> Page >

Suppose f is piecewise Lipschitz and f k ia a piecewise constant.

| f ( t ) - f k ( t ) | Δ

where Δ is a constant equal to average of f on right and left side of discontinuity in this interval.

| | f - f k | | L 2 2 = O ( k - 1 )

where k - 1 is the width of the interval. Notice this rate is quite slow.

This problem naturally suggests the following remedy: use very small intervals near discontinuities and larger intervals insmooth regions. Specifically, suppose we use intervals of width k - 2 α to contain the discontinuities and the intervals ofwidth k - 1 elsewhere. Then accordingly piecewise polynomial approximation f ˜ k satisfies

| | f - f ˜ k | | L 2 2 = O ( k - 2 α ) .

We can accomplish this need for "adaptive resolution" or "multiresolution" using recursive partitions and trees.

Recursive dyadic partitions

We discussed this idea already in our examination of classification trees. Here is the basic idea again, graphically.

Complete and pruned RDP along with their correspnding tree structures.

Consider a function f B α ( C α ) that contains no more than m points of discontinuity, and is H α ( C α ) away from these points.

Lemma

Consider a complete RDP with n intervals, then there exists anassociated pruned RDP with O ( k l o g n ) intervals, such that an associated piecewise degree α polynomial approximation ( ˜ f ) k , has a squared approximation error of O ( m i n ( k - 2 α , n - 1 ) ) .

Assume n > k > m . Divide [ 0 , 1 ] into k intervals. If f is smooth on a particular interval I , then

| f ( t ) - f ˜ k ( t ) | = O ( k - 2 α ) t I .

In intervals that contain a discontinuity, recursively subdivide into two until the discontinuity is contained in an interval ofwidth n - 1 . This process results in at most l o g 2 n addition subintervals per discontinuity, and the squared approximationerror is O ( k - 2 α ) on all of them accept the m intervals of width n - 1 containing the discontinuities where the error is O ( 1 ) at each point.

Thus, the overall squared L 2 norm is

| | f - f ˜ k | | L 2 2 = O ( m i n ( k - 2 α , n - 1 ) )

and there are at most k + l o g 2 n intervals in the partition. Since k>m, we can upperbound the number of intervals by 2 k l o g 2 n .

Note that if the initial complete RDP has n k 2 α intervals, then the squared error is O ( k - 2 α ) .

Thus, we only incur a factor of 2 α l o g k additional leafs and achieve the same overall approximation error as in the H α ( C α ) case. We will see that this is a small price to pay in order to handle not only smooth functions, but alsopiecewise smooth functions.

Wavelet approximations

Let f L 2 ( [ 0 , 1 ] ) ; f 2 ( t ) d t < .

A wavelet approximation is a series of the form

f = c o + j 0 k = 1 2 j < f , ψ j , k > ψ j , k

where c o is a constant ( c o = 0 1 f ( t ) d t ) ,

< f , ψ j , k > = 0 1 f ( t ) ψ j , k ( t ) d t

and the basis functions ψ j , k are orthonormal, oscillatory signals, each with an associated scale 2 - j and position k 2 - j . ψ j , k is called the wavelet at scale 2 - j and position k 2 - j .

Haar wavelets

ψ j , k ( t ) = 2 j / 2 ( 1 { t [ 2 - j ( k - 1 ) , 2 - j ( k - 1 / 2 ) ] } - 1 { t [ 2 - j ( k - 1 / 2 ) , 2 - j k ] } )
Haar Wavelet
0 1 ψ j , k ( t ) d t = 0
0 1 ψ j , k 2 ( t ) d t = ( k - 1 ) 2 - j k 2 - j 2 j d t = 1
0 1 ψ j , k ( t ) ψ l , m ( t ) d t = δ j , l . δ k , m
If f is constant on [ 2 - j ( k - 1 ) , 2 - j k ] , then
f ψ j , k ( t ) = 0 .

Suppose f is piecewise constant with at most m discontinuities. Let

f J = c o + j = 0 J - 1 k = 1 2 j < f , ψ j , k > ψ j , k .

Then, f J has at most m J non-zero wavelet coefficients; i.e., < f , ψ j , k > = 0 for all but m J terms, since at most one Haar Wavelet at each scale senses each point of discontinuity. Said another way, allbut at most m of the wavelets at each scale have support over constant regions of f .

f J itself will be piecewise constant with discontinuities only possible occurring at end points of the intervals [ 2 - J ( k - 1 ) , 2 - J k ] . Therefore, in this case

| | f - f J | | L 2 2 = O ( 2 - J ) .

Daubechies wavelets are the extension of the Haar wavelet idea. Haar wavelets have one "vanishing moment":

0 1 ψ j , k = 0 .

Daubechies wavelets are "smoother" basis functions with extra vanishing moments. The Daubechies- N wavelet has N vanishing moments.

0 1 t l ψ j , k d t = 0 f o r l = 0 , 1 , . . . , N - 1 .

The Daubechies-1 wavelet is just the Haar case.

If f is a piecewise degree N polynomial with at most m pieces, then using the Daubechies- N wavelet system.

| | f - f J | | L 2 2 = O ( 2 - J ) ;

and

f J ( t ) = c o + j = 0 J - 1 k = 1 2 j < f , ψ j , k > ψ j , k ( t )

has at most O ( m J ) non-zero wavelet coefficients. f J is called the Discrete Wavelet Transform (DWT) approximation of f . The key idea is the same as we saw with trees.

Sampled data

We can also use DWT's to analyze and represent discrete, sampled functions. Suppose,

f ̲ = [ f ( 1 / n ) , f ( 2 / n ) , . . . , f ( n / n ) ]

then we can write f ̲ as

f ̲ = c o + j = 0 l o g 2 n - 1 k = 1 2 j < f ̲ , ψ ̲ j , k > ψ ̲ j , k

where

ψ ̲ j , k = [ ψ j , k ( 1 ) , ψ j , k ( 2 ) , . . . , ψ j , k ( n ) ]

is a discrete time analog of the continuous time wavelets we considered before. In particular,

i = 1 n i l ψ j , k ( i ) = 0 , l = 0 , 1 , . . . , N - 1

for the Daubechies- N discrete wavelets.

< f ̲ , ψ ̲ j , k > = f ̲ T ψ ̲ j , k

Thus, we also have an analogous approximation result: If f ̲ are samples from a piecewise degree N polynomial function with a finite number m of discontinuities, then f ̲ has O ( m J ) non-zero wavelet coefficients.

ApproximatingFunctions with wavelets

Suppose f B α ( C α ) and has a finite number of discontinuities. Let f p denote piecewise degree- N ( N = α ) polynomial approximation to f with O ( k ) pieces; a uniform partition into k equal length intervals followed by addition splits at the points of discontinuity.

Then

| f ( t ) - f p ( t ) | 2 = O ( k ( - 2 α ) ) t [ 0 , 1 ]
| f ( i / n ) - f p ( i / n ) | 2 = O ( k - 2 α ) i = 1 , . . . , n
1 / n | | f ̲ - f ̲ p | | L 2 2 = O ( k - 2 α ) )

and f ̲ p has O ( k l o g 2 n ) non-zero coefficients according to our previous analysis.

Wavelets in 2-d

Suppose f is a 2-D image that is piecewise polynomial:

A pruned RDP of k squares decorated with polyfits gives

| | f - f k | | L 2 2 = O ( k - 1 ) .

Let f ̲ = [ f ( i / k , j / k ) i , j = 1 n sample range.

f n ( t ) = i , j = 1 k f ( i / k , j / k k ) 1 { t [ i - 1 / k , i / k ) x [ j - 1 / k , j / k ) }

then

| | f - f n | | L 2 2 = O ( k - 1 )

O ( 1 ) error on k of the k 2 pixels, near zero elsewhere. The DWT of f ̲ has O ( k ) non-zero wavelet coefficients. O ( 2 j ) at scale 2 - j , j = 0 , 1 , . . . , l o g n .

Questions & Answers

Do somebody tell me a best nano engineering book for beginners?
s. Reply
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
s.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Harper
how to fabricate graphene ink ?
SUYASH Reply
for screen printed electrodes ?
SUYASH
What is lattice structure?
s. Reply
of graphene you mean?
Ebrahim
or in general
Ebrahim
in general
s.
Graphene has a hexagonal structure
tahir
On having this app for quite a bit time, Haven't realised there's a chat room in it.
Cied
what is biological synthesis of nanoparticles
Sanket Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
China
Cied
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
AMJAD
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
AMJAD
what is system testing
AMJAD
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
Prasenjit Reply
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
Ali Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!





Source:  OpenStax, Statistical learning theory. OpenStax CNX. Apr 10, 2009 Download for free at http://cnx.org/content/col10532/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Statistical learning theory' conversation and receive update notifications?

Ask