Next Article in Journal
SL(2,C) Scheme Processing of Singularities in Quantum Computing and Genetics
Previous Article in Journal
Mixture of Shanker Distributions: Estimation, Simulation and Application
Previous Article in Special Issue
A Fast Novel Recursive Algorithm for Computing the Inverse of a Generalized Vandermonde Matrix
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

RSVD for Three Quaternion Tensors with Applications in Color Video Watermark Processing

School of Mathematics, East China University of Science and Technology, Shanghai 200237, China
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(3), 232; https://doi.org/10.3390/axioms12030232
Submission received: 13 January 2023 / Revised: 15 February 2023 / Accepted: 17 February 2023 / Published: 22 February 2023
(This article belongs to the Special Issue Advances in Linear Algebra)

Abstract

:
In this paper, we study the restricted singular-value decomposition (RSVD) for three quaternion tensors under the Einstein product, and give higher-order RSVD over the quaternion algebra, which can achieve simultaneous singular value decomposition of three quaternion tensors. Moreover, we give the algorithm for computing the RSVD of for quaternion tensors. What is more, we present a new blind color video watermarking scheme based on the forth-order RSVD over the quaternion algebra, and our numerical example demonstrates the effectiveness of the framework.
MSC:
15A69; 11R52; 15A18; 15A09

1. Introduction

Higher-order tensor decomposition has a wide range of applications, such as signal processing, data mining, genomic signals and so on. Kolda and Bader, [1] in 2009, provided theoretical developments and applications of tensor decomposition. Moreover, a lot of papers discussing tensor decomposition and other fields of tensor theory have been presented [2,3,4,5,6,7,8,9,10,11,12].
Tensor equations have high application values in engineering and science, for example, modeling the problems for continuum physics and engineering, isotropic and anisotropic flexibility, and reducing order modeling [13]. In addition, there are also some papers using different approaches to investigate tensor equation over fields [4,14].
W.R. Hamilton [15] in 1843 first introduced the concept of quaternions. Quaternion algebra is an associative and noncommutative division algebra over the real number field. Many scholars have applied it to quantum physics, signal, computer science, and color image processing, etc. [16]. In particular, applications for quaternion matrix factorization in color signal processing, image processing, and recognition are also prominent [17,18].
It is well known that matrix decomposition has a wide range of applications, and at the same time, due to the quaternion structure, the quaternion matrix retains more information, which is especially well applied in image processing. However, for video or higher-dimensional signals, the quaternion matrix can no longer meet the storage requirements. Therefore, research on quaternion tensors becomes necessary.
Multi-tensor factorization on quaternion algebra is currently underdeveloped compared to tensor factorization on traditional algebra. It is very challenging to generalize results of real or complex numbers to quaternions due to their non-commutative properties. Tensor decomposition and quaternion algebra all have wide applications [19,20], and the theory of quaternion tensor theory is also in urgent need of development. Therefore, in this paper, we propose the restricted singular value decomposition (higher-order RSVD) of quaternion tensor triples. Our contributions are as follows:
  • We give the structure for higher-order RSVD on quaternion algebra as wells as two special cases: singular value decomposition for one quaternion tensor and quotient singular value decomposition for two quaternion tensors (higher-order QSVD) under the isomorphic group structures and the Einstein product (Definition 1).
  • We present a blind color video watermarking scheme based on the forth-order RSVD over the quaternion algebra.
The rest of the paper is organized as follows. In Section 2, we introduce some basic knowledge of tensor quaternions. In Section 3, we investigate the restricted singular value decomposition for three quaternion tensors. In Section 4, we give the application for RSVD. We finally give the conclusion in Section 5.

2. Preliminaries

