Application of Rigorous and Relaxed EPWT on 8x8 Image Matrix

In this section we will consider the effect of EPWT on an 8x8 matrix and derive all the levels of
path vectors and the low pass and high pass coefficients associated with each level. Then the
encoding process of both relaxed and rigorous EPWT will be discussed with particular emphasis
on the effect of setting a threshold on the path vector. We will begin by considering an image
with dyadic dimensions i.e. we will take an 8x8 matrix such that:

[

The input matrix will be passed through a series of discrete wavelet transform decomposition
levels and the coefficients will be essential for the reconstruction of the original image. We will
commence our path vector evaluation by taking the first entry of the matrix as the starting point
of the path i.e.

() . We scan for the next path vector entry using the absolute difference
equation:

( )

*|

())

()| (

())

() + ()
By applying the above equation we scan the complete image and find the image index path that
is highly correlated. For the above matrix, , the first level rigorous EPWT path is evaluated and
indicated by the following figure:
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

In the above figure the multi-colored blocks indicate the varying image intensity points or the
pixels of an image. As it can be seen in the figure the algorithm looks for the subsequent function
point that is the closest to the current path vector entry. This may result in a selected entry that is
not unique. For this purpose a preferred direction can be initially selected for the scanning
process which in our case is the clockwise direction. The algorithm finds the highly correlated
path smoothly until it faces an interruption in the pathway which is clearly evident in the above
illustration of the image intensity points. The above figure shows that when the path vector has
no available or admissible neighbors in the surroundings it has no option but to disconnect the
pathway and look for a new starting point. Admissible neighbors are the indices that are unused
or unoccupied by the path vector. The new starting point can be selected based on two criterions.
The first option is to start from an unoccupied index of the least magnitude and derive the
ensuing path from this index. This method has been followed in finding the path vector for the
above matrix as it reduces computational complexity and increases the efficiency. The other
option is to compare the current path vector entry with all the admissible indices using equation
(1) and select the index that has a function value with the minimum distance from the current
entry. Using this methodology the path vector will eventually occupy all the indices of the image
and will thus be having entries that are the permutation of the input image indices. The first level
path vector i.e.

for the matrix is:

(

)
The encoding of the path vector is achieved by assigning a 0 symbol to the favorite direction of
the path, with the subsequent symbols assigned relative to the favorite direction in a clockwise
order. This has already been discussed in the previous sections. Considering this criterion the
first level encoded rigorous EPWT path vector is found to be:

(
)

After evaluating the path vector we will begin with the compression process by applying the one-
dimensional wavelet transform on the function values of these path vector entries and compute
the low pass and high pass coefficients. For the purpose of our discussion we are going to use
normalized Haar wavelet filters such that () () () () .
For the case of an 8x8 matrix function the first level wavelet transformation will give us 32 low
pass and 32 high pass coefficients which are as follows:

(

)

(

)
After the first level we are to apply the similar EPWT algorithm on the low pass coefficients but
since the low pass coefficients contain only half the size of elements than f, we will be
interpolating the low pass coefficient to have a zoomed up matrix form such that:

()

( )+

And

())

()

( ))

()

Thus we will form a grouping of indices to form the 8x8 matrix formation and will consider each
index set as a single entity and compute the path vectors accordingly. The interpolated matrix
using the low pass coefficients will take the form:

The low pass interpolated coefficient matrix will pass through another path vector computation
phase but this time there is a minor change in the process of finding the path vector. Because of
the creation of the index sets and its consideration as a single entity the subsequent path vector
entry will be evaluated on the basis of the criterion:

( )

{|

())

()|

()

) }
*

() +
This means that we are going to consider the admissible neighbors of all the indices in the index
set

()

and select the most correlation path. Applying the above criterion the second level
decomposition path vector and its corresponding encoded path vector is found to be:

(
)

()

0
9
8
10 14
10
22
6
6
11
14
4
28
5
22
11
13
17
29
24
29
12
13
17
30
24
20
30
31
12
31
20
28
0
4
1
1
2
2
9 8
7
7
55
10
11
12 13
14
15
15
16 16
17 18
19
19
20 21
21
22 23
23
24
25 25
26
26
27
27
28
29
30
31
33


The above illustration of the second level pathway indicates that the number of entries in the path
vector is half of what they were at a higher level. Using the path vector we are going to find the
subsequent low pass and high pass coefficients by applying one dimensional wavelet transform
on

):

(
)

(
)

Using the vector

the interpolated matrix

can be formed by creating index sets by the help

of the generalized index set equation for :

()

( )

( )

( )+

Therefore

will be taken as:

Using the absolute difference equation and starting from the point

() we begin our
correlation path and after repetitive computation have the following results illustrated by the
figure as well:

( )
And the Encoded EPWT will be:

()

10 14
10
22
6
5
11
6
4
28
5
22
7
13
11
29
15
29
8
13
17
30
24
20
30
31
12
31
9
13
4
2
1
7
2
7
7
9 13
6
15
15
16 16
11 18
19
19
21
21
22 23
23
15
25 25
26
14
27
27
13
30
31
33
0
0
1
0
15
15
7
2
1
99
8
2 2
1
33
33
55 29 54
54
5
6
6
8
9
20 20
9
8
19
10 8
12
12
11
12
13
26
14
15
15


After applying the path vector evaluation algorithm, the low pass and high pass coefficients are
found to be:

( )

( )
Using the approximation coefficient matrix,

, from the wavelet transformation we are going to

form the interpolated matrix

such that:

Consequently the path vector

is found to be:

()
And encoded path vector will be:

()

10 14
10
22
6
5
11
6
4
28
5
22
6
13
11
29
15
29
5
13
17
30
24
20
30
31
12
31
3
13
4
2
1
7
2

7
9 13
6
15
15
16 16
11 18
19
19
21
21
22 23
23
15
25 25
26
27
27
14
30
31
33
0
0
1
0

2
1
99
8
1 2
1
32
3
55 29 54
54
5
6
5
9
20 20
3
5
19
4 5
12
12
11
12
13
26
15
15
33
1
0 1
1
32
3 2
3
20 20
3
11
19

19
4
19
4
19
4
26
7
26
7
32
5
5

Consequently low pass and high pass vectors are:

( )

( )
Hence we get the interpolated low pass matrix as:

By the similar method we used previously we find the path vector:

()
The encoded rigorous EPWT pathway will be:

()
This is also indicated in the diagram below:

2
3
0
3
2
2
2
2
1
1
1
3 3
0
3
3

The low pass and the wavelet coefficients are:

( )

( )
The last interpolated low pass matrix is evaluated using the low pass vector entries and the path
vector as:

The final level path vector is found to be:

()
The encoded path vector will result in an all zero path vector:

()


This is clearly evident prom the diagrammatic form of an 8x8 matrix :

0
1

The low pass and high pass coefficients are found to be:

()

()
Relaxed EPWT
From our observation of the rigorous version of the Easy Path Wavelet Transform we observed
that the number of symbols at the higher path vector levels is rapidly varying i.e. the direction of
the pathway is constantly changing which results in a higher entropy. In order to reduce this
effect the relaxed EPWT was introduced which ensures that the pathway follows the favorite or
preferred direction.
For the case of the 8x8 matrix by setting the threshold value to

we obtain an all zero

encoded path vector which is the ideal case scenario for path vector storage. The relaxed EPWT
pathway for an all zero path vector will take the shape as following:
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63

If the first level path vector is an all zero path vector the remaining path vectors are also all zero
vectors. Thus we only have to store the starting point of a pathway and the remaining directions
are store using the minimum possible symbols. Thus reducing our computational cost.