0.1 Introduction
A digital image has various representations and some of them are required by applications. Many useful representations
are produced by orthogonal transforms that are powerful tools of image processing. Well known examples are JPEG and JPEG2000 lossy compression formats based on DCT (Discrete Cosine Transform) and DWT (Discrete Wavelet Transform). For the image compression problem block based DCT and DWT techniques are developed
[1] and generalized to nonseparable transforms [2].
Orthogonal transform produces scattering of digital data, a process that redistributes pixel energy of transformed image. It is useful for protection the hiding data in steganography, when a message is embedded into image. The hidden data is scattered among all digital cover image and becomes more robust to lossy data compression and some statistical attacks [3].
The orthogonal transform of images may be considered as a decomposition over matrices known as basis matrices [4]. Being some kind of grayscale images, the basis matrices look attractive and they are often reproduced by textbooks [5]. We will also call these matrices basis images.
In this paper we study basis images.
We focus on the following questions: color and wavelet basis images,
orthogonal transform by matrix
of basis images and their quantum analogues.
For color images the solution is directly achieved by considering threedimensional orthogonal transform but for wavelets the solution is not so simple. The reason
is that in practice, DWT is calculated by
algorithms using signal processing techniques instead of orthogonal transforms. Nevertheless these algorithms can be used to calculate wavelet basis images. So it was found
for various wavelets that the basis has a block structure similar to DWT coefficients [6].
Basis images may be considered as items of a matrix. We introduced such a matrix, it is orthogonal and suitable for transforms of multidimensional arrays such as a block vectors consisting of matrices. In this case there is a large number of degrees of freedom that may be correlated by the transformation. The correlation results in new features of the orthogonal transform for data scattering.
Indeed, in the standard image transform a given image pixel maps into all pixels of the transformed image. To retrieve it back all the transformed image pixels are required rather than one of them. A new feature is that retrieval can be made from a single pixel only due to correlation between arrays. A detection algorithm illustrates how this feature may be used for the frequency domain watermarking.
The paper is organized as follows. First, the orthogonal transform and the data scattering and basis images are considered. Then a matrix consisting of basis images and the orthogonal transform of multidimensional arrays are introduced. Next, an example of the scheme for frequency domain watermarking is presented.
0.2 The orthogonal transform
The orthogonal transform can scatter digital data.
(1) 
Columns of this matrix and rows
(2) 
where denotes scalar product of two vectors.
Scattering. We will study data scattering that can be illustrated by orthogonal transform of vectors.
Let us assume that ,
is a vector
and is an
orthogonal matrix. Taking into account that , we find orthogonal transform of vector
(3) 
where vector , is often called a representation of . In matrix form these equations look as follows
(4) 
As a result two points concerning data scattering can be made.

Every item of transforms into all items of with the weight , where

