hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_wav_2d_init (c09ab)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_wav_2d_init (c09ab) returns the details of the chosen two-dimensional discrete wavelet filter. For a chosen mother wavelet, discrete wavelet transform type (single-level or multi-level DWT) and end extension method, this function returns the maximum number of levels of resolution (appropriate to a multi-level transform), the filter length, the total number of approximation, horizontal, vertical and diagonal coefficients and the number of coefficients in the second dimension for the single-level case. This function must be called before any of the two-dimensional transform functions in this chapter.

Syntax

[nwlmax, nf, nwct, nwcn, icomm, ifail] = c09ab(wavnam, wtrans, mode, m, n)
[nwlmax, nf, nwct, nwcn, icomm, ifail] = nag_wav_2d_init(wavnam, wtrans, mode, m, n)

Description

Two-dimensional discrete wavelet transforms (DWT) are characterised by the mother wavelet, the end extension method and whether multiresolution analysis is to be performed. For the selected combination of choices for these three characteristics, and for given dimensions (m×n) of data matrix A, nag_wav_2d_init (c09ab) returns the dimension details for the transform determined by this combination. The dimension details are: lmax, the maximum number of levels of resolution that would be computed were a multi-level DWT applied; nf, the filter length; nct the total number of approximation, horizontal, vertical and diagonal coefficients (over all levels in the multi-level DWT case); and ncn, the number of coefficients in the second dimension for a single-level DWT. These values are also stored in the communication array icomm, as are the input choices, so that they may be conveniently communicated to the two-dimensional transform functions in this chapter.

References

None.

Parameters

Compulsory Input Parameters

1:     wavnam – string
The name of the mother wavelet. See the C09 Chapter Introduction for details.
wavnam='HAAR'
Haar wavelet.
wavnam='DBn', where n=2,3,,10
Daubechies wavelet with n vanishing moments (2n coefficients). For example, wavnam='DB4' is the name for the Daubechies wavelet with 4 vanishing moments (8 coefficients).
wavnam='BIORx.y', where x.y can be one of 1.1, 1.3, 1.5, 2.2, 2.4, 2.6, 2.8, 3.1, 3.3, 3.5 or 3.7
Biorthogonal wavelet of order x.y. For example wavnam='BIOR3.1' is the name for the biorthogonal wavelet of order 3.1.
Constraint: wavnam='HAAR', 'DB2', 'DB3', 'DB4', 'DB5', 'DB6', 'DB7', 'DB8', 'DB9', 'DB10', 'BIOR1.1', 'BIOR1.3', 'BIOR1.5', 'BIOR2.2', 'BIOR2.4', 'BIOR2.6', 'BIOR2.8', 'BIOR3.1', 'BIOR3.3', 'BIOR3.5' or 'BIOR3.7'.
2:     wtrans – string (length ≥ 1)
The type of discrete wavelet transform that is to be applied.
wtrans='S'
Single-level decomposition or reconstruction by discrete wavelet transform.
wtrans='M'
Multiresolution, by a multi-level DWT or its inverse.
Constraint: wtrans='S' or 'M'.
3:     mode – string (length ≥ 1)
The end extension method.
mode='P'
Periodic end extension.
mode='H'
Half-point symmetric end extension.
mode='W'
Whole-point symmetric end extension.
mode='Z'
Zero end extension.
Constraint: mode='P', 'H', 'W' or 'Z'.
4:     m int64int32nag_int scalar
The number of elements, m, in the first dimension (number of rows of data matrix A) of the input data.
Constraint: m2.
5:     n int64int32nag_int scalar
The number of elements, n, in the second dimension (number of columns of data matrix A) of the input data.
Constraint: n2.

Optional Input Parameters

None.

Output Parameters

1:     nwlmax int64int32nag_int scalar
The maximum number of levels of resolution, lmax, that can be computed if a multi-level discrete wavelet transform is applied (wtrans='M'). It is such that 2lmaxminm,n<2lmax+1, for lmax an integer.
If wtrans='S', nwlmax is not set.
2:     nf int64int32nag_int scalar
The filter length, nf, for the supplied mother wavelet. This is used to determine the number of coefficients to be generated by the chosen transform.
3:     nwct int64int32nag_int scalar
The total number of wavelet coefficients, nct, that will be generated. When wtrans='S' the number of rows required in each of the output coefficient matrices can be calculated as ncm=nct/4ncn. When wtrans='M' the length of the array used to store all of the coefficient matrices must be at least nct.
4:     nwcn int64int32nag_int scalar
For a single-level transform (wtrans='S'), the number of coefficients that would be generated in the second dimension, ncn, for each coefficient type. For a multi-level transform (wtrans='M') this is set to 1.
5:     icomm180 int64int32nag_int array
Contains details of the wavelet transform and the problem dimension which is to be communicated to the two-dimensional discrete transform functions in this chapter.
6:     ifail int64int32nag_int scalar
ifail=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:
   ifail=1
On entry, wavnam=_ was an illegal value.
   ifail=2
On entry, wtrans=_ was an illegal value.
   ifail=3
On entry, mode=_ was an illegal value.
   ifail=4
Constraint: m2.
Constraint: n2.
   ifail=-99
An unexpected error has been triggered by this routine. Please contact NAG.
   ifail=-399
Your licence key may have expired or may not have been installed correctly.
   ifail=-999
Dynamic memory allocation failed.

Accuracy

Not applicable.

Further Comments

None.

Example

This example computes the two-dimensional multi-level resolution for a 6×6 matrix by a discrete wavelet transform using the Haar wavelet with whole-point symmetric end extensions. The number of levels of transformation actually performed is one less than the maximum possible. This number of levels, the length of the wavelet filter, the total number of coefficients and the number of coefficients in each dimension for each level are printed along with the vertical detail coefficients from the first level, before a reconstruction is performed.
function c09ab_example


