Multidimensional system

Last updated March 13, 2022

In mathematical systems theory, a multidimensional system or m-D system is a system in which not only one independent variable exists (like time), but there are several independent variables.

Important problems such as factorization and stability of m-D systems (m > 1) have recently attracted the interest of many researchers and practitioners. The reason is that the factorization and stability is not a straightforward extension of the factorization and stability of 1-D systems because, for example, the fundamental theorem of algebra does not exist in the ring of m-D (m > 1) polynomials.

Applications

Multidimensional systems or m-D systems are the necessary mathematical background for modern digital image processing with many applications in biomedicine, X-ray technology and satellite communications.^[1]^[2] There are also some studies combining m-D systems with partial differential equations (PDEs).

Linear multidimensional state-space model

A state-space model is a representation of a system in which the effect of all "prior" input values is contained by a state vector. In the case of an m-d system, each dimension has a state vector that contains the effect of prior inputs relative to that dimension. The collection of all such dimensional state vectors at a point constitutes the total state vector at the point.

Consider a uniform discrete space linear two-dimensional (2d) system that is space invariant and causal. It can be represented in matrix-vector form as follows:^[3]^[4]

Represent the input vector at each point $(i,j)$ by $u(i,j)$ , the output vector by $y(i,j)$ the horizontal state vector by $R(i,j)$ and the vertical state vector by $S(i,j)$ . Then the operation at each point is defined by:

{\begin{aligned}R(i+1,j)&=A_{1}R(i,j)+A_{2}S(i,j)+B_{1}u(i,j)\\S(i,j+1)&=A_{3}R(i,j)+A_{4}S(i,j)+B_{2}u(i,j)\\y(i,j)&=C_{1}R(i,j)+C_{2}S(i,j)+Du(i,j)\end{aligned}}

where $A_{1},A_{2},A_{3},A_{4},B_{1},B_{2},C_{1},C_{2}$ and $D$ are matrices of appropriate dimensions.

These equations can be written more compactly by combining the matrices:

{\begin{bmatrix}R(i+1,j)\\S(i,j+1)\\y(i,j)\end{bmatrix}}={\begin{bmatrix}A_{1}&A_{2}&B_{1}\\A_{3}&A_{4}&B_{2}\\C_{1}&C_{2}&D\end{bmatrix}}{\begin{bmatrix}R(i,j)\\S(i,j)\\u(i,j)\end{bmatrix}}

Given input vectors $u(i,j)$ at each point and initial state values, the value of each output vector can be computed by recursively performing the operation above.

Multidimensional transfer function

A discrete linear two-dimensional system is often described by a partial difference equation in the form: $\sum _{p,q=0,0}^{m,n}a_{p,q}y(i-p,j-q)=\sum _{p,q=0,0}^{m,n}b_{p,q}x(i-p,j-q)$

where $x(i,j)$ is the input and $y(i,j)$ is the output at point $(i,j)$ and $a_{p,q}$ and $b_{p,q}$ are constant coefficients.

To derive a transfer function for the system the 2d Z-transform is applied to both sides of the equation above.

\sum _{p,q=0,0}^{m,n}a_{p,q}z_{1}^{-p}z_{2}^{-q}Y(z_{1},z_{2})=\sum _{p,q=0,0}^{m,n}b_{p,q}z_{1}^{-p}z_{2}^{-q}X(z_{1},z_{2})

Transposing yields the transfer function $T(z_{1},z_{2})$ :

T(z_{1},z_{2})={Y(z_{1},z_{2}) \over X(z_{1},z_{2})}={\sum _{p,q=0,0}^{m,n}b_{p,q}z_{1}^{-p}z_{2}^{-q} \over \sum _{p,q=0,0}^{m,n}a_{p,q}z_{1}^{-p}z_{2}^{-q}}

So given any pattern of input values, the 2d Z-transform of the pattern is computed and then multiplied by the transfer function $T(z_{1},z_{2})$ to produce the Z-transform of the system output.

Realization of a 2d transfer function

Often an image processing or other md computational task is described by a transfer function that has certain filtering properties, but it is desired to convert it to state-space form for more direct computation. Such conversion is referred to as realization of the transfer function.

Consider a 2d linear spatially invariant causal system having an input-output relationship described by:

Y(z_{1},z_{2})={\sum _{p,q=0,0}^{m,n}b_{p,q}z_{1}^{-p}z_{2}^{-q} \over \sum _{p,q=0,0}^{m,n}a_{p,q}z_{1}^{-p}z_{2}^{-q}}X(z_{1},z_{2})

Two cases are individually considered 1) the bottom summation is simply the constant 1 2) the top summation is simply a constant $k$ . Case 1 is often called the “all-zero” or “finite impulse response” case, whereas case 2 is called the “all-pole” or “infinite impulse response” case. The general situation can be implemented as a cascade of the two individual cases. The solution for case 1 is considerably simpler than case 2 and is shown below.

Example: all zero or finite impulse response