To get , we need to know all items of .
Let us assume that the data are hidden in , for example, by steganography and is distributed among all the digital space of by an orthogonal transform.
The data can be extracted, we need
all space of in spite of every point
the data have. Formally the problem is to find for given and the orthogonal transform.
Here and later we will consider data scattering as mapping
(5) 
It is clear that due to symmetry, the vector may be replaced with . The considered features are true for the orthogonal transforms of matrices and other multidimensional arrays.
Data scattering can be directly demonstrated by the orthogonal transform of a set of basic vectors. Let us consider a set of vectors and each of them has a nonzero component , . The vectors are known to be unit vectors and form a standard basis [7]
An orthogonal matrix transforms the standard basis into another basis consisting of the columns of
(6) 
This equation shows that a single nonzero item of distributes among a column
Since the column has at least two non zero items this transformation can be considered as scattering.
Scattering may results in energy concentration, a process that is important for applications. The array energy, defined as the sum of all components squared, is preserved under orthogonal transforms. Due to scattering, the energy can be distributed into a small amount of components, that is a base of coding in the image compression field. It depends on the orthogonal matrix, regardless of whether the energy would be concentrated or not. It is known that DCT, WHT (Walsh Hadamard Transform) and KLT (Karhunen Loeve Transform) can concentrate the image energy, if image is not random, but DST (Discrete Sine Transform) can’t do it [5].
0.3 Basis images
The orthogonal transform of a matrix and
threedimensional array provides decomposition over the grayscale and color basis images.
Representation of matrix.
Let be a real rectangular matrix, that corresponds to
a grayscale image. We introduce two orthogonal matrices and
of and . Then taking into account, that
, we find
(7) 
where is a matrix.
Let us assume that is an image in a spatial domain (that is the image as we see it). Matrix is usually called a frequency representation of or an image in frequency domain.
The frequency domain image
may look senseless, however the orthogonal transform is reversible and the original image can always be retrieved.
Using the matrix form of (0.3), for example,
we get a decomposition over tensor products of rows and columns of the matrices
and . Here and later we assume and that is a more interesting case. Then the decomposition produced by the orthogonal transformation takes the form(8) 
We introduce the matrices
(9)  
that we call basis images. There are basis images of size , every image pixel is a product of two items of the orthogonal matrix
Color basis images.
A color RGB image is a threedimensional array and similar to matrices it provides a decomposition over basis images.
Let be a threedimensional array of .
The orthogonal transform of can be achieved by three orthogonal matrices , and . The matrices have size , and respectively. Similarly to (0.3) the array can be presented as follows
(10) 
where , is a column of the matrix . Tensor products
produce a basis, the basis items are
(11) 
In general a threedimensional array can not be a color image. The color RGB image is described by three matrices , and of equal dimensions, say . Matrices are concatenated in a array
where is concatenation. Here we use notation of MATLAB, it means that , and .
0.4 Properties of basis images
Being tensor products of orthogonal matrix columns and rows the basis images have properties that follow from orthogonality, and they have a simple analogue came from quantum mechanics.
Properties.
Now let us consider the basis images
, if , properties of are the same.

The matrix product of two basis images is another basis image

The scalar product
(12) where the scalar product of matrices is .