The number of dimensions of a tensor is called the order. Matrices (tensors of order two) are written as capitals, e.g., A. Higher-order tensors (order three or higher) are written as calligraphic letters, e.g., A . An order N tensor A = ( a i 1 i N ) 1 i j I j ( j = 1 , , N ) is a multidimensional array with I 1 I 2 I N entries. Let R I 1 × × I N , C I 1 × × I N and H I 1 × × I N be, respectively, for the sets of the order N dimension I 1 × × I N tensors over the real number field R , the complex number field C and the quaternion algebra
H = q 0 + q 1 i + q 2 j + q 3 k | i 2 = j 2 = k 2 = ijk = 1 , q 0 , q 1 , q 2 , q 3 R .
As we all know, quaternion algebra is an associative and noncommutative division algebra. We refer the reader to the recent book [21] for more definitions and properties of quaternions. The symbol q ¯ stands for the conjugate transpose of a quaternion q = q 0 + q 1 i + q 2 j + q 3 k , where q 0 , q 1 , q 2 , q 3 R . Clearly, q ¯ = q 0 q 1 i q 2 j q 3 k .
For a quaternion tensor A = ( a i 1 i N j 1 j N ) H I 1 × × I N × J 1 × × J N , let B = ( b j 1 j N i 1 i N ) H J 1 × × J N × I 1 × × I N be the conjugate transpose of A , where b j 1 j N i 1 i N = a ¯ i 1 i N j 1 j N . The tensor B is denoted by A * . A “square” tensor A H I 1 × × I N × I 1 × × I N is said to be Hermitian if A = A * . A “square” tensor D = ( d i 1 i N i 1 i N ) H I 1 × × I N × I 1 × × I N is called a diagonal tensor if all its entries are zero except for d i 1 i N i 1 i N . If all the diagonal entries d i 1 i N i 1 i N = 1 , then D is a unit tensor, denoted by I . The zero tensor with suitable order is denoted by 0. More detail regarding the basic definitions and properties of tensors are in [1].
The most common types of tensor multiplications are denoted by N for the Einstein, × n for the n-mode, ⊗ for the Kronecker, ⊙ for the Khatri–Rao, and ⊛ for the Hadamard products. We refer the reader to the paper [22] for the latter four definitions.
We only focus on the Einstein product in this paper. First of all, the definition of the Einstein product is as following.
Definition 1
(Einstein product [23]). For A H I 1 × × I N × J 1 × × J N and B H J 1 × × J N × K 1 × × K M , the Einstein product of tensors A and B is defined by the operation N via
( A N B ) i 1 i N k 1 k M = j 1 j N a i 1 i N j 1 j N b j 1 j N k 1 k M ,
where A N B H I 1 × × I N × K 1 × × K M .
As a contracted product, the Einstein product has great applications for continuum mechanics [24] and the relativity theory [23]. The associative law of this tensor product is established. On the one hand, the Einstein product 1 is the standard matrix multiplication. On the other hand, when specifying mode summation, the n-mode product × n is the Einstein product 1 A more general definition of contraction can be seen in [25].
In 2013, Navasca et al. [4] introduced the transformation f between the tensor and matrix over real number field. We give the following definition for the transformation f between the tensor and matrix over the quaternion.
Definition 2
(transformation [4]). Define the transformation f : T I 1 , I 2 , , I N , J 1 , J 2 , , J N ( H ) M I 1 · I 2 I N 1 · I N , J 1 · J 2 J N 1 · J N ( H ) with f ( A ) = A defined component-wise as
( A ) i 1 i 2 i n j 1 j 2 j n f ( A ) [ i 1 + k = 2 N ( i k 1 ) s = 1 k 1 I s ] [ j 1 + k = 2 N ( j k 1 ) s = 1 k 1 J s ] ,
where A T I 1 , I 2 , , I N , J 1 , J 2 , , J N ( H ) and A M I 1 · I 2 I N , J 1 · J 2 J N ( H ) . That is, the element has one-to-one correspondence between the quaternion matrix A and the quaternion tensor A .
Lemma 1.
Let A H I 1 × I 2 × I N × J 1 × J 2 × × J N , B H J 1 × J 2 × × J N × L 1 × L 2 × × L N and f be the map defined in (2). Then the following properties hold:
1.
The map f is a bijection. Moreover, there exists a bijective inverse map f 1 :
M I 1 · I 2 I N 1 · I N , J 1 · J 2 J N 1 · J N ( H ) f 1 T I 1 , I 2 , , I N , J 1 , J 2 , , J N ( H )
2.
The map satisfies f ( A N B ) = f ( A ) · f ( B ) , where · refers to the usual matrix multiplication.
As can be seen from the Lemma 1, the Einstein product can be defined by the transformation:
A N B = f 1 [ f ( A N B ) ] = f 1 [ f ( A ) · f ( B ) ] .
Consequently, the inverse map f 1 satisfies
f 1 ( A · B ) = f 1 ( A ) N f 1 ( B ) ,
where A and B are quaternion matrices with appropriate sizes.
The following lemma appears in [4] over the real number field. In addition, we can extend it to the quaternion algebra by using similar methods.
Lemma 2
([4]). Suppose ( M , · ) is a group. Let f : T M be any bijection. Then we can define a group structure on T by defining
A N B = f 1 [ f ( A ) · f ( B ) ]
for all A , B T . Moreover, the mapping f is an isomorphism.

3. Restricted Singular-Value Decomposition for Three Quaternion Tensors

