<< Chapter < Page
  Image coding   Page 1 / 1
Chapter >> Page >
This module discusses perfect reconstruction (PR).

We are now able to generalize our analysis for arbitrary filters H 0 , H 1 , G 0 and G 1 . Substituting this equation and this equation in our discussion of 2-band filter bank into this earlier equation and then using this equation and this equation from the same discussion, we get:

X ^ z 1 2 G 0 z Y 0 z Y 0 z 1 2 G 1 z Y 1 z Y 1 z 1 2 G 0 z H 0 z X z 1 2 G 0 z H 0 z X z 1 2 G 1 z H 1 z X z 1 2 G 1 z H 1 z X z 1 2 X z G 0 z H 0 z G 1 z H 1 z 1 2 X z G 0 z H 0 z G 1 z H 1 z
If we require X ^ z X z - the Perfect Reconstruction (PR) condition - then:
G 0 z H 0 z G 1 z H 1 z 2
and
G 0 z H 0 z G 1 z H 1 z 0
Identity is known as the anti-aliasing condition because the term in X z in is the unwanted aliasing term caused by down-sampling y 0 and y 1 by 2.

It is straightforward to show that the expression for H 0 , H 1 , G 0 and G 1 , given in this equation , this equation , this equation and this equation for the filters based on the Haar transform, satisfy and . They are the simplest set of filters which do.

Before we look at more complicated PR filters, we examine how the filter structures of this figure may be extended to form a binary filter tree (and the discrete wavelet transform).

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