Y(z_{1},z_{2})=\sum _{p,q=0,0}^{m,n}b_{p,q}z_{1}^{-p}z_{2}^{-q}X(z_{1},z_{2})

The state-space vectors will have the following dimensions:

R(1\times m),\quad S(1\times n),\quad x(1\times 1)

and

y(1\times 1)

Each term in the summation involves a negative (or zero) power of $z_{1}$ and of $z_{2}$ which correspond to a delay (or shift) along the respective dimension of the input $x(i,j)$ . This delay can be effected by placing $1$ ’s along the super diagonal in the $A_{1}$ . and $A_{4}$ matrices and the multiplying coefficients $b_{i,j}$ in the proper positions in the $A_{2}$ . The value $b_{0,0}$ is placed in the upper position of the $B_{1}$ matrix, which will multiply the input $x(i,j)$ and add it to the first component of the $R_{i,j}$ vector. Also, a value of $b_{0,0}$ is placed in the $D$ matrix which will multiply the input $x(i,j)$ and add it to the output $y$ . The matrices then appear as follows:

A_{1}={\begin{bmatrix}0&0&0&\cdots &0&0\\1&0&0&\cdots &0&0\\0&1&0&\cdots &0&0\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&0&\cdots &0&0\\0&0&0&\cdots &1&0\end{bmatrix}}

A_{2}={\begin{bmatrix}0&0&0&\cdots &0&0\\0&0&0&\cdots &0&0\\0&0&0&\cdots &0&0\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&0&\cdots &0&0\\0&0&0&\cdots &0&0\end{bmatrix}}

A_{3}={\begin{bmatrix}b_{1,n}&b_{2,n}&b_{3,n}&\cdots &b_{m-1,n}&b_{m,n}\\b_{1,n-1}&b_{2,n-1}&b_{3,n-1}&\cdots &b_{m-1,n-1}&b_{m,n-1}\\b_{1,n-2}&b_{2,n-2}&b_{3,n-2}&\cdots &b_{m-1,n-2}&b_{m,n-2}\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\b_{1,2}&b_{2,2}&b_{3,2}&\cdots &b_{m-1,2}&b_{m,2}\\b_{1,1}&b_{2,1}&b_{3,1}&\cdots &b_{m-1,1}&b_{m,1}\end{bmatrix}}

$A_{4}={\begin{bmatrix}0&0&0&\cdots &0&0\\1&0&0&\cdots &0&0\\0&1&0&\cdots &0&0\\\vdots &\vdots &\vdots &\ddots &\vdots &\vdots \\0&0&0&\cdots &0&0\\0&0&0&\cdots &1&0\end{bmatrix}}$

B_{1}={\begin{bmatrix}1\\0\\0\\0\\\vdots \\0\\0\end{bmatrix}}

B_{2}={\begin{bmatrix}b_{0,n}\\b_{0,n-1}\\b_{0,n-2}\\\vdots \\b_{0,2}\\b_{0,1}\end{bmatrix}}

C_{1}={\begin{bmatrix}b_{1,0}&b_{2,0}&b_{3,0}&\cdots &b_{m-1,0}&b_{m,0}\\\end{bmatrix}}

C_{2}={\begin{bmatrix}0&0&0&\cdots &0&1\\\end{bmatrix}}

D={\begin{bmatrix}b_{0,0}\end{bmatrix}}

^[3]^[4]

Related Research Articles

Gradient Multivariate derivative (mathematics)

In vector calculus, the gradient of a scalar-valued differentiable function $f$ of several variables is the vector field $whose value at a point is the vector whose components are the partial derivatives of at . That is, for, its gradient is defined at the point in n- dimensional space as the vector$

In mathematics, and more specifically in linear algebra, a linear subspace, also known as a vector subspace is a vector space that is a subset of some larger vector space. A linear subspace is usually simply called a subspace when the context serves to distinguish it from other types of subspaces.

In mathematics, particularly in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication, the number of columns in the first matrix must be equal to the number of rows in the second matrix. The resulting matrix, known as the matrix product, has the number of rows of the first and the number of columns of the second matrix. The product of matrices $A$ and $B$ is denoted as $AB$ .

In linear algebra, a Toeplitz matrix or diagonal-constant matrix, named after Otto Toeplitz, is a matrix in which each descending diagonal from left to right is constant. For instance, the following matrix is a Toeplitz matrix:

In mathematics, the cross product or vector product is a binary operation on two vectors in a three-dimensional oriented Euclidean vector space, and is denoted by the symbol $. Given two linearly independent vectors a and b, the cross product, a \times b, is a vector that is perpendicular to both a and b, and thus normal to the plane containing them. It has many applications in mathematics, physics, engineering, and computer programming. It should not be confused with the dot product.$

In the mathematical field of differential geometry, one definition of a metric tensor is a type of function which takes as input a pair of tangent vectors $v$ and $w$ at a point of a surface and produces a real number scalar $g (v, w)$ in a way that generalizes many of the familiar properties of the dot product of vectors in Euclidean space. In the same way as a dot product, metric tensors are used to define the length of and angle between tangent vectors. Through integration, the metric tensor allows one to define and compute the length of curves on the manifold.