In this section, we investigate the restricted singular value decomposition of three quaternion tensors ( A , B , C ) based on the isomorphic group structures and the Einstein product.
De Moor introduced the RSVD for a matrix triplet over real field, and Golub [26] and Zha [27] further developed and discussed by Chu and De Moor [28,29]. Moreover, Chu, De Lathauwer, and De Moor [30] presented the CSD-based QR-type method to compute the RSVD for a real matrix triplet. More recently, He, Wang, and De Moor [31] presented the RSVD for a matrix triplet over the quaternion.
Lemma 3
(RSVD for three quaternion matrices [26,31]). Let A H m × n , B H m × p and C H q × n be given. There exist unitary matrices U H q × q and V H p × p , and nonsingular matrices P H m × m and Q H n × n such that
P * A Q = S a , P * B V = S b , U * C Q = S c ,
where
S a S b S c = r 1 r 2 r 3 r 4 r 6 r 3 r 4 r 5 r 1 r 2 r 3 r 4 r 5 r 2 r 4 r 6 ( I 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 I 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 S a b c 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 0 I 0 0 0 0 0 0 I 0 ) ,
and S a b c = d i a g { σ 1 , , σ r 4 } is square nonsingular diagonal with positive diagonal elements, σ 1 , , σ r 4 are defined to be the non-trivial restricted singular values of the matrix triplet A , B , C . Expressions for the integers r 1 , , r 6 are the following:
r 1 = r A B C 0 r ( B ) r ( C ) ,
r 2 = r ( A , B ) + r ( C ) r A B C 0 ,
r 3 = r ( B ) + r A C r A B C 0 ,
r 4 = r ( A ) + r A B C 0 r A C r ( A , B ) ,
r 5 = r ( A , B ) r ( A ) , r 6 = r A C r ( A ) ,
where the symbol r ( A ) stands for the rank of the quaternion matrix A.
Now we give the definitions of the unitary quaternion tensor and quaternion tensor inverse.
Definition 3 (unitary quaternion tensor).
A tensor U H I 1 × × I N × I 1 × × I N is unitary if U N U * = U * N U = I .
Definition 4 (inverse of an even order tensor).
A tensor X H I 1 × × I N × I 1 × × I N is called the inverse of A H I 1 × × I N × I 1 × × I N if it satisfies A N X = X N A = I . It is denoted by  A 1 .
Now we give the higher-order RSVD over the quaternion in the following theorem.
Theorem 1.
(higher-order RSVD over the quaternion tensor) Given A H I 1 × × I N × J 1 × × J N , B H I 1 × × I N × K 1 × × K N and C H L 1 × × L N × J 1 × × J N . Then there exist unitary tensors U H L 1 × × L N × L 1 × × L N , V H K 1 × × K N × K 1 × × K N and invertible tensors P H I 1 × × I N × I 1 × × I N , Q H J 1 × × J N × J 1 × × J N such that
P * N A N Q = S A , P * N B N V = S B , U * N C N Q = S C ,
where the tensors S A R I 1 × × I N × J 1 × × J N , S B R I 1 × × I N × K 1 × × K N and S C R L 1 × × L N × J 1 × × J N have the following structures
( S A ) i 1 i N j 1 j N = 1 , i f ( i 1 i N j 1 j N ) = ( p 1 a 1 p N a 1 q 1 a 1 q N a 1 ) , σ a 2 , i f ( i 1 i N j 1 j N ) = ( p 1 a 2 p N a 2 q 1 a 2 q N a 2 ) , 0 , o t h e r w i s e ,
( S B ) i 1 i N k 1 k N = 1 , i f ( i 1 i N k 1 k N ) = ( h 1 b h N b w 1 b w N b ) , 0 , o t h e r w i s e ,
( S C ) l 1 l N j 1 j N = 1 , i f ( l 1 l N j 1 j N ) = ( u 1 c 1 u N c 1 v 1 c 1 v N c 1 ) , 1 , i f ( l 1 l N j 1 j N ) = ( u 1 c 2 u N c 2 v 1 c 2 v N c 2 ) , 0 , o t h e r w i s e ,
where
a 1 { 1 , , r 1 + r 2 + r 3 } , a 2 { r 1 + r 2 + r 3 + 1 , , r 1 + r 2 + r 3 + r 4 } ,
b { 1 , , r 3 + r 4 + r 5 } , c 1 { 1 , , r 2 } , c 2 { r 2 + 1 , , r 2 + r 4 + r 6 } ,
r 1 = r f ( A ) f ( B ) f ( C ) 0 r ( f ( B ) ) r ( f ( C ) ) ,
r 2 = r ( f ( A ) , f ( B ) ) + r ( f ( C ) ) r f ( A ) f ( B ) f ( C ) 0 ,
r 3 = r ( f ( B ) ) + r f ( A ) f ( C ) r f ( A ) f ( B ) f ( C ) 0 ,
r 4 = r ( f ( A ) ) + r f ( A ) f ( B ) f ( C ) 0 r f ( A ) f ( C ) r ( f ( A ) , f ( B ) ) ,
r 5 = r f ( A ) , f ( B ) r f ( A ) , r 6 = r f ( A ) f ( C ) r f ( A ) ,
σ a 2 are the non-trivial restricted singular values of the matrix triplet f ( A ) , f ( B ) , f ( C ) , and f is the transformation in (2). Expressions for the subscripts ( p 1 a 1 p N a 1 q 1 a 1 q N a 1 ) , ( p 1 a 2 p N a 2 q 1 a 2 q N a 2 ) , ( h 1 b h N b w 1 b w N b ) , ( u 1 c 1 u N c 1 v 1 c 1 v N c 1 ) and ( u 1 c 2 u N c 2 v 1 c 2 v N c 2 ) are given in Theorem 2.
Proof. 
Let A = f ( A ) H ( I 1 I 2 I N ) × ( J 1 J 2 J N ) , B = f ( B ) H ( I 1 I 2 I N ) × ( K 1 K 2 K N ) and
C = f ( C ) H ( L 1 L 2 L N ) × ( J 1 J 2 J N ) . Applying the RSVD (Lemma 3) on the matrix triplet ( A , B , C ) , we obtain
P * A Q = S a , P * B V = S b , U * C Q = S c ,
where
S a S b S c = r 1 r 2 r 3 r 4 r 6 r 3 r 4 r 5 r 1 r 2 r 3 r 4 r 5 r 2 r 4 r 6 ( I 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 I 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 S a b c 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 I 0 0 0 0 0 0 I 0 0 0 0 0 0 I 0 ) ,
and S a b c = d i a g { σ r 1 + r 2 + r 3 + 1 , , σ r 1 + r 2 + r 3 + r 4 } is square nonsingular diagonal with positive diagonal elements, σ r 1 + r 2 + r 3 + 1 , , σ r 1 + r 2 + r 3 + r 4 are defined to be the non-trivial restricted singular values of the matrix triplet ( A , B , C ) , the expressions for r 1 , r 2 , r 3 , r 4 , r 5 , r 6 are given by (13)–(17). The matrices U H ( L 1 L 2 L N ) × ( L 1 L 2 L N ) and V H ( K 1 K 2 K N ) × ( K 1 K 2 K N ) are unitary, and P H ( I 1 I 2 I N ) × ( I 1 I 2 I N ) and Q H ( J 1 J 2 J N ) × ( J 1 J 2 J N ) are invertible.
From the property of f in (5) and Lemma 2, we have
f 1 ( S a ) = f 1 ( P * A Q ) = f 1 ( P * ) N f 1 ( A ) N f 1 ( Q ) P * N A N Q = S A ,
f 1 ( S b ) = f 1 ( P * B V ) = f 1 ( P * ) N f 1 ( B ) N f 1 ( V ) P * N B N V = S B ,
f 1 ( S c ) = f 1 ( U * C Q ) = f 1 ( U * ) N f 1 ( C ) N f 1 ( Q ) U * N C N Q = S C ,
where P * = f 1 ( P * ) , Q = f 1 ( Q ) are invertible tensors, U * = f 1 ( U * ) , V = f 1 ( V ) are unitary tensors, S A = f 1 ( S a ) is a real tensor whose nonzero entries are 1, and the non-trivial restricted singular values of the matrix triplet f ( A ) , f ( B ) , f ( C ) , S B = f 1 ( S b ) , and S C = f 1 ( S c ) are real tensors whose nonzero entries are 1.
Now we consider the subscripts of nonzero entries in the tensors S A . Note that the subscripts of 1 and the non-trivial restricted singular values σ a 2 in S a are ( a 1 a 1 ) and ( a 2 a 2 ) , respectively, where
a 1 { 1 , , r 1 + r 2 + r 3 } , a 2 { r 1 + r 2 + r 3 + 1 , , r 1 + r 2 + r 3 + r 4 } .
Suppose the subscripts of 1 and σ a 2 in the tensor S A are ( p 1 a 1 p N a 1 q 1 a 1 q N a 1 ) and
( p 1 a 2 p N a 2 q 1 a 2 q N a 2 ) , respectively. Then, we have
( S A ) i 1 i N j 1 j N = 1 , i f ( i 1 i N j 1 j N ) = ( p 1 a 1 p N a 1 q 1 a 1 q N a 1 ) , σ a 2 , i f ( i 1 i N j 1 j N ) = ( p 1 a 2 p N a 2 q 1 a 2 q N a 2 ) , 0 , otherwise .
Similarly, we can give the structures of tensors of S B and S C .    □
The direct expressions for the subscripts of nonzero entries in the tensors S A , S B , S C will be given in the following theorem.
Theorem 2.
Consider the above higher-order RSVD for three tensors A H I 1 × × I N × J 1 × × J N , B H I 1 × × I N × K 1 × × K N and C H L 1 × × L N × J 1 × × J N . The expressions for the subscripts ( p 1 a 1 p N a 1 q 1 a 1 q N a 1 ) , ( p 1 a 2 p N a 2 q 1 a 2 q N a 2 ) , ( h 1 b h N b w 1 b w N b ) , ( u 1 c 1 u N c 1 v 1 c 1 v N c 1 ) and  ( u 1 c 2 u N c 2 v 1 c 2 v N c 2 ) are given by:
p t a 1 = a 1 1 s = 1 N 1 I s + 1 , i f t = N , a 1 1 k = t + 1 N ( p k a 1 1 ) s = 1 k 1 I s s = 1 t 1 I s + 1 , i f t = 2 , , N 1 , a 1 k = 2 N ( p k a 1 1 ) s = 1 k 1 I s , i f t = 1 ,
q t a 1 = a 1 1 s = 1 N 1 J s + 1 , i f t = N , a 1 1 k = t + 1 N ( q k a 1 1 ) s = 1 k 1 J s s = 1 t 1 J s + 1 , i f t = 2 , , N 1 , a 1 k = 2 N ( q k a 1 1 ) s = 1 k 1 J s , i f t = 1 ,
p t a 2 = a 2 1 s = 1 N 1 I s + 1 , i f t = N , a 2 1 k = t + 1 N ( p k a 2 1 ) s = 1 k 1 I s s = 1 t 1 I s + 1 , i f t = 2 , , N 1 , a 2 k = 2 N ( p k a 2 1 ) s = 1 k 1 I s , i f t = 1 ,
q t a 2 = a 2 1 s = 1 N 1 J s + 1 , i f t = N , a 2 1 k = t + 1 N ( q k a 2 1 ) s = 1 k 1 J s s = 1 t 1 J s + 1 , i f t = 2 , , N 1 , a 2 k = 2 N ( q k a 2 1 ) s = 1 k 1 J s , i f t = 1 ,
h t b = r ( f ( A ) , f ( B ) ) r ( f ( B ) ) + b 1 s = 1 N 1 I s + 1 , i f t = N , r ( f ( A ) , f ( B ) ) r ( f ( B ) ) + b 1 k = t + 1 N ( h k b 1 ) s = 1 k 1 I s s = 1 t 1 I s + 1 , i f t = 2 , , N 1 , r ( f ( A ) , f ( B ) ) r ( f ( B ) ) + b k = 2 N ( h k b 1 ) s = 1 k 1 I s , i f t = 1 ,
w t b = m = 1 N K m r ( f ( B ) ) + b 1 s = 1 N 1 K s + 1 , i f t = N , m = 1 N K m r ( f ( B ) ) + b 1 k = t + 1 N ( w k b 1 ) s = 1 k 1 K s s = 1 t 1 K s + 1 , i f t = 2 , , N 1 , m = 1 N K m r ( f ( B ) ) + b k = 2 N ( w k b 1 ) s = 1 k 1 K s , i f t = 1 ,
u t c 1 = m = 1 N L m r ( f ( C ) ) + c 1 1 s = 1 N 1 L s + 1 , i f t = N , m = 1 N L m r ( f ( C ) ) + c 1 1 k = t + 1 N ( u t c 1 1 ) s = 1 k 1 L s s = 1 t 1 L s + 1 , i f t = 2 , , N 1 , m = 1 N L m r ( f ( C ) ) + c 1 k = 2 N ( u t c 1 1 ) s = 1 k 1 L s , i f t = 1 ,
v t c 1 = r f ( A ) f ( B ) f ( C ) 0 r ( f ( B ) ) r ( f ( C ) ) + c 1 1 s = 1 N 1 J s + 1 , i f t = N , r f ( A ) f ( B ) f ( C ) 0 r ( f ( B ) ) r ( f ( C ) ) + c 1 1 k = t + 1 N ( v k c 1 1 ) s = 1 k 1 J s s = 1 t 1 J s + 1 , i f t = 2 , , N 1 , r f ( A ) f ( B ) f ( C ) 0 r ( f ( B ) ) r ( f ( C ) ) + c 1 k = 2 N ( v k c 1 1 ) s = 1 k 1 J s , i f t = 1 ,
u t c 2 = m = 1 N L m r ( f ( C ) ) + c 2 1 s = 1 N 1 L s + 1 , i f t = N , m = 1 N L m r ( f ( C ) ) + c 2 1 k = t + 1 N ( u t c 2 1 ) s = 1 k 1 L s s = 1 t 1 L s + 1 , i f t = 2 , , N 1 , m = 1 N L m r ( f ( C ) ) + c 2 k = 2 N ( u t c 2 1 ) s = 1 k 1 L s , i f t = 1 ,
v t c 2 = r f ( A ) f ( C ) r ( f ( C ) ) + c 2 1 s = 1 N 1 J s + 1 , i f t = N , r f ( A ) f ( C ) r ( f ( C ) ) + c 2 1 k = t + 1 N ( v k c 2 1 ) s = 1 k 1 J s s = 1 t 1 J s + 1 , i f t = 2 , , N 1 , r f ( A ) f ( C ) r ( f ( C ) ) + c 2 k = 2 N ( v k c 2 1 ) s = 1 k 1 J s , i f t = 1 ,
and a is the greatest integer less than or equal to the real number a.
Now we give the following Algorithm 1 for computing the RSVD of three quaternion tensors.    
Algorithm 1: Computing the RSVD of quaternion tensors A , B , and C .
Input:  A H I 1 × × I N × J 1 × × J N , B H I 1 × × I N × K 1 × × K N , C H L 1 × × L N × J 1 × × J N .
Output:  U H J 1 × × J N × J 1 × × J N , V H K 1 × × K N × K 1 × × K N , P H I 1 × × I N × I 1 × × I N ,
S A R I 1 × × I N × J 1 × × J N , S B R I 1 × × I N × K 1 × × K N and S C R L 1 × × L N × J 1 × × J N .
1. A = f ( A ) , B = f ( B ) , C = f ( C ) .
2. Give the RSVD of A , B , and C by the method in [30],
P * A U = S A ,
P * B U = S B ,
U * C Q = S C ,
3. S A = f 1 ( S A ) ,   S B = f 1 ( S B ) S C = f 1 ( S C ) ,
U = f 1 ( U ) V = b c i r c 1 ( V ) P = f 1 ( P ) ,   Q = f 1 ( Q ) .
One numerical example is as following.
Example 1.
Consider the higher-order SVD for 2 × 2 × 3 × 2 -quaternion tensor A defined by
a 1111 = 0 , a 1121 = 0 , a 1131 = 2 2 j , a 1112 = 2 2 j , a 1122 = 0 , a 1132 = 0 ,
a 2111 = i , a 2121 = i , a 2131 = 0 , a 2112 = 0 , a 2122 = 0 , a 2132 = 0 ,
a 1211 = j , a 1221 = j , a 1231 = j , a 1212 = j , a 1222 = 0 , a 1232 = 0 ,
a 2211 = 2 2 ( 1 + i + j k ) , a 2221 = 2 2 ( 1 i j + k ) , a 2231 = 2 2 ( 1 + i + j k ) ,
a 2212 = 2 2 ( 1 i j + k ) , a 2222 = 1 i + j k , a 2232 = 1 i + j k .
Then we have
A = U 2 S A 2 V * ,
where U H 2 × 2 × 2 × 2 and V H 3 × 2 × 3 × 2 are unitary tensors and
( S A ) i 1 i 2 j 1 j 2 = 1 , i f ( i 1 i 2 j 1 j 2 ) = ( 1111 ) , 2 , i f ( i 1 i 2 j 1 j 2 ) = ( 2121 ) , 2 , i f ( i 1 i 2 j 1 j 2 ) = ( 1231 ) , 4 , i f ( i 1 i 2 j 1 j 2 ) = ( 2212 ) , 0 , o t h e r w i s e ,
U 1111 = i , U 1121 = 0 , U 1112 = 0 , U 1122 = 0 ,
U 2111 = 0 , U 2121 = j , U 2112 = 0 , U 2122 = 0 ,
U 1211 = 0 , U 1221 = 0 , U 1212 = k , U 1222 = 0 ,
U 2211 = 0 , U 2221 = 0 , U 2212 = 0 , U 2222 = 2 2 + 2 2 j ,
V 1111 * = 0 , V 1121 * = 0 , V 1131 * = 2 2 k , V 1112 * = 2 2 k , V 1122 * = 0 , V 1132 * = 0 ,
V 2111 * = 2 2 k , , V 2121 * = 2 2 k , , V 2131 * = 0 , V 2112 * = 0 , V 2122 * = 0 , V 2132 * = 0 ,
V 3111 * = 1 2 i , V 3121 * = 1 2 i , V 3131 * = 1 2 i , V 3112 * = 1 2 i , V 3122 * = 0 , V 3132 * = 0 ,
V 1211 * = 1 4 ( i + j ) , V 1221 * = 1 4 ( i + j ) , V 1231 * = 1 4 ( i + j ) , V 1212 * = 1 4 ( i + j ) ,
V 1222 * = 2 4 ( j k ) , V 1232 * = 2 4 ( j k ) , V 2211 * = 1 4 ( 1 k ) , V 2221 * = 1 4 ( 1 + k ) ,
V 2231 * = 1 4 ( 1 k ) , V 2212 * = 1 4 ( 1 + k ) , V 2222 * = 2 4 ( j + k ) , V 2232 * = 2 4 ( j + k ) ,
V 3211 * = 0 , V 3221 * = 0 , V 3231 * = 0 , V 3212 * = 0 , V 3222 * = 2 4 + 6 4 i , V 3232 * = 2 4 + 6 4 i .

