DIGITAL PROCESSING OF TWO-DIMENSIONAL SIGNALS

IN THE BASIS OF HAAR WAVELETS

H. Zaynidinov M. Zaynutdinova E. Nazirova

Information Technologies Information Technologies Information Technologies
Tashkent University of Tashkent University of Tashkent University of
information technologies, information technologies, information technologies,
Uzbekistan Uzbekistan Uzbekistan
tet2001@rambler.ru dilfuza65@gmail.com e.nazirova@mail.ru

ABSTRACT global basis functions are those whose value is not zero
on any subinterval. This class includes Walsh functions, numerical,
This article discusses the use of local systems of basic functions sawtooth;
defined on compact carriers. Their effectiveness is shown when localizable basis functions whose nonzero values are
solving the problems of discretization of finite signals. Signals can defined on nested segments. Examples are the HAAR and Hartmut
be not only time functions defined at finite intervals, but also functions.
functions of arguments of another physical nature, for example, The partition of the real axis is usually binary-rational. In
distances along surfaces. what follows, we shall mainly consider the interval [0, 1] or [0, 1]
and use the notion of a binary interval, which is obtained by
KEYWORDS dividing a given interval by 2рequal parts (P = 1, 2, ...):
Finite spectrum, finite function, signal energy, approximation,
HAAR wavelets, fast wavelet transform.  j j  1
hk  hpj   p 1
2 2 p 1 
INTRODUCTION (1)
p 1 p 1
The methods and techniques of digital signal processing raise the
interest of scientists and specialists working in various fields, such where,
j  0,1,...,2 , k  j  2
as communications and control systems, radio engineering and Examples of binary segments are intervals
electronics, acoustics, geophysics and seismology, broadcasting [ 0;1]; [ 1/2; 3/4], [ 3/8; 4/8 ] and etc.
and television, measuring equipment and instrumentation. It also The length of the binary segment hpj is:
includes such relatively new directions in the creation of hardware  
and software, such as audio and video signal processing, speech h , h
recognition, biometric systems, dynamic image processing, and where pj pj
are respectively its left and right halves
multimedia training systems. and also represent binary segments:
Traditional harmonic functions are widely used to build 
 j  1 2 j  1 
2 j 1 j 
the models of signals received from real objects. This is because hpj   p 1 ; p 
, hpj =  p ;
many signals received from real objects can be easily represented  2 2   2 2 p 1 
by a combination of sinusoidal and cosine waves, for which the (2)
Fourier analysis apparatus is used. The result is a transition from The system of Haar non-standardized functions is defined [2]:
time to frequency functions. However, the representation of the
time function by sinusoidal and cosine functions is only one of
many representations. Any complete system of orthogonal
functions can be used to expand into series that correspond to
Fourier series.
Widespread distributions in technical applications have
obtained orthogonal systems of continual disjointed basis functions
defined on the real axis, for which there are also algorithms of fast
transformations. They can be divided into two classes:
 WOODSTOCK’18, June, 2018, El Paso, Texas USA
 
 1 x  h pj

 
hark  x  harpj  x  1 x  h pj

0 x  h pj

 much wider than the set of fast transformations in the basis of
(3)
har0  x  1
Important to note that
The number P is called the order of the Haar functions
It is known that the Haar series [2]:
 axis, but can be regarded as local. But the main role in the
