A General Method for Generating Discrete Orthogonal Matrices

Abstract

Discrete orthogonal matrices have applications in information coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize continuous orthogonal functions that have been discovered. The need of such continuous functions is restrictive. Polynomials, as the simplest class of continuous functions, are widely studied for their orthogonalality, to serve the purpose of generating orthogonal matrices. However, beginning with continuous orthogonal polynomials still takes much work. To overcome this complexity while improving the efficiency and flexibility, we present a general method for generating orthogonal matrices directly through the construction of certain even and odd polynomials from a set of distinct positive values, bypassing the need of continuous orthogonal functions. We present a constructive proof by induction that not only asserts the existence of such polynomials, but also tells how to iteratively construct them. Besides the derivation of the method as simple as a few nested loops, we discuss two well-known discrete transforms, the Discrete Cosine Transform and the Discrete Tchebichef Transform, how they can be achieved using our method with the specific values, and show how to embed them into the transform module of video coding. By the same token, we also give the examples for generating new orthogonal matrices from arbitrarily chosen values. The demonstrative experiments indicate that our method is not only simpler to implement, but also more efficient and flexible. It can generate orthogonal matrices of larger sizes, compared with those existing methods.

Learning for Data Synthesis: Joint Local Salient Projection and Adversarial Network Optimization for Vehicle Re-Identification

“…In Equation ( 1 ), is a matrix [ 36 ] having the property , where takes values within a range depending on the specific situation. and are the weights developed from the 10 anchor points from the input image and the 10 transformed anchor points in the transferred image, respectively.…”

Light‐field image super‐resolution with depth feature by multiple‐decouple and fusion module

“…In practice, the M i matrices are 2 × 2 orthogonal matrices obtained by the Gram-Schmidt orthogonalization [17][18][19]. It's important to note that we are only considering 2D angularly rotated vectors, and no translation is required in our cases.…”

Sentiment analysis by using Naïve‐Bayes classifier with stacked CARU

“…In order to apply the Naïve‐Bayes classifier to the extraction of continuous data and estimate the class probability of $$P(C)$$ and the conditional probability of $$P(X_i|C)$$ with $$i=1,2,\ldots$$ in Figure 4, we should first discretise the received features with the aim of converting continuous values to discrete values. A simple way to do this is to use median‐based discretization, which converts continuous features into a range of the set $$\{0.0,1.0\}$$, and then we can use the discrete orthogonal matrix generation method, which is the most frequently applied discretisation method in the literature [15]. After, the Naïve‐Bayes can be written in the discriminative way of neural network functions.…”

“…in Figure 4, we should first discretise the received features with the aim of converting continuous values to discrete values. A simple way to do this is to use medianbased discretization, which converts continuous features into a range of the set {0.0, 1.0}, and then we can use the discrete orthogonal matrix generation method, which is the most frequently applied discretisation method in the literature [15]. After, the Naïve-Bayes can be written in the discriminative way of neural network functions.…”