The sum of diagonal elements, trace
(13) It follows that .
Analysing these properties we came to the conclusion that basis images are orthonormal. This observation allows us to consider the orthogonal transform (0.3) as a standard decomposition over the orthonormal basis. Is is obvious that the first equation takes the form
(14) 
where
Generation of basis images.
There are at least two ways to get basis images.
The first is to use its definitions. In this case
the orthogonal matrix has to be given.
The second way follows from orthogonal transform of the basis images.
Let us focus on the second approach.
Let be in equation
(14). Then we find the basis image representation of the form .
It means that the matrix has one nonzero pixel, it is equal to 1 and its position is . So, the orthogonal transform of a basis image is a binary matrix of unit brightness. We denote such unit matrix as
(15) 
where . Then the next relations are true
(16)  
These equations are twodimensional analogue of (6) and they have a simple meaning.
So together with the unit vectors the unit matrices form a standard basis and the orthogonal transform of the basis is a set of basis images .
Indeed, with the help of the standard basis any matrix can be presented in the following form
Then
we get the decomposition given by (14),
using the orthogonal transform and taking into account (16).
Example. WHT basis images. The orthogonal WHT matrix known also as Hadamard matrix
consists of plus 1 and minus 1
(17) 
In optics this matrix describes so called beam splitter, a linear optical element often used in experiments to split the beam into two parts. Four basis images , denoted as tensor product of columns, have the following form
The determinant of every matrix equals to 0 and the matrices are non invertable. The matrices can be generated from a unit matrix by WHT:
(18) 
This equation illustrates relations
between the basis images and the standard twodimensional basis. But what is more interesting, the equation demonstrates
scattering of digital data (5).
So, a nonzero pixel of the unit matrix transforms into a basis images of a matrix
with only nonzero pixels.
As a result, basis images can be produced by transformation of unit matrices.
The quantum analogue. The presented features allow us to consider basis images as a representation of quantum operators.
These operators describe transitions of a physical system between its states or levels.
Let us assume that and are two basis of a single particle Hilbert space
where , . Let the overlapping integrals be real
(19) 
Then we find a real matrix
that is orthogonal because and are complete basis.
The following operator
(20) 
where , describes transition
from the state or level
into level .
If , this operator is known as projection operator.
Using , the introduced operator (20) can be presents as a real matrix
where . It is not difficult to understand, that these matrices are
basis images, considered above.
Using we can present any single particle operator as follows
Operator can be written as a matrix using and (19), then the right part of this equation takes the form (14). As result we find that some of representations of single particle operators can be considered as basis grayscale images.
0.5 Basis wavelet images
Basis images can be generated by
DWT. In calculation the DWT techniques
do not use matrix methods
and the basis wavelet images can be achieved by transform of standard basis.
Wavelet coefficients.
The DWT coefficients have a block structure due to orthogonal matrix . In case of single level transform this matrix consists of two parts and known as low and high frequency blocks. Let be a frequency representation of a grayscale image . Applying the MATLAB notation, we write DWT as follows
(21)  
Here the introduced blocks , , and — are approximation coefficients, horizontal, vertical and diagonal details or , , and frequency bands.
The DWT coefficient matrix can be considered as a threedimensional array of size . Index labels the , , and blocks, for example, .
Block structure of basis and basis images.
To calculate basis images we use equation
(16)
According to (21) indexes belong to one of the blocks , , or . Let , so there is a set of basis items
(22) 
where — is a matrix of zeros. Here the upper indexes are in brackets to label number of the matrices instead of indicating the pixel position. In other words, we perform an orthogonal transformation of the unit block matrix
The total number of basis images of
is , every image is a matrix.
It is important to note that the equation (16) gives solution by Matlab functions dwt and idwt. The reason is that in practice the DWT calculations are often based on the filter function techniques [9].
These techniques were developed for signal processing without referring to the orthogonal matrix . Usually wavelets are introduced numerically or by recurrent
equations so the calculation of is a problem (except, for example, the Haar wavelet).
Using the block coefficients and
we can achieve an approximation
of original image
This image has diagonal details only.
The wavelet coefficient structure results in basis of four blocks. The blocks
refer to , , and similarly to (22)
Every block has basis images. As a result the representation over the wavelet basis images looks as follows
Indeed, the considered above function dwt can produce another basis. For this case in accordance with (21) every basis images has a block structure
0.6 A block matrix
Basis images may be items of a matrix that can be orthogonal.
A matrix of basis images. Consider a square matrix, which elements are basis images
(23) 
Elements of do not commute. The introduced matrix is a fourdimensional array, consisting of elements
The matrix has the following important feature:
(24) 
So considering the matrix elements we find
Indeed, matrix , which elements are basis images, , doesn’t have the property given by
(24). In this case .
The biorthogonal decomposition.
The equation (24) tells that the matrix has rows orthogonal to columns
(25) 
However, the rows are not orthogonal vectors themselves and similarly to columns. An orthonormal basis is obtained from rows and columns. The basis is known to be biorthogonal or biorthonormal [8] and it can be used to represent digital arrays.
Let us consider a vector
, . Using (24), we find
(26) 
where the introduced vector , is a representation of . To focus on the particular feature of transform (0.6), we introduce decomposition of vectors and over columns of matrix
In contrast to orthogonal transform, the coefficients are denoted by rows but not by columns
That is a biorthogonal decomposition.
The biorthogonal decompositions are applied in the wavelet field. So, to perform dwt (21) and inverse transform idwt, we need two different wavelets. An example is the CohenDaubechiesFeauveau wavelet or biorthogonal 9/7 wavelet that is used in JPEG 2000.
Orthogonality. Is the matrix orthogonal?
The answer is not clear because is a fourdimensional array. However, we can refer to the array primitives and consider rows and columns consisting of the rows and columns of the basis images. Let be a block row. It has items of basis images
. Selecting a row of every basis image, we get a row . This may be done for a column as well. Introduced rows and columns will
be orthonormal vectors. This is a reason to consider the block matrix as an orthogonal matrix.
Indeed, this result follows
from the definition of the transposing operation. In case of block matrix
it can be presented as follows
0.7 The block based representation
The orthogonal matrix of basis images
provides a block based representation of multidimensional arrays.
Representation. The block based representation follows from the equations (0.6), if they are written in the matrix form
(27) 
Here and are two block vectors
items of which may be chosen as vectors, matrices etc.
Let us assume that and are matrices. Restrictions on will be established later.
For this case the equations (0.7) take the following form
(28) 
It is important to notice that index plays minor role in these equations and from the formal point of view it is unnecessary.
It means that and have to be not less than onedimensional arrays. Then for considered matrices we find the following condition .
The unnecessary index indicates that there is more space to which matrices do not belong. From the physical point of view we have two systems, for example, atoms and light. Both systems are described by its observations that can be represented by matrices that, however, affect its Hilbert spaces. To describe elements of different spaces, e.g. two matrices and a tensor product is introduced .
0.8 Non separability and scattering
The block based representation leads to new features of data scattering and has a quantum analogue.
Correlation.
Formally, the block based representation (0.7) looks as onedimensional transform (0.2) and we find
properties given by (0.3)
for data scattering. However, due to large number of degrees of freedom, scattering obtains new features.
Let us assume that both arrays and are block matrices consisting of other matrices. They are fourdimensional arrays that
we specify by four indexes . Let, in contrast to , the array be dependant on the last pair of indexes only
Under these conditions the equations (0.7) take the following form
(29) 
where .
An important fact follows that
the array is nonseparable. We will use the term separable as
divisibility, when the variables are factorized. For example, the function
is separable over and and the function
is not. In our case we focus on two pairs of variables, a pair , that describe basis images
, and pair . From this point of view, the array is separable in contrast to , that is a nonseparable array, because it is a sum of products
(30) 
Non separability is a kind of correlation. Now this is a correlation between the matrices from different spaces, the basis images and the matrices .
Scattering.
Due to the property
of the scalar product of basis matrices
(12),
we find that
or
(31) 
For data scattering this result tells us the following. The component scatters into every with its weight and it may be established from every item
This is a new property and it is usually impossible.
The property arises from non separability produced by orthogonal transform of the block matrix . The transform results in correlation between
the set of basis images and the input matrices.
A quantum analogue.
The blockbased representation can be introduced for a three particle quantum system.
Let us consider a three particle operator given by
where and is a single particle basis. The operator is Hermitian and unitary
Let us note that two particle operator
is a quantum analogue of the matrix
, given by (0.6).
Let us introduce three particle operators and that are equal up to orthogonal transform
given by
These equations can be written in a block form. Introducing the matrix elements over particle 1 for operators and way we get two operators of particle 2 and 3, which we denote as
where . Then we have the block representation
Let be the operator of particle 3 only, , then we find being a two particle nonseparable operator
This equation is a quantum analogue of (31) found for digital data scattering. It is obvious, that
where the average refers to particle 2.
0.9 A steganographic scheme
The blockbased representation may be useful for frequency domain steganographic technique.
Scheme. Let the digital data
be images in a spatial domain and be its representation in a frequency domain. Any standard frequency embedding scheme has the following steps.