f  x  C  hark  x
k orthonormal wavelet bases based on compact media.
k 0 (4)
can provide both a uniform (including a uniform best)
and a mean-square approximation. It all depends on how you
calculate the coefficients.
The Haar basics attract the attention of specialists for two
reasons:
1. Reducing the number of coefficients required to
approximate (to a given accuracy) based on the total number of
binary segments.
2. The absence of "long" operations in the expression
(4.). Used only addition, subtraction and shift.
With the use of Haar wavelets, all the higher listed
properties are preserved.
Under the digital multidimensional signal processing
(DMSP) is understood the processing of information represented in
the form of multidimensional arrays of numbers, for example, the
results of measurements of data continuously changing in time and
space and coming from several sources [1,2,5]. Significant
differences in the processing of multivariate signals in comparison
with one-dimensional ones can be reduced to the following main
factors:
1) With the increase in the dimensionality of the data, the
volume of numerical information sharply increases.
2) Mathematical methods of processing becomes more
complicated, as a result, as a rule, errors increase, the reliability of
the results is weakened.
The traditional and simplest way to organize
multidimensional samples is rectangular sampling, where the
information carriers on the plane are squares, rectangles, and in
spaces of higher dimension - parallelepipeds, hypercubes etc.
As noted by most experts in the processing of one-
dimensional signals - time functions, finite spectrum principle is
very effective [1, 3,6,7]. Its limitations are usually satisfied in the
processing of one-dimensional processes, very different working in
H. Zaynidinov, M. Zaynutdinova, E. Nazirova.
multidimensional areas where the physical quantities to be
measured in a multidimensional continuum, "space-time". In
addition, there are areas of research where time is specifically
excluded from consideration in order to obtain reliable solutions to
spatial problems.
Significant progress in the use of wavelets in various
applications is associated, first of all, with the presence of fast
algorithms for spectral discrete transformations whose class is
complex exponential functions [8,9,10]. To solve the problem of
organizing minimum signal samples ensuring the necessary
accuracy of recovery, it is necessary to investigate the intrinsic
spectra of the wavelet coefficients. Such systems of wavelet
functions as derivatives of the Gaussian function, Morlet wavelets,
Shannon wavelets, etc. are theoretically determined on the whole
algorithms of discrete wavelet transform (DWT) is played by
Two main operators are needed to apply the energy
criterion for the accuracy of signal reconstruction by wavelet
coefficients: multivariate analysis [5] and calculation of the octave
energy spectrum [9]. The advantage of the octave spectrum is that
it, like the Fourier spectrum, is invariant with respect to time shifts
of stationary signals. The property of a multiple-scale analysis is
also possessed by some wavelets considered on the whole axis t (-
∞, ∞), for example, Shannon wavelets[10].
We transform the continuous signal f (x) to a discrete
form-we represent it as a row vector containing n real numbers fi, i
= 0, 1,..., n-1. In algorithms for fast wavelet transforms, integer
iterations of a single scaling operator Dσ (σ> 1) describing the
stretching are actually used [8]. Usually a scale σ = 2 is used, in
which the maternal wavelet satisfies the identity
n 1
D2 (t )   ck (t  k ). (5)
k 0
For functions f ε L2 (R), the partial sum with wavelet
coefficients ck is interpreted as the difference between two
approximations f - with the permutations 2-j + 1 and 2-j, and the
multiple-scale analysis uses sets of approximation grids.
Approximation with a resolution of 2-j contains all the necessary
information for calculation with a coarser resolution of 2-j-1.
Figure 1 shows the graph of the fast Haar transformation
at n = 23 = 8 samples with the addition of operators for calculating
the components of the octave spectrum.
 Digital processing of two-dimensional signals in the basis of
WOODSTOCK’18, June, 2018, El Paso, Texas USA
HAAR wavelets

required to exclude time from consideration as a factor interfering

Figure 1: The graph of the fast Haar transformation: Ck - Haar
coefficients, Es - values of octave components of the spectral
energy of the discrete signal
The values of the coefficients are obtained as a result of
applying a special program of wavelet transforms written in the
programming language C #. In Fig.2. a histogram of half the values
of the Haar fast transformation coefficients of the source vector
{fi}, containing n = 2p = 128 samples, is shown. It is said that "the
signal has a length of 128". The exponent p, denoting the maximum
number of iterations, is called the order of the discrete
transformation.
The expression for the total spectral energy of the Haar coefficient
vector {Ck}, over all octaves, is the sum of the quadratic form:
2 p 4 1
E  (( c02  c12 )  2 1 c22  c32   2  2
c 2
k  2 3
k 4
with the constantly acting components of the field, and leave only
spatial variables in the equations. For example, from magnetic
measurement data, such effects on magnetometer readings as
- the secular variation of the magnetic field (pole shift);
- variations of the magnetic field in time (fluctuations
during the day);
- the effect of the flight altitude of the aircraft above the
surface,
- deviation functional dependence caused by the
influence of the magnetic field of the aircraft, etc.
Figure 3 shows a picture of the complex field of the values of the
magnetic induction induced on one of the sections of the Earth's
surface and measured by the method of aeromagnetic prospecting.
The unit of measurement is microTesla. The two-dimensional array
f (x, y) includes 300 x 300 samples with distances of 1 km between
neighboring samples.
Figure 2: Graph of the field of values of magnetic
induction, measured by the method of aeromagnetic
prospecting.
Let's select on the graph (Figure 3) a section of a square
shape measuring 16 x 16 samples containing one local maximum
of the function, and apply to it formulas for estimating the accuracy
of calculating the spectral energy by the method of two-
dimensional Haar wavelets. Magnetometers can measure the
intensity of the field with an accuracy of up to 6 decimal places
after the point. Table 1 shows the results of magnetic prospecting f
2 p 3 1
2 p 1 (x, y). The plot of this section of the field is shown in fig.4.
c 2
k  ...  2  p  c )n. 2
k
(6)
k 8 k  2 p 1

Its numerical value is obtained equal to Eε = 136.887 Table 1.

 1.9168 0.1198 0.1199 0.1198 0.1204 0.1206 0.1205 0.1206 ... 
 0.0063  0.0029  0.0018  0.0029 0.0021 0.0011 0.0017 0.0026 ... 
 
  0.0028  0.0047  0.0042  0.0047  0.0030  0.0025  0.0020  0.0018 ... 
 
