You are on page 1of 15

Introduction to The Lifting Scheme

Wavelet Transforms Two approaches to make a wavelet transform:


Scaling function and wavelets (dilation equation and wavelet equation) Filter banks (low-pass filter and high-pass filter)

The two approaches produce same results, proved by Doubeches. Filter bank approach is preferable in signal processing literatures

Wavelet Transforms

H 0(z ) X' 0(z )

2 X 0(z ) 2 X' 1(z ) X 1(z )

2 Y'0( z) 2 Y'1( z)

G 0(z ) Y 0(z ) G 1(z ) Y1( z)

X (z )
H 1(z )

Y (z )

|H0(w)|, |G0(w)|

|H1(w)|, |G1(w)|

/2 / 2 Ideal low-pass filter

/2 / 2 Ideal high-pass filter

Practical Filter

Understanding The Lifting Scheme


signal

d k( 0 )
( sk 0 ) (1) k

Splitting
Predicting Updating

d s

(1) k

Transmitting
( sk1)

d k(1) s
(0) k (0) k

Inverse Updating Inverse Predicting Merge signal

Lifting Scheme in the Z-Transform Domain

Update stage

S(z) split

S'(z)
Low band signal

X(z)

P(z) D(z)

U(z)
High band signal

D'(z)

Prediction stage

Lifting Scheme in the Z-Transform Domain


Inverse update stage

S'(z) U(z) P(z)

S(z) combine
D(z)

X(z)

D'(z)

Inverse prediction stage

Four Basic Stages A spatial domain construction of biorthogonal wavelets, consists of the following four basic operations:

Split : sk(0)=x2i(0), dk(0)=x2i+1(0)


Predict : dk(r)= dk(r-1) pj(r) sk+j(r-1)

Update : sk(r)= sk(r-1) + uj(r) dk+j(r)


Normalize : sk(R)=K0sk(R), dk(R)=K1dk(R)

Two Main Stages

Prediction and Update


di-2(k-1) di-1(k-1) di(k-1) di+1(k-1) di+2(k-1) di+3(k-1)

si-2(k-1)

si-1(k-1)

si(k-1) p1(k) di-1(k) p0(k)

si+1(k-1) p0(k) di(k) p1(k)

si+2(k-1)

si+3(k-1)

...
di-2(k)

...
di+2(k) di+3(k)

di+1(k) u1(k)

...
si-2(k-1)

u1(k) si-1(k-1)

u0(k)

u0(k) si(k-1)

...
si+2(k-1) si+3(k-1)

si+1(k-1)

Prediction Stage A prediction rule : interpolation


Linear interpolation coefficients: [1,1]/2 used in the 5/3 filter Cubic interpolation coefficients: [-1,9,9,-1]/16 used in the 13/7 CRF and the 13/7 SWE
xi-1 xi-3 xi-2 xp xi+1 xi+3

xi-1 xi-3

xp xi+1

xi+3

-3

-1

xi+2

-3

xi-2

-1

xi+2

Update Stage An update rule : preservation of average (moments) of the signal


The update coefficients in the 5/3 are [1,1]/4 The update coefficients in the 13/7 SWE are [-1,9,9,-1]/32 The update coefficients in the 13/7 CRF are [-1,5,5,-1]/16

Example

The 5/3 wavelet


The (2,2) lifting scheme

xi2

xi1

xi

xi1

xi2

xi3

xi4

split predict

p0
d k 1

p0

p0
dk

p0

high pass update low pass

u0

u0 sk

Example
We have p0 = 1/2 by linear interpolation and the detailed coefficient are given by
1 d k xi 1 ( xi xi 2 ) 2

In the update stage, we first assure that the average of the signal be preserved

sk
k

1 xi 2 i

From an update of the form, we have


sk xi A(d k 1 d k )

s x
k k i

2 A d k (1 2 A) xi 2 A xi 1
k i i

From this, we get A=1/4 as the correct choice to maintain the average.

Example The coefficients of the corresponding high pass filter are {h1} = {-1,2,-1} The coefficients of the corresponding low pass filter are {h0} = {-1,2,6,2,-1} So, the (2,2) lifting scheme is equal to the 5/3 wavelet.

Example

Complexity of the lifting version and the conventional version


The conventional 5/3 filter
X_low = ( 4*x[0]+2*x[0]+2*(x[-1]+x[1])-(x[2]+x[-2]) )/8 X_high = x[0]-(x[1]+x[-1])/2 Number of operations per pixel = 9+3 = 12

The (2,2) lifting


D[0] = x[0]- (x[1]+x[-1])/2 S[0] = x[0] + (D[0]+D[1])/4 Number of operations per pixel = 6

Conclusions

The lifting scheme is an alternative method of computing the wavelet coefficients Advantages of the lifting scheme:
Requires less computation and less memory. Easily produces integer-to-integer wavelet transforms for lossless compression. Linear, nonlinear, and adaptive wavelet transform is feasible, and the resulting transform is invertible and reversible.

You might also like