Transform data into the frequency domain and embed a message using an algorithm , where is a set of parameters with a possible secrete key.

Transform data into the spatial domain and send it to a receiver via the communication channel.

Extract the embedded message using detection algorithm .
The scheme includes transformations
Indeed, the transform can scatter the embedded data among the spatial domain. Scattering may result in more robust of hidden data
to degradation due to various transformations.
An example is a JPEG lossy compression, that stores image in a graphical format. By decreasing the image redundancy, the lossy compression introduces changes into embedded data that exploits the redundancy.
So, there is a trade between the compression and the quality of the extracted information. The higher the compression level is, the worse the quality is.
Data scattering in the spatial domain.
Let us consider data scattering in the block based representation
(0.7), assuming . Let a message be embedded into . Then two spatial items will be changed
(32) 
To extract the message, we need or two items and
The equation is a basis for the detection algorithm
Data scattering means that all spatial items were changed after embedding and all items are required for detection. Any frequency domain watermarking technique has these properties
regardless of whether it use the block based representation or not.
However, the representation leads to new features appearance.
Embedding.
Let us assume that both vectors and have two components. Also , where is an image in the spatial domain, . In accordance to (0.8), the frequency representation consists of pair of
fourdimensional arrays
Let the embedding algorithm replace with messages
(33) 
where four matrices are introduced messages. The main feature of this algorithm is store the ability to the structure of the array that holds a set of tensor products including basis images. In the spatial domain we have
This allows us to exploit the equation (31) for detection. Then the embedded messages can be extracted, if the component or the component is given
For this case the detection algorithm works as follows
Let us note that it differs from the standard algorithm (0.9) that needs two spatial items instead of one.
Moreover there is a difference between this and the spatial domain embedding.
We assume that message is embedded into spatial components
, . It is clear that two messages can be embedded only. In the frequency domain there are four messages that may be embedded. But what is more important, these four messages can be distinguished. This fact plays a key role in detection and arises from coupling the messages and basis images to be orthogonal and hence to be well distinguished.
Taking into account the considered quantum analogues, we admit that the presented scheme can be extended to quantum mechanic fields.
0.10 Conclusions

