<< Chapter < Page
  Image coding   Page 1 / 1
Chapter >> Page >
This module derives 2-D filter bank from 1-D Haar transform.

Digital filter banks have been actively studied since the 1960s, whereas Wavelet theory is a new subject area that was developedin the 1980s, principally by French and Belgian mathematicians, notably Y. Meyer, I. Daubechies, and S. Mallat. The two topics arenow firmly linked and of great importance for signal analysis and compression.

The 2-band filter bank

Recall the 1-D Haar transform from our previous discussion .

y 1 y 2 T x 1 x 2
where T 1 2 1 1 1 -1

We can write this in expanded form as:

y 1 1 2 x 1 1 2 x 2
y 2 1 2 x 1 1 2 x 2
More generally if x is a longer sequence and the results are placed in two separate sequences y 0 and y 1 , we define the process as:
y 0 n 1 2 x n 1 1 2 x n
y 1 n 1 2 x n 1 1 2 x n
These can be expressed as 2 FIR filters with tap vectors h 0 1 2 1 2 and h 1 1 2 -1 2 . Hence as z-transforms, and become:
Y 0 z H 0 z X z
where H 0 z 1 2 z 1
Y 1 z H 1 z X z
where H 1 z 1 2 z 1 . (We shall later extend these filters to be more complicated.)

In practice, we only calculate y 0 n and y 1 n at alternate (say even) values of n so that the total number of samples in y 0 and y 1 is the same as in x .

We may thus represent the Haar transform operation by a pair of filters followed by downsampling by 2, as shown in (a). This is known as a 2-band analysis filter bank.

Two-band filter banks for analysis (a) and reconstruction (b).

In this equation in our discussion of the Haar transform, to reconstruct x from y we calculated x T y . For long sequences this may be written:

n n even x n 1 1 2 y 0 n 1 2 y 1 n
n n even x n 1 2 y 0 n 1 2 y 1 n
Since y 0 n and y 1 n are only calculated at even values of n , we may assume that they are zero at odd values of n . We may then combine and into a single expression for x n , valid for all n :
x n 1 2 y 0 n 1 y 0 n 1 2 y 1 n 1 y 1 n
or as z-transforms:
X z G 0 z Y 0 z G 1 z Y 1 z
where
G 0 z 1 2 z 1 G 1 z 1 2 z 1
In the signals Y 0 z and Y 1 z are not really the same as Y 0 z and Y 1 z in and because those in and have not had alternate samples set to zero. Also, in X z is the reconstructed output whereas in and it is the input signal.

To avoid confusion we shall use X ^ , Y 0 ^ and Y 1 ^ for the signals in so it becomes:

X ^ z G 0 z Y 0 ^ z G 1 z Y 1 ^ z
We may show this reconstruction operation as upsampling followed by 2 filters, as in (b).

If Y 0 ^ and Y 1 ^ are not the same as Y 0 and Y 1 , how do they relate to each other?

Now

n n even y 0 ^ n y 0 n
n n odd y 0 ^ n 0
Therefore Y 0 ^ z is a polynomial in z , comprising only the terms in even powers of z from Y 0 z . This may be written as:
Y 0 ^ z even n y 0 n z n all n 1 2 y 0 n z n y 0 n z n 1 2 Y 0 z Y 0 z
Similarly
Y 1 ^ z 1 2 Y 1 z Y 1 z
This is our general model for downsampling by 2, followed byupsampling by 2 as defined in and .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Image coding. OpenStax CNX. Jan 22, 2004 Download for free at http://cnx.org/content/col10206/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Image coding' conversation and receive update notifications?

Ask