In mathematics, a block matrix or a partitioned matrix is a matrix that is interpreted as having been broken into sections called blocks or submatrices. Intuitively, a matrix interpreted as a block matrix can be visualized as the original matrix with a collection of horizontal and vertical lines, which break it up, or partition it, into a collection of smaller matrices. Any matrix may be interpreted as a block matrix in one or more ways, with each interpretation defined by how its rows and columns are partitioned.

In control engineering, a state-space representation is a mathematical model of a physical system as a set of input, output and state variables related by first-order differential equations or difference equations. State variables are variables whose values evolve over time in a way that depends on the values they have at any given time and on the externally imposed values of input variables. Output variables’ values depend on the values of the state variables.

In mathematics, the matrix exponential is a matrix function on square matrices analogous to the ordinary exponential function. It is used to solve systems of linear differential equations. In the theory of Lie groups, the matrix exponential gives the connection between a matrix Lie algebra and the corresponding Lie group.

In numerical linear algebra, a Givens rotation is a rotation in the plane spanned by two coordinates axes. Givens rotations are named after Wallace Givens, who introduced them to numerical analysts in the 1950s while he was working at Argonne National Laboratory.

In linear algebra, linear transformations can be represented by matrices. If $is a linear transformation mapping to and is a column vector with entries, then$

In mathematics, the Kronecker product, sometimes denoted by ⊗, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a generalization of the outer product from vectors to matrices, and gives the matrix of the tensor product linear map with respect to a standard choice of basis. The Kronecker product is to be distinguished from the usual matrix multiplication, which is an entirely different operation. The Kronecker product is also sometimes called matrix direct product.

Quantum statistical mechanics is statistical mechanics applied to quantum mechanical systems. In quantum mechanics a statistical ensemble is described by a density operator S, which is a non-negative, self-adjoint, trace-class operator of trace 1 on the Hilbert space H describing the quantum system. This can be shown under various mathematical formalisms for quantum mechanics. One such formalism is provided by quantum logic.

In linear algebra, a nilpotent matrix is a square matrix N such that

In control theory, a state observer or state estimator is a system that provides an estimate of the internal state of a given real system, from measurements of the input and output of the real system. It is typically computer-implemented, and provides the basis of many practical applications.

In mathematics, matrix calculus is a specialized notation for doing multivariable calculus, especially over spaces of matrices. It collects the various partial derivatives of a single function with respect to many variables, and/or of a multivariate function with respect to a single variable, into vectors and matrices that can be treated as single entities. This greatly simplifies operations such as finding the maximum or minimum of a multivariate function and solving systems of differential equations. The notation used here is commonly used in statistics and engineering, while the tensor index notation is preferred in physics.

In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process.

In analytical mechanics, the mass matrix is a symmetric matrix M that expresses the connection between the time derivative $of the generalized coordinate vector q of a system and the kinetic energy T of that system, by the equation$

In signal processing, multidimensional empirical mode decomposition is an extension of the 1-D EMD algorithm to a multiple-dimensional signal. The Hilbert–Huang empirical mode decomposition (EMD) process decomposes a signal into intrinsic mode functions combined with the Hilbert spectral analysis, known as Hilbert–Huang transform (HHT). The multidimensional EMD extends the 1-D EMD algorithm into multiple-dimensional signals. This decomposition can be applied to image processing, audio signal processing, and various other multidimensional signals.

Generalized pencil-of-function method (GPOF), also known as matrix pencil method, is a signal processing technique for estimating a signal or extracting information with complex exponentials. Being similar to Prony and original pencil-of-function methods, it is generally preferred to those for its robustness and computational efficiency.

References

↑ Bose, N.K., ed. (1985). Multidimensional Systems Theory, Progress, Directions and Open Problems in Multidimensional Systems. Dordre http, Holland: D. Reidel Publishing Company.
↑ Bose, N.K., ed. (1979). Multidimensional Systems: Theory and Applications. IEEE Press.
1 2 Tzafestas, S.G., ed. (1986). Multidimensional Systems: Techniques and Applications. New York: Marcel-Dekker.
1 2 Kaczorek, T. (1985). Two-Dimensional Linear Systems. Lecture Notes Contr. and Inform. Sciences. Vol. 68. Springer-Verlag.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] Bose, N.K., ed. (1985). Multidimensional Systems Theory, Progress, Directions and Open Problems in Multidimensional Systems. Dordre http, Holland: D. Reidel Publishing Company.

[2] Bose, N.K., ed. (1979). Multidimensional Systems: Theory and Applications. IEEE Press.

[Tzafestas-3] 1 2 Tzafestas, S.G., ed. (1986). Multidimensional Systems: Techniques and Applications. New York: Marcel-Dekker.

[Kaczorek-4] 1 2 Kaczorek, T. (1985). Two-Dimensional Linear Systems. Lecture Notes Contr. and Inform. Sciences. Vol. 68. Springer-Verlag.

[1]

[2]

[3]

[4]