Orthogonal transform provides decomposition over basis items or basis images that have a simple quantum analogue. So, they are a representation of single particle operators that describe transitions of a particle between its states.

Grayscale, color and wavelet basis images can be introduced for decomposition of two and threedimensional arrays.

Basis images can be achieved by orthogonal transform of a standard basis that is a set of unit vectors, unit matrices and etc. This fact illustrates digital data scattering, a process of redistributing pixel energy.

Due to scattering, energy can be concentrated in small amount of items or, in contrast, be spread. Both cases are interesting for applications. For example, in lossy compression scattering allows to extract the image redundancy, in watermarking it can increase the robustness of a watermark.

A block matrix of basis images may be orthogonal and suitable for transformation of multidimensional arrays. Different degrees of freedom can be correlated by this transform and non separable arrays can be produced. As a result, in this way, new features of scattering appears. These features may be used whole executing detection algorithms in frequency domain watermarking.
Bibliography

[1]
Silveira T. L. T., Bayer F. M., Cintra R. J., Kulasekera S., Madanayake A., Kozakevicius A. J. An. Orthogonal 16point Approximate DCT for Image and Video Compression.
arXiv:1606.05562v1 [cs.IT], 27 May, 2016.
Perera M., Sirani K. Signal Processing based on Stable radix2 DCT IIV Algorithms having Orthogonal Factors, Electronic Journal of Linear Algebra, Volume 31, pp. 362380, 2016.
Shoberg A.G., Shoberg K.A. Influence of execution of orthogonal block transform types and results of comparison. 2018 , J. Phys.: Conf. Ser. 1015 032130. 
[2]
Fracastoro G., Fosson S. M., Magl E.
Steerable Discrete Cosine Transform.
arXiv:1610.09152v1 [cs.IT] 28 Oct 2016.
Hamzah B. F.A., Minewaki S., Yoshida T. Iwahashi M. Reduction of rounding noise and lifting steps in nonseparable fourdimensional quadruple lifting integer wavelet transform. J Image Video Proc. 2018;36, 2018. 
[3]
Nguyen B. C., Yoon S. M., Lee HK. Proceedings of the 5th international conference on Digital Watermarking, Y.Q. Shi and B. Jeon (Eds.): IWDW 2006, LNCS 4283, pp. 61 70, 2006.
Gorbachev V.N., Denisov L. A., Kaynarova E. M. Embedding of a binary image into Gray planes. Russian, Komputer Optika, V. 37, No 3, pp. 385390, 2013.  [4] Pratt W. K. Digital Image Processing, 2nd ed., WileyInterscience, New York, 1991.
 [5] Salomon D. A guide to data compression method. SpringerVerlag, 2002.
 [6] Gorbachev V.N., Kaynarova E.M., Makarov A.X., Yakovleva E.S. Digital Image Watermarking Using DWT Basis Matrices. Proceedings of the 21st Conference of Open Innovations Association FRUCT, Helsinki, Finland, pp. 127133, 2017.
 [7] Strang G. Linear Algebra and Its Application. Thomson Learning, Inc., 2006.
 [8] Gantmaher, F.P. Theory of matrices. Moscow, Fizmalit, 2010, 560 p.
 [9] Mallat S. A Wavelet Tour of Signal Processing, ISBN : 012466606X Academic Press, 1999.