Example of processing two-dimensional signals   0.0018 0.0022 0.0025 0.0022 0.0031 0.0033 0.0035 0.0037 ... 
СWH    0.0002  0.0018  0.0019  0.0019  0.0018  0.0017  0.0015  0.0014 ... 
 
Wavelets as a class of mathematical functions were discovered by   0.0002  0.0002  0.0002  0.0002  0.0001  0.0001  0.0001  0.0001 ... 
  0.0002 0.0001 0.0001 0.0001 0.0002 0.0001 0.0001 0.0002 ... 
Morle and Grossman geophysicists [3] when studying seismic  
 0.0002 0.0001 0.0001 0.0001 0.0001 0.0001 0.0001 0.0001 ... 
waves. Seismic prospecting is one of the directions of application 
 ... ... ... ... ... ... ... ... ... 

of mathematical methods in solving geophysical problems of
prospecting for minerals, such as gravity prospecting, electrical
prospecting, magnetic prospecting. Magnet prospecting is the most
effective method from the point of view of high performance when
performing measurements of physical field parameters over the
Earth's surface, since it can be carried out by aerial methods (ie,
using airplanes and helicopters) and cover large areas of tens and
hundreds of km2. The basis of mathematical transformations is the
methods for solving systems of partial differential equations,
written, for example, in the form
 2 Fi ( x, y, z, t )
 fi  x, y, z, t  , i  1,2,..., N , (7)
xy
where x, y, z are the spatial coordinates of the four-dimensional
continuum, and t is the time. The search methods consist in the
detection of geophysical anomalies in signals. To do this, it is
 WOODSTOCK’18, June, 2018, El Paso, Texas USA H. Zaynidinov, M. Zaynutdinova, E. Nazirova.

infiniteness of the spectra and requires detailed estimates of the

accuracy of calculations of the energy characteristics.
The advantage of the method of finite basis functions, in contrast
to the practice of interpolation approximations considered in
applications of the theory of functions with finite spectrum, is the
ability to restore signals according to various criteria - like
interpolation and quadratic functional minimization criteria and
others.

Figure 3: The plot of the selected section of the magnetic field
of square form
Figure 4: Graph of the amplitude spectrum of the magnetic
REFERENCES
[1] Whittaker E .. On the Functions which are represented by Expansions of the
Interpolation Theory // Proc. Roy. Soc. Edinburgh. V.35. pp.181-194. 1915.
[2] Kotelnikov V. About the capacity of "ether" and wire in telecommunications //
Uspekhi Fizicheskikh Nauk. T.176. 2006. № 7. p. 762-770 (Annex).
[3] Jerry A. Shannon's theorem of counts, its various generalizations and restrictions
// TIER. 1977. T.65. № 11. c.53-89.
[4] Ptacek M. Digital television. Theory and technique. Translation from Czech. M.:
Radio and communication. 1990. 528 p.
[5] Malla S. Wavelets in signal processing. Trans. with English. Moscow: Mir, 2005.
672 p.
[6] Marchuk GI, Agoshkov V.I. Introduction to projection-grid methods. M.:
Science. 1981. 416 p.
[7] Svinyin S.F. Basic splines in the theory of signal samples. SPb: Science. 2003.
118 pp.
[8] Blatter K. Wavelet analysis. Fundamentals of the theory. M.: The techno sphere.
2006. 272 p.
[9] Ahmed N, Rao K. Orthogonal transformations in the processing of digital signals.
M.: Communication. 1980. 248 p.
[10] Modern Sampling Theory: Mathematics and Applications. Benedetto J., Ferreiro
P. / Springer Science and Business Media LLC. 2012. 158p.

field

The graph of the amplitude spectrum of the two-

dimensional Haar wavelet sequence is shown in Fig. From the
graph it is obvious that these two components represent the main
part of the high-frequency energy of the infinite spectrum of the
sequence.
We estimate the accuracy of the samples of the function
f (x, y), given on an area of 16 x 16 km2. The energy value of the
sum of the squares of 256 wavelet coefficients, taking into account
the weights of octaves, was equal to Eε = 949.376.
The error with respect to the total energy, which was calculated at
the level E = 955.403, was ε = 0.6%. If you take samples of the
signal with a sample that is 2 times rarer (only even counts for each
of the horizontal axes), then the calculated value of the spectral
energy is 943.976. This corresponds to an error of ε = 1.2%. Thus,
the motion to the total energy with increasing number of samples
on a binary scale is obvious.

Conclusion

The material presented shows that when solving

problems in the theory of signal counts, methods of wavelet
functions with compact support can give definite advantages over
a theory using the principle of finite spectrum. The principle of the
finiteness of signal carriers is at the forefront, which leads to the