fprintf('c09ab example results\n\n');

m = int64(8);
n = int64(8);
a = [6, 7, 8, 0, 1, 9, 7, 8;
     9, 1, 9, 9, 2, 8, 1, 9;
     3, 0, 4, 1, 3, 1, 0, 4;
     2, 5, 9, 4, 4, 2, 5, 9;
     1, 8, 3, 3, 5, 3, 8, 3;
     8, 1, 6, 4, 6, 1, 1, 6;
     8, 1, 1, 1, 2, 3, 1, 6;
     9, 2, 2, 4, 6, 1, 2, 9];


fprintf('\nInput data:\n');
disp(a);

wavnam = 'Haar';
mode = 'Whole';
wtrans = 'Multilevel';
[nwl, nf, nwct, nwcn, icomm, ifail] = ...
  c09ab(...
         wavnam, wtrans, mode, m, n);

lenc = nwct;
% Calculate one less than the max possible number of levels
nwl = nwl - 1;

% Perform Discrete Wavelet transform
[c, dwtlvm, dwtlvn, icomm, ifail] = c09ec(a, lenc, nwl, icomm);

% c09ab returns nwct based on max levels
% so recalculate based on nwl levels
nwct = 3*sum(dwtlvm(1:nwl).*dwtlvn(1:nwl));
nwct = nwct + dwtlvm(1)*dwtlvn(1);

fprintf('\nLength of wavelet filter : %d\n', nf);
fprintf('Number of Levels :         %d\n', nwl);
fprintf('Number of coefficients in first dimension for each level :\n');
disp(transpose(dwtlvm(1:nwl)));
fprintf('Number of coefficients in second dimension for each level :\n');
disp(transpose(dwtlvn(1:nwl)));

fprintf('\nTotal number of wavelet coefficients : %d\n', nwct);
fprintf('\nWavelet coefficients c :\n');
% print c using groups of eight
ngroups = nwct/8;
nleft = mod(nwct,8);
for i=0:ngroups-1
  fprintf('%8.4f', c(8*i+1:8*i+8));
  fprintf('\n');
end
fprintf('%8.4f', c(nwct-nleft+1:nwct));
fprintf('\n\n');

% Now select a nominated matrix of coefficients at a nominated level.
% level 0 is input data, 1 first coeffs and so on up to nwl:
% the deepest level and containing approximation coefficients.
want_level = nwl - 1;

% Only vertical detail coeffs at selected level.
want_coeffs = int64(1);
nwcm = dwtlvm(nwl-want_level+1);
nwcn = dwtlvn(nwl-want_level+1);

% Extract the selected set of coefficients. 
[d, icomm, ifail] = c09ey(want_level, want_coeffs, c, icomm);

% Display the selected coefficients
fprintf('\nType %3d coefficients at selected wavelet level %3d :\n', ...
        want_coeffs, want_level);
disp(d);

% Reconstruct original data
[b, ifail] = c09ed(nwl, c, m, n, icomm);
fprintf('Reconstruction       b:\n');
disp(b);


c09ab example results


Input data:
     6     7     8     0     1     9     7     8
     9     1     9     9     2     8     1     9
     3     0     4     1     3     1     0     4
     2     5     9     4     4     2     5     9
     1     8     3     3     5     3     8     3
     8     1     6     4     6     1     1     6
     8     1     1     1     2     3     1     6
     9     2     2     4     6     1     2     9


Length of wavelet filter : 2
Number of Levels :         2
Number of coefficients in first dimension for each level :
                    2                    4

Number of coefficients in second dimension for each level :
                    2                    4


Total number of wavelet coefficients : 64

Wavelet coefficients c :
 19.2500 15.5000 18.2500 15.7500 -2.7500  3.5000 -3.2500 -2.2500
  5.2500  1.5000  4.2500  0.7500  1.2500 -2.5000  0.7500  0.7500
  3.5000  0.0000  0.0000  7.0000  4.0000  4.0000  1.0000 -1.0000
 -7.0000  2.0000  3.5000  2.0000 -4.5000 -4.0000  0.0000 -6.0000
  1.5000 -2.0000  0.0000 -1.0000 -5.0000 -4.0000 -2.0000 -2.0000
  0.0000 -1.0000  0.5000 -1.0000  2.5000 -5.0000  2.0000 -2.0000
 -4.5000  3.0000 -7.0000 -0.0000  4.0000 -1.0000 -1.0000  1.0000
 -1.0000  0.0000 -1.5000 -3.0000  3.5000  0.0000  5.0000  1.0000



Type   1 coefficients at selected wavelet level   1 :
    3.5000    4.0000   -7.0000   -4.5000
         0    4.0000    2.0000   -4.0000
         0    1.0000    3.5000         0
    7.0000   -1.0000    2.0000   -6.0000

Reconstruction       b:
    6.0000    7.0000    8.0000    0.0000    1.0000    9.0000    7.0000    8.0000
    9.0000    1.0000    9.0000    9.0000    2.0000    8.0000    1.0000    9.0000
    3.0000    0.0000    4.0000    1.0000    3.0000    1.0000    0.0000    4.0000
    2.0000    5.0000    9.0000    4.0000    4.0000    2.0000    5.0000    9.0000
    1.0000    8.0000    3.0000    3.0000    5.0000    3.0000    8.0000    3.0000
    8.0000    1.0000    6.0000    4.0000    6.0000    1.0000    1.0000    6.0000
    8.0000    1.0000    1.0000    1.0000    2.0000    3.0000    1.0000    6.0000
    9.0000    2.0000    2.0000    4.0000    6.0000    1.0000    2.0000    9.0000


PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015