NAG Library ManualKeyword Search:

NAG Library Routine Document

c09ecf (dim2_multi_fwd)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

▸▿ 10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

c09ecf computes the two-dimensional multi-level discrete wavelet transform (DWT). The initialization routine c09abf must be called first to set up the DWT options.

2

Specification

Fortran Interface

Subroutine c09ecf (

m, n, a, lda, lenc, c, nwl, dwtlvm, dwtlvn, icomm, ifail)

Integer, Intent (In)	::	m, n, lda, lenc, nwl
Integer, Intent (Inout)	::	icomm(180), ifail
Integer, Intent (Out)	::	dwtlvm(nwl), dwtlvn(nwl)
Real (Kind=nag_wp), Intent (In)	::	a(lda,n)
Real (Kind=nag_wp), Intent (Inout)	::	c(lenc)

C Header Interface

#include nagmk26.h

void	c09ecf_ ( const Integer m, const Integer n, const double a[], const Integer lda, const Integer lenc, double c[], const Integer nwl, Integer dwtlvm[], Integer dwtlvn[], Integer icomm[], Integer ifail)

3

Description

c09ecf computes the multi-level DWT of two-dimensional data. For a given wavelet and end extension method, c09ecf will compute a multi-level transform of a matrix

A

, using a specified number,

n_{fwd}

, of levels. The number of levels specified,

n_{fwd}

, must be no more than the value

l_{\max}

returned in nwlmax by the initialization routine c09abf for the given problem. The transform is returned as a set of coefficients for the different levels (packed into a single array) and a representation of the multi-level structure.

The notation used here assigns level

0

to the input matrix,

A

. Level 1 consists of the first set of coefficients computed: the vertical (

v_{1}

), horizontal (

h_{1}

) and diagonal (

d_{1}

) coefficients are stored at this level while the approximation (

a_{1}

) coefficients are used as the input to a repeat of the wavelet transform at the next level. This process is continued until, at level

n_{fwd}

, all four types of coefficients are stored. The output array,

C

, stores these sets of coefficients in reverse order, starting with

a_{n_{fwd}}

followed by

v_{n_{fwd}}, h_{n_{fwd}}, d_{n_{fwd}}, v_{n_{fwd} - 1}, h_{n_{fwd} - 1}, d_{n_{fwd} - 1}, \dots, v_{1}, h_{1}, d_{1}

4

References

None.

5

Arguments

1: $m$ – IntegerInput

On entry: number of rows,

m

, of data matrix

A

Constraint: this must be the same as the value m passed to the initialization routine c09abf.

2: $n$ – IntegerInput

On entry: number of columns,

n

, of data matrix

A

Constraint: this must be the same as the value n passed to the initialization routine c09abf.

3: $a (lda, n)$ – Real (Kind=nag_wp) arrayInput

On entry: the

m

n

data matrix

A

4: $lda$ – IntegerInput

On entry: the first dimension of the array a as declared in the (sub)program from which c09ecf is called.

Constraint:

lda \geq m

5: $lenc$ – IntegerInput

On entry: the dimension of the array c as declared in the (sub)program from which c09ecf is called. c must be large enough to contain,

n_{ct}

, wavelet coefficients. The maximum value of

n_{ct}

is returned in nwct by the call to the initialization routine c09abf and corresponds to the DWT being continued for the maximum number of levels possible for the given data set. When the number of levels,

n_{fwd}

, is chosen to be less than the maximum,

l_{\max}

, then

n_{ct}

is correspondingly smaller and lenc can be reduced by noting that the vertical, horizontal and diagonal coefficients are stored at every level and that in addition the approximation coefficients are stored for the final level only. The number of coefficients stored at each level is given by

3 \times ⌈\bar{m} / 2⌉ \times ⌈\bar{n} / 2⌉

for

mode ='P'

in c09abf and

3 \times ⌊(\bar{m} + n_{f} - 1) / 2⌋ \times ⌊(\bar{n} + n_{f} - 1) / 2⌋

for

mode ='H'

'W'

'Z'

, where the input data is of dimension

\bar{m} \times \bar{n}

at that level and

n_{f}

is the filter length nf provided by the call to c09abf. At the final level the storage is

4 / 3

times this value to contain the set of approximation coefficients.

Constraint:

lenc \geq n_{ct}

, where

n_{ct}

is the total number of coefficients that correspond to a transform with nwl levels.

6: $c (lenc)$ – Real (Kind=nag_wp) arrayOutput

On exit: the coefficients of the discrete wavelet transform. If you need to access or modify the approximation coefficients or any specific set of detail coefficients then the use of c09eyf or c09ezf is recommended. For completeness the following description provides details of precisely how the coefficient are stored in c but this information should only be required in rare cases.

Let

q (i)

denote the number of coefficients (of each type) at level

i

, for

i = 1, 2, \dots, n_{fwd}

, such that

q (i) = dwtlvm (n_{fwd} - i + 1) \times dwtlvn (n_{fwd} - i + 1)

. Then, letting

k_{1} = q (n_{fwd})

and

k_{j + 1} = k_{j} + q (n_{fwd} - ⌈j / 3⌉ + 1)

, for

j = 1, 2, \dots, 3 n_{fwd}

, the coefficients are stored in c as follows:

$c (i)$ , for $i = 1, 2, \dots, k_{1}$

Contains the level

n_{fwd}

approximation coefficients,

a_{n_{fwd}}

$c (i)$ , for $i = k_{j} + 1, \dots, k_{j + 1}$

Contains the level

n_{fwd} - ⌈j / 3⌉ + 1

vertical, horizontal and diagonal coefficients. These are:

vertical coefficients if $j mod 3 = 1$ ;
horizontal coefficients if $j mod 3 = 2$ ;
diagonal coefficients if $j mod 3 = 0$ ,

for

j = 1, \dots, 3 n_{fwd}

7: $nwl$ – IntegerInput

On entry: the number of levels,

n_{fwd}

, in the multi-level resolution to be performed.

Constraint:

1 \leq nwl \leq l_{\max}

, where

l_{\max}

is the value returned in nwlmax (the maximum number of levels) by the call to the initialization routine c09abf.

8: $dwtlvm (nwl)$ – Integer arrayOutput

On exit: the number of coefficients in the first dimension for each coefficient type at each level.

dwtlvm (i)

contains the number of coefficients in the first dimension (for each coefficient type computed) at the (

n_{fwd} - i + 1

)th level of resolution, for

i = 1, 2, \dots, n_{fwd}

. Thus for the first

n_{fwd} - 1

levels of resolution,

dwtlvm (n_{fwd} - i + 1)

is the size of the first dimension of the matrices of vertical, horizontal and diagonal coefficients computed at this level; for the final level of resolution,

dwtlvm (1)

is the size of the first dimension of the matrices of approximation, vertical, horizontal and diagonal coefficients computed.

9: $dwtlvn (nwl)$ – Integer arrayOutput

On exit: the number of coefficients in the second dimension for each coefficient type at each level.

dwtlvn (i)

contains the number of coefficients in the second dimension (for each coefficient type computed) at the (

n_{fwd} - i + 1

)th level of resolution, for

i = 1, 2, \dots, n_{fwd}

. Thus for the first

n_{fwd} - 1

levels of resolution,

dwtlvn (n_{fwd} - i + 1)

is the size of the second dimension of the matrices of vertical, horizontal and diagonal coefficients computed at this level; for the final level of resolution,

dwtlvn (1)

is the size of the second dimension of the matrices of approximation, vertical, horizontal and diagonal coefficients computed.

10: $icomm (180)$ – Integer arrayCommunication Array

On entry: contains details of the discrete wavelet transform and the problem dimension as setup in the call to the initialization routine c09abf.

On exit: contains additional information on the computed transform.

11: $ifail$ – IntegerInput/Output

On entry: ifail must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.

For environments where it might be inappropriate to halt program execution when an error is detected, the value

- 1 ​ or ​ 1

is recommended. If the output of error messages is undesirable, then the value

1

is recommended. Otherwise, if you are not familiar with this argument, the recommended value is

0

. When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit:

ifail = 0

unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, $m = 〈value〉$ .
Constraint: $m = 〈value〉$ , the value of m on initialization (see c09abf).

On entry, $n = 〈value〉$ .
Constraint: $n = 〈value〉$ , the value of n on initialization (see c09abf).

$ifail = 2$: On entry, $lda = 〈value〉$ and $m = 〈value〉$ .
Constraint: $lda \geq m$ .

$ifail = 3$: On entry, $lenc = 〈value〉$ .
Constraint: $lenc \geq 〈value〉$ , the total number of coefficents to be generated.

$ifail = 5$: On entry, $nwl = 〈value〉$ .
Constraint: $nwl \geq 1$ .

On entry, $nwl = 〈value〉$ and $nwlmax = 〈value〉$ in c09abf.
Constraint: $nwl \leq nwlmax$ in c09abf.

$ifail = 7$: Either the initialization routine has not been called first or icomm has been corrupted.

Either the initialization routine was called with $wtrans ='S'$ or icomm has been corrupted.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

The accuracy of the wavelet transform depends only on the floating-point operations used in the convolution and downsampling and should thus be close to machine precision.

8

Parallelism and Performance

c09ecf is not threaded in any implementation.

9

Further Comments

The wavelet coefficients at each level can be extracted from the output array c using the information contained in dwtlvm and dwtlvn on exit (see the descriptions of c, dwtlvm and dwtlvn in Section 5). For example, given an input data set,

A

, denoising can be carried out by applying a thresholding operation to the detail (vertical, horizontal and diagonal) coefficients at every level. The elements

c (k_{1} + 1)

c (k_{n_{fwd} + 1})

, as described in Section 5, contain the detail coefficients,

{\hat{c}}_{i j}

, for

i = n_{fwd}, n_{fwd} - 1, \dots, 1

and

j = 1, 2, \dots, 3 q (i)

, where

q (i)

is the number of each type of coefficient at level

i

and

{\hat{c}}_{i j} = c_{i j} + σ ε_{i j}

and

σ ε_{i j}

is the transformed noise term. If some threshold parameter

α

is chosen, a simple hard thresholding rule can be applied as

{\bar{c}}_{i j} = \{\begin{cases} 0, & if ​ |{\hat{c}}_{i j}| \leq α \\ {\hat{c}}_{i j}, & if ​ |{\hat{c}}_{i j}| > α, \end{cases}

taking

{\bar{c}}_{i j}

to be an approximation to the required detail coefficient without noise,

c_{i j}

. The resulting coefficients can then be used as input to c09edf in order to reconstruct the denoised signal. See Section 10 in c09ezf for a simple example of denoising.

See the references given in the introduction to this chapter for a more complete account of wavelet denoising and other applications.

10

Example

This example performs a multi-level resolution transform of a dataset using the Daubechies wavelet (see

wavnam ='DB2'

in c09abf) using half-point symmetric end extensions, the maximum possible number of levels of resolution, where the number of coefficients in each level and the coefficients themselves are not changed. The original dataset is then reconstructed using c09edf.

NAG Library Routine Document

c09ecf (dim2_multi_fwd)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results