4. Some Applications

In this section, we give a watermarking scheme for blind color video based on the forth-order RSVD over the quaternion algebra. A fourth-order pure quaternion tensor A H I 1 × I 2 × J 1 × 2 can represent a color video with the even frames, where I 1 and I 2 denote the height and width of each frame, respectively, and 2 J 1 is the frame number of the video.
Moreover, the fourth-order pure quaternion tensor will save more information than the traditional method because of the advantages of quaternions in color image processing. Now we embed three color video watermarks simultaneously into one color video based on RSVD over the quaternion tensor, and extract these three watermarks using two keys. Now we simultaneously insert three color video watermarks into one color video by RSVD on quaternion tensors, and extract the three watermarks with two keys.
H H M 1 × M 2 × N 1 × 2 denotes a color host video. A H I 1 × I 2 × J 1 × 2 , B H I 1 × I 2 × J 1 × 2 and C H I 1 × I 2 × J 1 × 2 denotes three color video watermarks ( J 1 = I 1 I 2 / 2 ). Now we give the following procedures to plug three watermarks in the host video. Let G = G 1 + G 2 i + G 3 j + G 4 k H m × n , and G i R m × n , i = 1 , 2 , 3 , 4 . Then G is a pure quaternion matrix when G 1 is zero matrix.
The inserting process is as following:
Step 1. 
Decomposition three quaternion tensors A , B and C by RSVD,
P * N A N Q = S A ,
P * N B N V = S B ,
U * N C N Q = S C ,
where P and U are two keys, which are stored for the process of watermark extraction.
Step 2. 
Transformation under map f:
H = f ( H ) , P = f ( H ) , Q = f ( Q ) , U = f ( U ) , V = f ( V ) ,
A = f ( A ) , B = f ( B ) , C = f ( C ) ,
S A = f ( S A ) , S B = f ( S B ) , S C = f ( S C ) ,
and
P A Q = S A , P B V = S B , U C Q = S C ,
where H H M 1 M 2 × 2 N 1 is a pure quaternion matrix.
Step 3. 
Obtaining the principal component of each video:
A w S A Q 1 , B w S B V * , C w S C Q 1 .
Step 4. 
Dividing H t , t = 2 , 3 , 4 into non-coinciding blocks and the size of the blocks is m × n , where m M 1 M 2 I 1 I 2 , n N 1 J 1 . T i j ( t ) R m × n is the orthogonal transformed part for block position ( i , j ) , i , j = 1 , , m of H t , which is saved for the extraction.
Step 5. 
Getting the principal components A w , B w and C w in step 3 in the transformed blocks in step 4:
T 11 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α A 1 w ,
T 12 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α A 2 w ,
T 21 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α A 3 w ,
T 22 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α A 4 w ,
T 11 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α B 1 w ,
T 12 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α B 2 w ,
T 21 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α B 3 w ,
T 22 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α B 4 w ,
T 11 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α C 1 w ,
T 12 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α C 2 w ,
T 21 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α C 3 w ,
T 22 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) + α C 4 w ,
where α is a scale factor, which can control watermarking strength. In particular, the larger α is, the stronger the robustness of watermark is, when the value of α is confirmed.
Step 6. 
The watermarked matrices H 2 w , H 3 w and H 4 w are obtained by the inverse orthogonal transformation, and H w = H 1 + H 2 w i + H 3 w j + H 4 w k .
Step 7. 
The inverse map gives the watermarked video
H w = f 1 ( H w ) .
Next, the procedure of the extraction process is shown in the following.
Step 1. 
Map the watermarked video into a quaternion matrix
H w = f ( H w ) .
Step 2. 
Split matrices H t w , t = 2 , 3 , 4 into blocks T ^ i , j t , which has size m × n , i , j = 1 , , m of H t . In order to extract the video watermarks, save T i j t , t = 2 , 3 , 4 , i , j = 1 , 2 .
Step 3. 
The extracted principal components for each video are obtained by the following:
A ^ 1 w 1 α ( T ^ 11 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
A ^ 2 w 1 α ( T ^ 12 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
A ^ 3 w 1 α ( T ^ 21 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
A ^ 4 w 1 α ( T ^ 22 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 2 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
B ^ 1 w 1 α ( T ^ 11 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
B ^ 2 w 1 α ( T ^ 12 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
B ^ 3 w 1 α ( T ^ 21 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
B ^ 4 w 1 α ( T ^ 22 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 3 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
C ^ 1 w 1 α ( T ^ 11 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 11 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
C ^ 2 w 1 α ( T ^ 12 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 12 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
C ^ 3 w 1 α ( T ^ 21 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 21 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
C ^ 4 w 1 α ( T ^ 22 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) T 22 ( 4 ) ( 1 : , I 1 I 2 , 1 : 2 J 1 ) ) ,
A ^ w = A ^ 1 w + A ^ 2 w i + A ^ 3 w j + A ^ 4 w k ,
B ^ w = B ^ 1 w + B ^ 2 w i + B ^ 3 w j + B ^ 4 w k ,
C ^ w = C ^ 1 w + C ^ 2 w i + C ^ 3 w j + C ^ 4 w k .
Step 4. 
The extracted color videos A ^ , B ^ , and C ^ are obtained by:
A ^ = P 1 A ^ w , B ^ = P 1 B ^ w , C ^ = U * C ^ w ,
A ^ = f 1 ( A ^ ) , B ^ = f 1 ( B ^ ) , C ^ = f 1 ( C ^ )
Note that we use the quaternion singular value decomposition method in [32] to get the inverse of a nonsingular quaternion matrix.
In the following experiment, our host video is the color video cars with 1024 frames and 64 × 64 pixels, and watermarks are three color video with the same frame number 256 and the same size 16 × 16 . Taking α = 0.5 , we plug our watermarks into the host video, and extract them from the watermarked host video by the above frameworks based on the discrete wavelet transform (DWT) [33], and results are shown in Figure 1.
In Figure 1, we show some frames of original host video in the first, third and fifth lines, and the frames of the watermarked video in the second, fourth, and sixth lines. It can be seen visually that the original images and the watermarked images at the same number of frames are very similar. Therefore, we can conclude that the video watermarks are invisible in the watermarked video.
Next, three extracted watermark videos are separately shown in Figure 2, Figure 3 and Figure 4.
From Figure 2, Figure 3 and Figure 4, it can be seen that the quality of the extracted watermarks is very good, especially watermark 2, which is of particularly high quality.
The blind color video watermark processing framework based on RSVD over the quaternion tensor processes three color video waters simultaneously. In addition, only two keys are needed for the extraction process. Furthermore, it can be seen that the the reliable security of proposed blind color video watermarking scheme has been shown through numerical experiments.

5. Conclusions

In this paper, we have derived the restricted singular value decomposition for three quaternion tensors ( A , B , C ) based on the isomorphic group structures and the Einstein product. As an application of RSVD, we present a blind color video watermarking scheme under the forth-order RSVD over the quaternion algebra. We plug three color video watermarks simultaneously into one host by the blind color video watermarking scheme, and extract the three watermarks by using two keys. Finally, numerical experiments show that the proposed blind color video watermarking scheme has reliable security. In the future, implementation algorithms based on quaternion tensors need to receive more attention. Due to the computational difficulty of quaternion and the high dimensionality of tensors, the design of a fast and effective quaternion tensor algorithm is a very meaningful research topic. This paper and future research content will provide new ideas and bring great improvements to video signal processing and high-dimensional signal processing.

Author Contributions

Methodology, W.-J.C.; software, W.-J.C.; writing-original draft preparation, W.-J.C.; writing-review and editing, W.-J.C. and S.-W.Y.; supervision, S.-W.Y.; project administration, S.-W.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kolda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
  2. He, Z.H.; Qin, W.L.; Wang, X.X. Some applications of a decomposition for five quaternion matrices in control system and color image processing. Comput. Appl. Math. 2021, 40, 205. [Google Scholar] [CrossRef]
  3. He, Z.H.; Michael, K.N.; Zeng, C. Generalized Singular Value Decompositions for Tensors and Their Applications. Numer. Math. Theory Methods Appl. 2021, 14, 692–713. [Google Scholar] [CrossRef]
  4. Brazell, M.; Li, N.; Navasca, C.; Tamon, C. Solving multilinear systems via tensor inversion. SIAM J. Matrix Anal. Appl. 2013, 34, 542–570. [Google Scholar] [CrossRef]
  5. Yang, Q.Z.; Yang, Y.N. Further results for Perron Frobenius theorem for nonnegative tensors II. SIAM J. Matrix Anal. Appl. 2011, 32, 1236–1250. [Google Scholar] [CrossRef]
  6. He, Z.H.; Chen, C.; Wang, X.X. A simultaneous decomposition for three quaternion tensors with applications in color video signal processing. Anal. Appl. 2021, 19, 529–549. [Google Scholar] [CrossRef]
  7. Yang, Y.N.; Yang, Q.Z. A Study on Eigenvalues of Higher-Order Tensors and Related Polynomial Optimization Problems; Science Press: Beijing, China, 2015. [Google Scholar]
  8. He, Z.H.; Wang, X.X.; Zhao, Y.F. Eigenvalues of quaternion tensors with applications to color video processing. J. Sci. Comput. 2023, 94, 1. [Google Scholar] [CrossRef]
  9. He, Z.H.; Navasca, C.; Wang, X.X. Decomposition for a quaternion tensor triplet with applications. Adv. Appl. Clifford Algebr. 2022, 32, 9. [Google Scholar] [CrossRef]
  10. He, Z.H. Pure PSVD approach to Sylvester-type quaternion matrix equations. Electron. J. Linear Algebra 2019, 35, 266–284. [Google Scholar] [CrossRef] [Green Version]
  11. He, Z.H. Some new results on a system of Sylvester-type quaternion matrix equations. Linear Multilinear Algebra 2021, 69, 3069–3091. [Google Scholar] [CrossRef]
  12. He, Z.H.; Wang, Q.W.; Zhang, Y. A simultaneous decomposition for seven matrices with applications. J. Comput. Appl. Math. 2019, 349, 93–113. [Google Scholar] [CrossRef]
  13. Antoulas, A.C.; Beattie, C.A.; Gugercin, S. Interpolatory Methods for Model Reduction; SIAM: Philadelphia, PA, USA, 2020. [Google Scholar]
  14. Sun, L.Z.; Zheng, B.D.; Bu, C.J.; Wei, Y.M. Moore-Penrose inverse of tensors via Einstein product. Linear Multilinear Algebra 2016, 64, 686–698. [Google Scholar] [CrossRef]
  15. Hamilton, W.R. Elements of Quaternions; Longmans Green and Co.: London, UK, 1866. [Google Scholar]
  16. Took, C.C.; Mandic, D.P. Augmented second-order statistics of quaternion random signals. Signal Process. 2011, 91, 214–224. [Google Scholar] [CrossRef] [Green Version]
  17. Bihan, N.L.; Mars, J. Singular value decomposition of quaternion matrices: A new tool for vector-sensor signal processing. Signal Process. 2004, 84, 1177–1199. [Google Scholar] [CrossRef]
  18. Zhang, Y.; Wang, R.H. The exact solution of a system of quaternion matrix equations involving η-Hermicity. Appl. Math. Comput. 2013, 222, 201–209. [Google Scholar] [CrossRef]
  19. Jukl, M.; Juklová, L. On decomposition problems on manifolds with a special differential operator. Miskolc Math. 2013, 14, 591–599. [Google Scholar]
  20. Mike?, J. Differential Geometry of Special Mappings; Palacky University: Olomouc, Czech Republic, 2015. [Google Scholar]
  21. Rodman, L. Topics in Quaternion Linear Algebra; Princeton University Press: Princeton, NJ, USA, 2014. [Google Scholar]
  22. Cichocki, A. Era of big data processing: A new approach via tensor networks and tensor decompositions. arXiv 2014, arXiv:1403.2048. [Google Scholar]
  23. Einstein, A. The foundation of the general theory of relativity. In The Collected Papers of Albert Einstein 6; Kox, A.J., Klein, M.J., Schulmann, R., Eds.; Princeton University Press: Princeton, NJ, USA, 2007; pp. 146–200. [Google Scholar]
  24. Lai, W.M.; Rubin, D.; Krempl, E. Introduction to Continuum Mechanics; Butterworth-Heinemann: Oxford, UK, 2009. [Google Scholar]
  25. De Lathauwer, L. Signal Processing Based on Multilinear Algebra. Ph.D Thesis, Katholike Universiteit Leuven, Leuven, Belgium, 1997. [Google Scholar]
  26. De Moor, B.; Golub, G.H. The restricted singular value decomposition: Properties and applications. SIAM J. Matrix Anal. Appl. 1991, 12, 401–425. [Google Scholar] [CrossRef]
  27. Zha, H. The restricted singular value decomposition of matrix triplets. SIAM J. Matrix Anal. Appl. 1991, 12, 172–194. [Google Scholar] [CrossRef]
  28. Chu, D.; De Lathauwer, L.; De Moor, B. A QR-type reduction for computing the SVD of a general matrix product/quotient. Numer. Math. 2003, 95, 101–121. [Google Scholar] [CrossRef]
  29. Chu, D.; De Moor, B. On the nonuniqueness of the factorization factors in the product singular value decomposition. Linear Algebra Appl. 2000, 314, 191–203. [Google Scholar] [CrossRef] [Green Version]
  30. Chu, D.; De Lathauwer, L.; De Moor, B. On the computation of the restricted singular value decomposition via the Cosine-Sine decomposition. SIAM J. Matrix Anal. Appl. 2000, 22, 580–601. [Google Scholar] [CrossRef]
  31. He, Z.H.; Agudelo, O.M.; Wang, Q.W.; De Moor, B. Two-sided coupled generalized Sylvester matrix equations solving using a simultaneous decomposition for fifteen matrices. Linear Algebra Appl. 2016, 496, 549–593. [Google Scholar] [CrossRef]
  32. Li, Y.; Wei, M.; Zhang, F.; Zhao, J. A Fast Structure-Preserving Method for Computing the Singular Value Decomposition of Quaternion Matrix. Appl. Math. Comput. 2014, 235, 157–167. [Google Scholar]
  33. Lai, C.C.; Tsai, C.C. Digital image watermarking using discrete wavelet transform and singular value decomposition. IEEE Trans. Instrum. Meas. 2010, 59, 3060–3063. [Google Scholar] [CrossRef]
Figure 1. Pictures of original host and watermarked host. Pictures in the first, third, and fifth lines are the frames of the original host video, and pictures in the second, fourth, and sixth lines are the frames of the watermarked video.
Figure 1. Pictures of original host and watermarked host. Pictures in the first, third, and fifth lines are the frames of the original host video, and pictures in the second, fourth, and sixth lines are the frames of the watermarked video.
Axioms 12 00232 g001
Figure 2. Pictures of watermark 1 and extracted watermark 1. Pictures in the first, third, and fifth lines are the frames in the original watermark video 1, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 1.
Figure 2. Pictures of watermark 1 and extracted watermark 1. Pictures in the first, third, and fifth lines are the frames in the original watermark video 1, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 1.
Axioms 12 00232 g002
Figure 3. Pictures of watermark 2 and extracted watermark 2. Pictures in the first, third, and fifth lines are the frames in the original watermark video 2, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 2.
Figure 3. Pictures of watermark 2 and extracted watermark 2. Pictures in the first, third, and fifth lines are the frames in the original watermark video 2, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 2.
Axioms 12 00232 g003
Figure 4. Pictures of watermark 3 and extracted watermark 3. Pictures in the first, third, and fifth lines are the frames in the original watermark video 3, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 3.
Figure 4. Pictures of watermark 3 and extracted watermark 3. Pictures in the first, third, and fifth lines are the frames in the original watermark video 3, and pictures in the second, fourth, and sixth lines are the frames in the extracted watermark video 3.
Axioms 12 00232 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Chen, W.-J.; Yu, S.-W. RSVD for Three Quaternion Tensors with Applications in Color Video Watermark Processing. Axioms 2023, 12, 232. https://doi.org/10.3390/axioms12030232

AMA Style

Chen W-J, Yu S-W. RSVD for Three Quaternion Tensors with Applications in Color Video Watermark Processing. Axioms. 2023; 12(3):232. https://doi.org/10.3390/axioms12030232

Chicago/Turabian Style

Chen, Wen-Juan, and Shao-Wen Yu. 2023. "RSVD for Three Quaternion Tensors with Applications in Color Video Watermark Processing" Axioms 12, no. 3: 232. https://doi.org/10.3390/axioms12030232

APA Style

Chen, W. -J., & Yu, S. -W. (2023). RSVD for Three Quaternion Tensors with Applications in Color Video Watermark Processing. Axioms, 12(3), 232. https://doi.org/10.3390/axioms12030232

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop