Next Article in Journal
The Application of the Modified Lindstedt–Poincaré Method to Solve the Nonlinear Vibration Problem of Exponentially Graded Laminated Plates on Elastic Foundations
Previous Article in Journal
Research and Implementation of Denoising Algorithm for Brain MRIs via Morphological Component Analysis and Adaptive Threshold Estimation
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Reduced Biquaternion Windowed Linear Canonical Transform: Properties and Applications

1
School of Mathematics and Computer Science, Yanan University, Yanan 716000, China
2
National Engineering Academy of the Republic of Kazakhstan, Almaty 050000, Kazakhstan
3
Department of Mathematics, School of Chemical Engineering and Physical Sciences, Lovely Professional University, Jalandhar 144411, Punjab, India
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(5), 743; https://doi.org/10.3390/math12050743
Submission received: 17 January 2024 / Revised: 23 February 2024 / Accepted: 23 February 2024 / Published: 1 March 2024

Abstract

:
The quaternion windowed linear canonical transform is a tool for processing multidimensional data and enhancing the quality and efficiency of signal and image processing; however, it has disadvantages due to the noncommutativity of quaternion multiplication. In contrast, reduced biquaternions, as a special case of four-dimensional algebra, possess unique advantages in computation because they satisfy the multiplicative exchange rule. This paper proposes the reduced biquaternion windowed linear canonical transform (RBWLCT) by combining the reduced biquaternion signal and the windowed linear canonical transform that has computational efficiency thanks to the commutative property. Firstly, we introduce the concept of a RBWLCT, which can extract the time local features of an image and has the advantages of both time-frequency analysis and feature extraction; moreover, we also provide some fundamental properties. Secondly, we propose convolution and correlation operations for RBWLCT along with their corresponding generalized convolution, correlation, and product theorems. Thirdly, we present a fast algorithm for RBWLCT and analyze its computational complexity based on two dimensional Fourier transform (2D FTs). Finally, simulations and examples are provided to demonstrate that the proposed transform effectively captures the local RBWLCT-frequency components with enhanced degrees of freedom and exhibits significant concentrations.

1. Introduction

The linear canonical transform (LCT) finds extensive applications across various fields, including applied mathematics, optics, and signal processing [1,2,3,4]. Previous findings underscore the significant role played by LCT in the analysis of chirp signals for parameter estimation and sampling [5,6]. However, due to its global kernel, the LCT is unable to represent the frequency content at the local level. To address this limitation, in references [7,8], researchers have constructed windowed linear canonical transform (WLCT) [9,10,11,12]. The WLCT is a signal processing tool, which conveys both time and LCT frequency information, while originally presenting a local LCT distribution.
The quaternion number system was first described by Hamilton as a generalization of complex numbers [13,14]. In recent years, researchers have extended integral transforms into the quaternion algebra domain, leading to the development of theoretical frameworks such as quaternion Fourier transform (QFT) [15,16,17,18], quaternion fractional Fourier transform (QFRFT) [19], quaternion windowed fractional Fourier transform (QWFRFT) [20,21,22,23,24], quaternion linear canonical transform (QLCT) [25,26], and quaternion offset linear canonical transform [27]. Several important properties of QLCT have been investigated, including linearity, time shift, modulation, reconstruction formula, boundedness, and uncertainty principles in [28,29,30]. Recently, Hu et al. [31] proposed a novel quaternionic convolution operator for QLCT, which shows that the QLCT of the convolution of two quaternion functions can be implemented by the product of their respective QLCTs. The application of QLCT in solving partial differential equations has also been explored based on these established properties. Additionally, Gao and Li extended the WLCT to the quaternion field and defined it as a quaternion windowed linear canonical transform (QWLCT). They further investigated various relevant properties, including several uncertainty principles in this context [32,33].
However, due to the noncommutative nature of quaternion multiplication, certain calculations become intricate, such as the convolution of QFT [34]. To overcome this limitation in the context of digital signal processing, in 1990 Schutte and Wenzel proposed a new number system, reduced biquaternions (RBs), which resemble quaternions but possesses commutative multiplication [35]. RBs have applications in digital signal and image processing [36,37,38], neural networks [39], and electromagnetics [40].
Recently, in [41], the authors combined the RB signal with the LCT, defining the reduced biquaternion linear canonical transform (RBLCT), along with its properties. However, to the best of our knowledge, there has been no literature presenting the reduced biquaternion windowed linear canonical transform (RBWLCT), which overcomes the limitations of the LCT, such as the inability to represent the frequency content at the local level, and also obviates the noncommutativity of quaternion algebra. Therefore, this paper aims to define RBWLCT, establish convolution, correlation, and product theorems for the RBWLCT, and demonstrate the fast algorithm of RBWLCT. Furthermore, it aims to illustrate simulations using RBWLCT for transforming color images.
The structure of the paper is as follows: Section 2 provides an overview of general definitions and basic properties. Section 3 proposes a definition for RBWLCT and derives some fundamental properties; additionally, it presents the convolution and correlation theorems for the RBWLCT. Section 4 develops the fast algorithm for RBWLCT and carries out simulations. Section 5 draws conclusions based on the findings.

2. Preliminaries

In this section, we mainly review some basic facts about the quaternion algebra and RB signal. Additionally, we will provide a brief overview of the QLCT, which will be needed throughout the paper.

2.1. Quaternion Algebra and Reduced Biquaternion Signal

While a complex number consists of two components—the real part and the imaginary part, a quaternion has four parts, with one being the real part and the remaining three being imaginary parts. It was first invented by Hamilton in 1843 [13], is denoted as H , and each of its elements has form given by the following:
H = { q | q = q 0 + i q 1 + j q 2 + k q 3 , q 0 , q 1 , q 2 , q 3 R } ,
and i , j , k are imaginary units obeys Hamilton’s multiplication rules [13,14]
i j = j i = k , j k = k j = i , k i = i k = j , i 2 = j 2 = k 2 = i j k = 1 .
Correspondingly, a quaternionic function f ( x ) with the R 2 domain can be expressed as follows:
f ( x ) = f r ( x ) + f i ( x ) i + f j ( x ) j + f k ( x ) k ,
where f r , f i , f j , f k are all real functions; however, the multiplication rule of quaternions is not commutative. In [35], RB was proposed, and commutative multiplication was defined for it. The description of RB algebra is as follows:
H ˜ = { q | q = q r + q i i + q j j + q k k } ,
where q r , q i , q j , q k R , the imaginary units satisfy the following multiplicative rules:
i j = j i = k , j k = k j = i , k i = i k = j , j 2 = k 2 = 1 , i 2 = 1 ,
RB can also be represented as q = q 1 + q 2 j , where q 1 = q r + q i i , q 2 = q j + q k i . The norm of a RB q = q r + q i i + q j j + q k k is as follows [36]:
q = [ ( q r 2 + q i 2 + q j 2 + q k 2 ) 2 4 ( q r q j + q i q k ) 2 ] 1 4 .
The RB conjugate q ¯ is given by the following:
q ¯ = q 2 q 1 = q 2 / q .
Correspondingly, a quaternionic function f ( x ) with the R 2 domain can be expressed as follows [20]:
f ( x ) = f r ( x ) + f i ( x ) i + f j ( x ) j + f k ( x ) k .
For any two RB signals f ( x ) and g ( x ) , according to the multiplication rule of RB, we have the following:
f ( x ) g ( x ) = g ( x ) f ( x ) .
If f ( x ) and g ( x ) are quaternion signals, Equation (8) will not holds, i.e., f ( x ) g ( x ) g ( x ) f ( x ) .
In this paper, for signals f , g L 1 ( R 2 , H ˜ ) , the convolution operator ∗ and the correlation operator ⊙ is defined as follows [16]:
f ( x ) g ( x ) = R 2 f ( τ ) g ( x 1 τ 1 , x 2 τ 2 ) d τ ,
and
f ( x ) g ( x ) = R 2 f ( τ ) ¯ g ( τ 1 + x 1 , τ 2 + x 2 ) d τ .
respectively.

2.2. Reduced Biquaternion Linear Canonical Transform

In this subsection, we shortly review the RBLCT, which is defined in [41].
Definition 1.
Let f ( x ) L 2 ( R 2 , H ˜ ) be a RB signal, then the RBLCT of f ( x ) with parameters A 1 and A 2 is defined as
L A 1 , A 2 i , k { f ( x ) } ( u ) = R 2 f ( x ) K A 1 i ( x 1 , u 1 ) K A 2 k ( x 2 , u 2 ) d x , b 1 b 2 0 , d 1 d 2 f ( d 1 u 1 , d 2 u 2 ) e i ( c 1 d 1 u 1 2 2 ) e k ( c 2 d 2 u 2 2 2 ) , b 1 b 2 = 0 ,
with i , k H ˜ ; such that i 2 = k 2 = 1 , including the cases i = ± k and kernels given as:
K A 1 i ( x 1 , u 1 ) = 1 i 2 π b 1 e i ( a 1 2 b 1 x 1 2 x 1 b 1 u 1 + d 1 2 b 1 u 1 2 ) , K A 2 k ( x 2 , u 2 ) = 1 k 2 π b 2 e k ( a 2 2 b 2 x 2 2 x 2 b 2 u 2 + d 2 2 b 2 u 2 2 ) ,
where A l = a l b l c l d l , with a l , b l , c l , d l R ; such that a l d l b l c l = 1 , for l = 1 , 2 .
Definition 2.
Let f ( x ) L 2 ( R 2 , H ˜ ) be a RB signal, the inverse transform of the RBLCT is given as follows:
f ( x ) = R 2 L A 1 , A 2 i , k ( u ) K A 1 1 i ( x 1 , u 1 ) K A 2 1 k ( x 2 , u 2 ) d x , b 1 b 2 0 , a 1 a 2 f ( a 1 x 1 , a 2 x 2 ) e i ( a 1 c 1 x 1 2 2 ) e k ( a 2 c 2 x 2 2 2 ) , b 1 b 2 = 0 ,
where A l 1 = d l b l c l a l , for l = 1 , 2 .

3. Reduced Biquaternion Windowed Linear Canonical Transform

In this section, the RBWLCT is introduced. Subsequently, the convolution and correlation operations for RBWLCT are defined, and the corresponding convolution and correlation theorems are derived. Furthermore, an in–depth investigation into several fundamental properties of RBWLCT is conducted.

3.1. Definition and Properties of RBWLCT

In this subsection, RBWLCT is proposed. And the relationship between RBWLCT and reduced biquaternion windowed Fourier transform (RBWFT) is given.
Definition 3.
Let A l = a l b l c l d l be a matrix parameter such that a l , b l , c l , d l R and a l d l b l c l = 1 , for l = 1 , 2 . The RBWLCT of any RB function f ( x ) L 2 ( R 2 , H ˜ ) and window function ϕ L 2 ( R 2 , H ˜ ) is defined as follows:
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = R 2 f ( x ) ϕ ( x t ) ¯ K A 1 i ( x 1 , u 1 ) K A 2 k ( x 2 , u 2 ) d x , b 1 b 2 0 , d 1 d 2 f ( d 1 u 1 , d 2 u 2 ) e i ( c 1 d 1 u 1 2 2 ) e k ( c 2 d 2 u 2 2 2 ) , b 1 b 2 = 0 ,
where K A 1 i ( x 1 , u 1 ) , K A 2 k ( x 2 , u 2 ) are the same as Equation (12).
In this paper, we deal with the case when b 1 0 and b 2 0 , if b 1 = b 2 = 0 , then G ϕ A 1 , A 2 { f ( x ) } ( u , t ) represents a scaling operation combined with two chirp multiplications, which are not relevant to our research objectives.
Remark 1.
(1) If A 1 = cos α sin α sin α cos α , A 2 = cos β sin β sin β cos β , the RBWLCT boils down to the new transform called reduced biquaternion windowed fractional Fourier transform (RBWFRFT)
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = R 2 f ( x ) ϕ ( x t ) ¯ K A 1 i ( x 1 , u 1 ) K A 2 k ( x 2 , u 2 ) d x ,
where
K A 1 i ( x 1 , u 1 ) = 1 i cot α 2 π e i ( ( x 1 2 + u 1 2 ) · cot α 2 x 1 u 1 csc α ) , K A 2 k ( x 2 , u 2 ) = 1 k cot β 2 π e k ( ( x 2 2 + u 2 2 ) · cot β 2 x 2 u 2 csc β ) .
(2) If A 1 = A 2 = 0 1 1 0 , the RBWLCT can be reduced to the novel transform called RBWFT as follows:
F ϕ i , k { f ( x ) } ( u , t ) = R 2 f ( x ) ϕ ( x t ) ¯ e i x 1 u 1 e k x 2 u 2 d x .
(3) Let h ( x ) = f ( x ) ϕ ( x t ) ¯ , then the RBWFT can be reduced to the novel transform called reduced biquaternion Fourier transform (RBFT) as follows:
F   { h ( x ) } ( u ) = R 2 h ( x ) e i x 1 u 1 e k x 2 u 2 d x .
In the subsequent analysis, we will investigate two fundamental characteristics of RBWLCT, namely, its inverse and switching properties, while other properties of RBWLCT are succinctly summarized in Table 1.
Theorem 1.
(Inversion formula) The inverse RBWLCT is given by the following:
f ( x ) = 1 ϕ 2 R 2 R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) K A 1 i ( x 1 , u 1 ) ¯ K A 2 k ( x 2 , u 2 ) ¯ ϕ ( x t ) d u d t ,
with parameters A l 1 = d l b l c l a l , where a l , b l , c l , d l R , for l = 1 , 2 .
Proof. 
Applying the inversion RBLCT of f ( x ) , we have the following:
f ( x ) ϕ ( x t ) ¯ = L i , j A 1 , A 2 { G ϕ A 1 , A 2 ( f ) ( u , t ) } = R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) K A 1 i ( x 1 , u 1 ) ¯ K A 2 k ( x 2 , u 2 ) ¯ d u .
Multiplying by ϕ ( x t ) on both sides of Equation (20), and integrating with respect to d t , we have the following:
R 2 f ( x ) ϕ ( x t ) 2 d t = R 2 R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) K A 1 i ( x 1 , u 1 ) ¯ K A 2 k ( x 2 , u 2 ) ¯ ϕ ( x t ) d u d t .
Due to R 2 ϕ ( x t ) 2 d t = ϕ 2 , we have
f ( x ) = 1 ϕ 2 R 2 R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) K A 1 i ( x 1 , u 1 ) ¯ K A 2 k ( x 2 , u 2 ) ¯ ϕ ( x t ) d u d t ,
which completes the proof.    □
Theorem 2.
(Switching f with ϕ) Let f , ϕ L 2 ( R 2 , H ˜ ) , and ϕ be window function, then we obtain
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = e i a 1 2 b 1 t 1 2 · e i 1 b 1 t 1 u 1 · e k a 2 2 b 2 t 2 2 · e k 1 b 2 t 2 u 2 G f A 1 1 , A 2 1 ϕ ( u ta , u ) ¯ .
Proof. 
It follows from Equation (14) that
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = R 2 f ( x ) ϕ ( x t ) ¯ 1 i 2 π b 1 e i ( a 1 2 b 1 x 1 2 x 1 b 1 u 1 + d 1 2 b 1 u 1 2 ) · 1 k 2 π b 1 e k ( a 2 2 b 2 x 2 2 x 2 b 2 u 2 + d 2 2 b 2 u 2 2 ) d x = R 2 ϕ ( x t ) f ( x ) ¯ 1 i 2 π b 1 e i ( a 1 2 b 1 x 1 2 x 1 b 1 u 1 + d 1 2 b 1 u 1 2 ) 1 k 2 π b 1 e k ( a 2 2 b 2 x 2 2 x 2 b 2 u 2 + d 2 2 b 2 u 2 2 ) ¯ d x .
Let y = x t , we have the following:
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = R 2 ϕ ( y ) f ( y + u ) ¯ 1 i 2 π b 1 e i ( a 1 2 b 1 y 1 2 y 1 b 1 ( u 1 t 1 a 1 ) + d 1 2 b 1 u 1 2 ) e i a 1 2 b 1 t 1 2 · e i 1 b 1 t 1 u 1 ¯ ·   1 k 2 π b 1 e k ( a 2 2 b 2 y 2 2 y 2 b 2 ( u 2 t 2 a 2 ) + d 2 2 b 2 u 2 2 ) e k a 2 2 b 2 t 2 2 · e k 1 b 2 t 2 u 2 ¯ d y = e i a 1 2 b 1 t 1 2 · e i 1 b 1 t 1 u 1 · e k a 2 2 b 2 t 2 2 · e k 1 b 2 t 2 u 2 G f A 1 1 , A 2 1 ϕ ( u ta , u ) ¯ ,
which completes the proof.    □
From Equations (14) and (17), the RBWLCT can be expressed by RBWFT, as follows:
Theorem 3.
Let f L 2 ( R 2 , H ˜ ) , the RBWLCT of a signal can be expressed by the F i , k RBWFT as follows:
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = e i d 1 2 b 1 u 1 2 e k d 2 2 b 2 u 2 2 F ϕ i , k { g ( x ) } ( u b , t ) ,
where
g ( x ) = f ( x ) 1 i 2 π b 1 1 k 2 π b 2 e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 .
From Equation (25), we can calculate RBWLCT using classical RBWFT (see Figure 1).

3.2. Convolution of RBWLCT

In this subsection, we present a novel quaternion convolution operation for the RBWLCT, and derive the corresponding convolution theorem of RBWLCT.
Definition 4.
Let f , g  ∈  L 2   ( R 2 , H ˜ ) , a new convolution operator Θ A for the RBWLCT is defined as follows:
f ( x ) Θ A g ( x ) = R 2 e i a 1 b 1 x 1 ( x 1 τ 1 ) e k a 2 b 2 x 2 ( x 2 τ 2 ) f ( τ ) g ( x 1 τ 1 , x 2 τ 2 ) e i a 1 b 1 ( x 1 τ 1 ) 2 e k a 2 b 2 ( x 2 τ 2 ) 2 d τ .
When A 1 = A 2 = 0 1 1 0 , then the convolution operator Θ A reduces to the classical convolution operator ∗ defined in Equation (9).
Based on the classical convolution operator ∗, the convolution operator for RBWLCT in Equation (27) can be rewritten as follows:
h ( x ) = f ( x ) Θ A g ( x ) = e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 [ f ( x ) e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 ] [ g ( x ) e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 ] .
It means that the convolution operation Θ A in Equation (27) can be expressed as classical convolution operation ∗. From Figure 2. we can calculate convolution operation Θ A in Equation (27) by using classical convolution operation ∗.
Next, we will derive the convolution and product theorem for the RBWLCT, explore its intricacies and implications in the RB domain.
Theorem 4.
Let f ( x ) and g ( x ) are two RB signals. G ϕ A 1 , A 2 { f ( x ) } and G ψ A 1 , A 2 { g ( x ) } are the RBWLCT of f ( x ) and g ( x ) , respectively. Then we have the following:
G ϕ Θ A ψ A 1 , A 2 { f ( x ) Θ A g ( x ) } ( u , t ) = i 2 π b 1 k 2 π b 2 e i d 1 2 b 1 u   1 2 e k d 2 2 b 2 u 2 2 R 2 D 1 D 2 G ϕ A 1 , A 2 { f ( τ ) } ( u , s ) G ψ A 1 , A 2 { g ( y ) } ( u , t s ) d s ,
where
D 1 = e i a 1 b 1 [ [ y 1 ( t 1 s 1 ) ] 2 ( y 1 + τ 1 t 1 ) ( y 1 ( t 1 s 1 ) ) ] , D 2 = e k a 2 b 2 [ [ y 2 ( t 2 s 2 ) ] 2 ( y 2 + τ 2 t 2 ) ( y 2 ( t 2 s 2 ) ) ] .
Proof. 
Using Equation (14), we obtain the following:
G ϕ Θ A ψ A 1 , A 2 { f ( x ) Θ A g ( x ) } ( u , t ) = R 2 ( f ( x ) Θ A g ( x ) ) ( ϕ ¯ Θ A ψ ( x t ) ¯ ) K A 1 i ( x 1 ,   u 1 ) K A 2 k ( x 2 ,   u 2 ) d x = R 2 R 2 1 i 2 π b 1 1 k 2 π b 2 e i a 1 b 1 x 1 ( x 1 τ 1 ) e k a 2 b 2 x 2 ( x 2 τ 2 ) f ( τ 1 , τ 2 ) d τ · g ( x 1 τ 1 , x 2 τ 2 ) e i a 1 b 1 ( x 1 τ 1 ) 2 e k a 2 b 2 ( x 2 τ 2 ) 2 d τ · R 2   e i a 1 b 1 ( x 1 t 1 ) ( x 1 t 1 r 1 ) e k a 2 b 2 ( x 2 t 2 ) ( x 2 t 2 r 2 ) ϕ ( r ) ¯ · ψ ( x t r ) ¯ e i a 1 b 1 ( x 1 t 1 r 1 ) 2 e k a 2 b 2 ( x 2 t 2 r 2 ) 2 d r · e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 u 1 + d 1 2 b 1 u 1 2 ) e k ( a 2 2 b 2 x 2 2 1 b 2 x 2 u 2 + d 2 2 b 2 u 2 2 ) d x .
Let y = x τ , r = τ s , we obtain the following:
G ϕ Θ A ψ A 1 , A 2 { f ( x ) Θ A g ( x ) } ( u , t ) = R 2 1 i 2 π b 1 1 k 2 π b 2 e i a 1 b 1 ( y 1 + τ 1 ) y 1 e k a 2 b 2 ( y 2 + τ 2 ) y 2 f ( τ ) · g ( y 1 , y 2 ) e i a 1 b 1 y 1 2 e k a 2 b 2 y 2 2 d τ · R 2 e i a 1 b 1 ( y 1 + τ 1 t 1 ) ( y 1 ( t 1 s 1 ) ) · e k a 2 b 2 ( y 2 + τ 2 t 2 ) ( y 2 ( t 2 s 2 ) ) ϕ ( τ s ) ¯ · ψ ( y ( t s ) ) ¯ e i a 1 b 1 ( y 1 ( t 1 s 1 ) ) 2 e k a 2 b 2 ( y 2 ( t 2 s 2 ) ) 2 d s · R 2 e i ( a 1 2 b 1 ( y 1 + τ 1 ) 2 1 b 1 ( y 1 + τ 1 ) u 1 + d 1 2 b 1 u 1 2 ) e i ( a 2 2 b 2 ( y 2 + τ 2 ) 2 1 b 2 ( y 2 + τ 2 ) u 2 + d 2 2 b 2 u 2 2 ) d y = i 2 π b 1 k 2 π b 2 e i d 1 2 b 1 u   1 2 e k d 2 2 b 2 u 2 2 · R 2 D 1 · D 2 G ϕ A 1 , A 2 { f ( τ ) } ( u , s ) G ψ A 1 , A 2 { g ( y ) } ( u , t s ) d s ,
which completes the proof.    □
Theorem 5.
Let f ( x ) and g ( x ) are two RB signals. G ϕ A 1 , A 2 { f ( x ) } and G ψ A 1 , A 2 { g ( x ) } are the RBWLCT of f ( x ) and g ( x ) , respectively. Then, the product theorem of f ( x ) and g ( x ) for the RBWLCT is as follows:
G ϕ A 1 , A 2 { i 2 π b 1 k 2 π b 2 e i a 1 2 b 1 x   1 2 e k a 2 2 b 2 x 2 2 f ( x ) g ( x ) ϕ ( x u ) ¯ 2 } ( u , t ) = G ϕ A 1 , A 2 { f } ( u , t ) Θ A ¯ G ϕ A 1 , A 2 { g } ( u , t ) ,
where
f ( x ) Θ A ¯ g ( x ) = R 2 e i d 1 b 1 x 1 ( x 1 τ 1 ) e k d 2 b 2 x 2 ( x 2 τ 2 ) f ( τ ) g ( x 1 τ 1 , x 2 τ 2 ) e i d 1 b 1 ( x 1 τ 1 ) 2 e k d 2 b 2 ( x 2 τ 2 ) 2 d τ .
Proof. 
From the RBWLCT Definition (14) and inversion Formula (19), we obtain the following:
G ϕ A 1 1 , A 2 1 { G ϕ A 1 , A 2 { f } ( u , t ) Θ A ¯ G ϕ A 1 , A 2 { g } ( u , t ) } ( u , t ) = R 2 G ϕ A 1 , A 2 { f } ( u , t ) Θ A ¯ G ϕ A 1 , A 2 { g } ( u , t ) K A 1 1 i ( u 1 ,   x 1 ) K A 1 1 k ( u 2 ,   x 2 ) d u = R 2 R 2 1 i 2 π b 1 1 k 2 π b 2 e i d 1 b 1 u 1 ( u 1 τ 1 ) e k d 2 b 2 u 2 ( u 2 τ 2 ) G ϕ A 1 , A 2 { f } ( τ , t ) · G ϕ A 1 , A 2 { g } ( u τ , t ) e i d 1 b 1 ( u 1 τ 1 ) 2 e k d 2 b 2 ( u 2 τ 2 ) 2 d τ · e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 u 1 + d 1 2 b 1 u 1 2 ) e k ( a 2 2 b 2 x 2 2 1 b 2 x 2 u 2 + d 2 2 b 2 u 2 2 ) d u .
Let u τ = s , we obtain the following:
G ϕ A 1 1 , A 2 1 { G ϕ A 1 , A 2 { f } ( u , t ) Θ A ¯ G ϕ A 1 , A 2 { g } ( u , t ) } ( u , t ) = R 2 R 2 1 i 2 π b 1 1 k 2 π b 2 e i d 1 b 1 ( s 1 + τ 1 ) s 1 e k d 2 b 2 ( s 2 + τ 2 ) s 2 · G ϕ A 1 , A 2 { f } ( τ , t ) G ϕ A 1 , A 2 { g } ( s , t ) e i d 1 b 1 s 1 2 e k d 2 b 2 s 2 2 d s · e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 ( s 1 + τ 1 ) + d 1 2 b 1 ( s 1 + τ 1 ) 2 ) e k ( a 2 2 b 2 x 2 2 1 b 2 ( s 2 + τ 2 ) x 2 + d 2 2 b 2 ( s 2 + τ 2 ) 2 ) d τ = i 2 π b 1 k 2 π b 2 e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 R 2 G ϕ A 1 , A 2 { f } ( τ , t ) 1 i 2 π b 1 · 1 k 2 π b 2 · e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 τ 1 + d 1 2 b 1 τ 1 2 ) e k ( a 2 2 b 2 x 2 2 1 b 2 τ 2 x 2 + d 2 2 b 2 τ 2 2 ) d τ · R 2 G ϕ A 1 , A 2 { g } ( s , t ) 1 i 2 π b 1 1 k 2 π b 2 e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 s 1 + d 1 2 b 1 s 1 2 ) · e k ( a 2 2 b 2 x 2 2 1 b 2 s 2 x 2 + d 2 2 b 2 s 2 2 ) d s = i 2 π b 1 k 2 π b 2 e i a 1 2 b 1 x   1 2 e k a 2 2 b 2 x 2 2 f ( x ) g ( x ) ϕ ( x u ) ¯ 2
which completes the proof    □
The proof of Theorem 5 is completed. The product theorem (Theorem 5) shows that the RBWLCT of the product of f and g multiplied with four different chirp signals is equal to the convolution of the RBWLCT of f and g.
Based on the Definition 4 and Theorem 5, we shall investigate the basic properties of convolution operation Θ A .
Property 1.
For RB signals f, g, and h, for constants a and b R , the RB convolution Θ A for RBWLCT satisfied the following linearity property:
[ ( a f + b g ) Θ A h ] ( x ) = a [ f Θ A h ] ( x ) + b [ g Θ A h ] ( x ) .
Property 2.
(Distributive) For RB signals f, g, and h, we have the following:
[ h Θ A ( f + g ) ] ( x ) = [ h Θ A f ] ( x ) + [ h Θ A g ] ( x ) .
Proof. 
The proof of the Property 1 and Property 2 follows from the Definition 4 and Theorem 5.    □
Remark 2.
(1) When A 1 = cos α sin α sin α cos α , A 2 = cos β sin β sin β cos β , we obtain the convolution theorem for the RBWFRFT.
(2) When A 1 = A 2 = 0 1 1 0 , we obtain the convolution theorem for the RBWFT.

3.3. Correlation of RBWLCT

In this subsection, a correlation operator for the RBWLCT is proposed, and the corresponding correlation theorem is investigated.
Definition 5.
Let f , g  ∈  L 2   ( R 2 , H ˜ ) , the correlation operator A for the RBWLCT is defined as follows:
f ( x ) A g ( x ) = R 2 e i a 1 b 1 x 1 ( x 1 + τ 1 ) e k a 2 b 2 x 2 ( x 2 + τ 2 ) f ( τ ) ¯ g ( x 1 + τ 1 , x 2 + τ 2 ) e i a 1 b 1 ( x 1 + τ 1 ) 2 e k a 2 b 2 ( x 2 + τ 2 ) 2 d τ .
When A 1 = A 2 = 0 1 1 0 , then the convolution operator A can be reduced to the classical correlation operator ⊙ as follows:
f ( x ) g ( x ) = R 2 f ( τ ) ¯ g ( x 1 + τ 1 , x 2 + τ 2 ) d τ .
Next, we will derive the correlation theorem for the RBWLCT.
Theorem 6.
Let f ( x ) and g ( x ) are two RB signals. G ϕ A 1 , A 2 { f ( x ) } and G ψ A 1 , A 2 { g ( x ) } are the RBWLCT of f ( x ) and g ( x ) , respectively, then we obtain the following:
G ϕ A ψ A 1 , A 2 { f ( x ) A g ( x ) } ( u , t ) = i 2 π b 1 k 2 π b 2 R 2 E 1 · E 2 G ϕ ¯ A 1 , A 2 { f ( τ ) ¯ } ( u , s ) G ψ A 1 , A 2 { g ( w ) } ( u , t + s ) d s ,
where
E 1 = e i a 1 b 1 [ [ w 1 ( t 1 + s 1 ) ] 2 ( w 1 τ 1 t 1 ) ( w 1 ( t 1 + s 1 ) ) ] , E 2 = e k a 2 b 2 [ [ w 2 ( t 2 + s 2 ) ] 2 ( w 2 τ 2 t 2 ) ( w 2 ( t 2 + s 2 ) ) ] .
Proof. 
From the Definitions 3 and the Definitions 5, we have the following:
G ϕ A ψ A 1 , A 2 { f ( x ) A g ( x ) } ( u , t ) = R 2 ( f ( x ) A g ( x ) ) ( ϕ ¯ A ψ ( x t ) ¯ ) K A 1 i ( x 1 ,   u 1 ) K A 2 k ( x 2 ,   u 2 ) d x = R 2 R 2 1 i 2 π b 1 1 k 2 π b 2 e i a 1 b 1 x 1 ( x 1 + τ 1 ) e k a 2 b 2 x 2 ( x 2 + τ 2 ) · f ( τ ) ¯ g ( x 1 + τ 1 , x 2 + τ 2 ) e i a 1 b 1 ( x 1 + τ 1 ) 2 e k a 2 b 2 ( x 2 + τ 2 ) 2 d τ · R 2 e i a 1 b 1 ( x 1 t 1 ) ( x 1 t 1 + r 1 ) e k a 2 b 2 ( x 2 t 2 ) ( x 2 t 2 + r 2 ) ϕ ( r ) ¯ ¯ · ψ ( x t + r ) ¯ e i a 1 b 1 ( x 1 t 1 + r 1 ) 2 e k a 2 b 2 ( x 2 t 2 + r 2 ) 2 d r · e i ( a 1 2 b 1 x 1 2 1 b 1 x 1 u 1 + d 1 2 b 1 u 1 2 ) e k ( a 2 2 b 2 x 2 2 1 b 2 x 2 u 2 + d 2 2 b 2 u 2 2 ) d x .
Let w = x + τ , r = τ s , we obtain the following:
G ϕ A ψ A 1 , A 2 { f ( x ) A g ( x ) } ( u , t ) = R 2 1 i 2 π b 1 1 k 2 π b 2 e i a 1 b 1 ( w 1 τ 1 ) w 1 e k a 2 b 2 ( w 2 τ 2 ) w 2 · f ( τ ) ¯ g ( w 1 , w 2 ) e i a 1 b 1 w 1 2 e k a 2 b 2 w 2 2 d τ · R 2 e i a 1 b 1 ( w 1 τ 1 t 1 ) ( w 1 ( t 1 + s 1 ) ) e k a 2 b 2 ( w 2 τ 2 t 2 ) ( w 2 ( t 2 + s 2 ) ) · ϕ ( τ s ) ψ ( w ( t + s ) ) ¯ e i a 1 b 1 ( w 1 ( t 1 + s 1 ) ) 2 e k a 2 b 2 ( w 2 ( t 2 + s 2 ) ) 2 d s · R 2 e i ( a 1 2 b 1 ( w 1 τ 1 ) 2 1 b 1 ( w 1 τ 1 ) u 1 + d 1 2 b 1 u 1 2 ) e k ( a 2 2 b 2 ( w 2 τ 2 ) 2 1 b 2 ( w 2 τ 2 ) u 2 + d 2 2 b 2 u 2 2 ) d w = i 2 π b 1 k 2 π b 2 R 2 E 1 · E 2 G ϕ ¯ A 1 , A 2 { f ( τ ) ¯ } ( u , s ) G ψ A 1 , A 2 { g ( w ) } ( u , t + s ) d s ,
which completes the proof.    □
Remark 3.
(1) If A 1 = cos α sin α sin α cos α , A 2 = cos β sin β sin β cos β , then the Theorem 6 reduces to a version for correlation theorem associated with RBWFRFT.
(2) If A 1 = A 2 = 0 1 1 0 , then the Theorem 6 reduces to a version for correlation theorem associated with RBWFT.

4. Fast Algorithm of RBWLCT and Simulations

4.1. Fast Algorithm of RBWLCT

In this section, we will discuss the fast algorithm of RBWLCT. For an RB signal f ( x ) , based on Equations (14), (17), and (18), we can rewrite the expression for the RBWLCT of f ( x ) as the reduced biquaternion Fourier transform (RBFT) of h ( x ) , which is then multiplied by B i ( u 1 ) and B k ( u 2 ) as follows:
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = R 2 f ( x ) ϕ ( x t ) ¯ K A 1 i ( x 1 , u 1 ) K A 2 k ( x 2 , u 2 ) d x = B i ( u 1 ) B k ( u 2 ) R 2 h ( x ) e i x 1 u 1 b 1 e k x 2 u 2 b 2 d x ,
where h ( x ) is defined as follows:
h ( x ) = f ( x ) ϕ ( x u ) ¯ e i a 1 2 b 1 x 1 2 e k a 2 2 b 2 x 2 2 ,
and B i ( u 1 ) , B k ( u 2 ) are, respectively, defined as follows:
B i ( u 1 ) = 1 i 2 π b 1 e i d 1 2 b 1 u 1 2 , B k ( u 2 ) = 1 k 2 π b 2 e k d 2 2 b 2 u 2 2 .
To implement the RBWLCT, we let
W ( u ) = R 2 h ( x ) e i x 1 u 1 b 1 e i x 2 u 2 b 2 d x ,
then, we obtain the following:
W ( u 1 , u 2 ) + W ( u 1 , u 2 ) 2 = R 2 h ( x ) e i ( x 1 u 1 b 1 ) cos ( x 2 u 2 b 2 ) d x ,
W ( u 1 , u 2 ) W ( u 1 , u 2 ) 2 = R 2 h ( x ) e i ( x 1 u 1 b 1 ) ( i ) sin ( x 2 u 2 b 2 ) d x .
Therefore, we have the following:
W ( u 1 , u 2 ) + W ( u 1 , u 2 ) 2 + W ( u 1 , u 2 ) W ( u 1 , u 2 ) 2 ( j ) = R 2 h ( x ) e i x 1 u 1 b 1 e k x 2 u 2 b 2 d x .
From Equations (44), (48)–(50), we can obtain the following:
G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = W ( u 1 , u 2 ) ( 1 + j ) + W ( u 1 , u 2 ) ( 1 j ) 2 B i ( u 1 ) B k ( u 2 ) .
From Equation (51), the major computational load for RBWLCT is the calculation of W ( u ) . To implement W ( u ) , since h ( x ) is a quaternion function and not a complex function, we cannot use just one complex two-dimensional (2D) Fourier transforms (FT) to implement it. Instead, we can first decompose h ( x ) as follows:
h ( x ) = h 1 ( x ) + h 2 ( x ) j ,
where h 1 ( x ) = h r ( x ) + h i ( x ) i and h 2 ( x ) = h j ( x ) + h k ( x ) i , combining Equations (47) and (52), we obtain the following:
W ( u ) = R 2 h 1 ( x ) e i x 1 u 1 b 1 e i x 2 u 2 b 2 d x + R 2 h 2 ( x ) e i x 1 u 1 b 1 e i x 2 u 2 b 2 d x j = F { h 1 ( x ) } ( u 1 b 1 , u 2 b 2 ) + F { h 2 ( x ) } ( u 1 b 1 , u 2 b 2 ) j .
From Equation (53), the W ( u ) can be implemented by two complex 2D FTs; therefore, the final implementation of RBWLCT also mainly requires two complex 2D FTs. The algorithm and the calculation process for the RBWLCT are summarized in Algorithm 1 and Figure 3, respectively.
Algorithm 1: The algorithm for the RBWLCT
Input: biquaternion signal f ( x )
            Step (1): Calculate h ( x ) using Equations (45) and (52).
            Step (2): Calculate W ( u ) from h ( u ) using Equations (47) and (53).
            Step (3): Calculate B i ( u 1 ) and B k ( u 2 ) using Equation (46).
Output: Calculate G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = W ( u 1 , u 2 ) ( 1 + j ) + W ( u 1 , u 2 ) ( 1 j ) 2 B i ( u 1 ) B k ( u 2 ) .
Next, we provide the computational complexity analysis of RBWLCT. From Equations (51) and (53), it can be observed that the main computational burden for RBWLCT lies in calculating W ( u ) . To implement W ( u ) , two complex 2D FTs are required to perform the integration operations mentioned in Equation (47). By employing a discrete algorithm, these complex 2D FTs can be implemented using 2D discrete Fourier transforms (DFTs) to process a 2D discrete signal with dimensions of M × N . The computation of its 2D DFTs necessitates M N log 2 ( M N ) real-number multiplications [42,43]. Therefore, implementing RBWLCT also requires 2 M N log 2 ( M N ) real-number multiplications. Utilizing Equations (51) and (53), we can determine that the computational complexity of RBWLCT for RB signals f ( x ) is O ( 2 M N log 2 ( M N ) ) . Since different types of signals result in different complexities, the corresponding computational complexity of RBWLCT for scalar signal f ( x ) is reduced to O ( 1 2 M N log 2 ( M N ) ) , for complex signal it is reduced to O ( M N log 2 ( M N ) ) , and for vector signal it is reduced to O ( 3 2 M N log 2 ( M N ) ) .
On comparing the proposed RBWLCT with the QWLCT, it is pertinent to mention that despite capturing localized time and frequency information comprehensively, the QWLCT’s computational complexity is relatively high due to quaternion arithmetic, making it more intensive than conventional windowed linear canonical transform. In contrast, the proposed RBWLCT reduces computational complexity while preserving essential properties of the QWLCT. Leveraging redundancy in quaternion signal representations, the RBWLCT achieves efficiency by exploiting the symmetries and properties of quaternion exponential functions. Although sacrificing some accuracy compared to the QWLCT, the RBWLCT offers a balanced compromise between accuracy and computational efficiency, making it a valuable alternative in signal processing applications.

4.2. Simulations

In this section, we employ the definition of the RBWLCT for color image processing by encoding the three channel components of the RGB image as imaginary parts of the pure reduced biquaternion. Thus, the pixels at image coordinates ( s , t ) can be represented as follows:
f ( s , t ) = i f r ( s , t ) + j f g ( s , t ) + k f b ( s , t ) ,
where f r ( s , t ) , f g ( s , t ) , f b ( s , t ) represent the red, green, and blue components of the pixels, respectively.
In the experiment, the parameters were set as follows: A 1 = ( 129 , 68 π , 2 π , 129 ) , and A 2 = ( 10 , 32 π , 4 π , 12.9 ) . In Figure 4a, the original color image is shown, which has dimensions of 512 × 512 pixels. The module of the RBWLCT spectrum is presented in Figure 4b. Additionally, we have plotted three imaginary parts of the RBWLCT spectrum in Figure 5.
The image frequency serves as an indicator that quantifies the intensity of gray variations within an image, representing the gradient of gray levels across the spatial plane. However, due to the utilization of a global transform in RBLCT, which averages out frequency properties over time, it fails to capture local time-frequency characteristics. By incorporating a window function ϕ ( t ) into the RBWLCT, it acquires localized attributes and becomes both a temporal and spectral function. Thus, for a given time t, G ϕ A 1 , A 2 { f ( x ) } ( u , t ) can be interpreted as the spectrum at that specific moment—namely, the local spectrum. Figure 6 and Figure 7 are provided to further explain the different performances in Figure 4a. Specifically, Figure 6 offers a characterization of rectangular window functions in the time domain with a different window step size. Figure 7 shows the spectrum of the different parts of the color image in RBWLCT domains to show the influence of windowed function.

4.3. Applications

For the demonstration of the RBWLCT in (14), we shall present an illustrative example with simulation.
Consider the following 2D biquaternion Gaussian function:
f ( x ) = α e β x 1 2 + γ x 2 2 , β , γ C , α L 2 ( R 2 , H ˜ ) .
Then, the RBWLCT in (14) of f ( x ) with respect to the uni-modular matrices A l = a l b l c l d l , l = 1 , 2 , and the following rectangular window function:
ϕ ( x ) = 1 , if | x 1 | < a , | x 2 | < a , a > 0 , 0 , elsewhere ,
can be computed as follows:
G ϕ A 1 , A 2 { f } ( u , t ) = 1 2 π b 1 b 2 R 2 α e ( β x 1 2 + γ x 2 2 ) ϕ ( x t ) ¯ · e i 2 b 1 a 1 x 1 2 2 x 1 u 1 + d 1 u 1 2 π b 1 2 e k 2 b 2 a 2 x 2 2 2 x 2 u 2 + d 2 u 2 2 π b 2 2 d x = α 2 π b 1 b 2 t 1 a t 1 + a t 2 a t 2 + a e ( β x 1 2 + γ x 2 2 ) · e i 2 b 1 a 1 x 1 2 2 x 1 u 1 + d 1 u 1 2 π b 1 2 e k 2 b 2 a 2 x 2 2 2 x 2 u 2 + d 2 u 2 2 π b 2 2 d x
= α 2 π b 1 b 2 e i 2 b 1 d 1 u 1 2 π b 1 2 t 1 a t 1 + a e i 2 b 1 x 1 2 ( a 1 2 i b 1 β ) 2 x 1 u 1 d x 1 · t 2 a t 2 + a e k 2 b 2 x 2 2 ( a 2 2 k b 2 γ ) 2 x 2 u 2 d x 2 e k 2 b 2 d 2 u 2 2 π b 2 2 .
For simplicity, we choose β = i a 1 / ( 2 b 1 ) and γ = k a 2 / ( 2 b 2 ) , to obtain the following:
G ϕ A 1 , A 2 { f } ( u , t ) = α 2 π b 1 b 2 e i 2 b 1 d 1 u 1 2 π b 1 2 t 1 a t 1 + a e i x 1 u 1 b 1 d x 1 t 2 a t 2 + a e k x 2 u 2 b 2 d x 2 · e k 2 b 2 d 2 u 2 2 π b 2 2 = α 2 π b 1 b 2 e i 2 b 1 d 1 u 1 2 π b 1 2 ( b 1 ) i u 1 e i u 1 ( t 1 + a ) b 1 e i u 1 ( t 1 a ) b 1 · ( b 2 ) k u 2 e k u 2 ( t 2 + a ) b 1 e k u 2 ( t 2 a ) b 2 e k 2 b 2 d 2 u 2 2 π b 2 2 = α b 1 b 2 2 π u 1 u 2 e i d 1 u 1 2 2 b 1 1 i i e i u 1 ( t 1 + a ) b 1 e i u 1 ( t 1 a ) b 1 · 1 k k e k u 2 ( t 2 + a ) b 1 e k u 2 ( t 2 a ) b 2 e k d 2 u 2 2 2 b 2 = α b 1 b 2 2 π u 1 u 2 e i d 1 u 1 2 2 b 1 e 3 π i 4 e i u 1 ( t 1 + a ) b 1 e i u 1 ( t 1 a ) b 1 · e k u 2 ( t 2 + a ) b 1 e k u 2 ( t 2 a ) b 2 e k d 2 u 2 2 2 b 2 e 3 π k 4 .
In order to acquire the lucid representation of the transformed signal, we make following choices:
A 1 = A 2 = 1 1 1 0 , α = 1 + 2 i + 3 j + 4 k , a = 1 , t 1 = t 2 = 1 .
Therefore, we obtain the following:
G ϕ A 1 , A 2 { f } ( u , t ) = ( 1 + 2 i + 3 j + 4 k ) 2 π u 1 u 2 e 3 π i 4 e 2 i u 1 e 2 k u 2 e 3 π k 4 = ( 1 + 2 i + 3 j + 4 k ) 2 π u 1 u 2 e i ( 2 u 1 + 3 π / 4 ) e k ( 2 u 2 + 3 π / 4 ) .
Setting θ 1 = 2 u 1 + 3 π / 4 , and θ 2 = 2 u 2 + 3 π / 4 , we have the following:
G ϕ A 1 , A 2 { f } ( u , t ) = ( 1 + 2 i + 3 j + 4 k ) 2 π u 1 u 2 e i θ 1 e k θ 2 = ( 1 + 2 i + 3 j + 4 k ) 2 π u 1 u 2 cos θ 1 i sin θ 1 cos θ 2 k sin θ 2 = ( 1 + 2 i + 3 j + 4 k ) 2 π u 1 u 2 cos θ 1 cos θ 2 k cos θ 1 sin θ 2 i sin θ 1 cos θ 2 + i · k sin θ 1 sin θ 2 = 1 2 π u 1 u 2 cos θ 1 cos θ 2 k cos θ 1 sin θ 2 i sin θ 1 cos θ 2 + i · k sin θ 1 sin θ 2 + 2 2 π u 1 u 2 i cos θ 1 cos θ 2 i · k cos θ 1 sin θ 2 i · i sin θ 1 cos θ 2 + i · i · k sin θ 1 sin θ 2 + 3 2 π u 1 u 2 j cos θ 1 cos θ 2 j · k cos θ 1 sin θ 2 j · i sin θ 1 cos θ 2 + j · i · k sin θ 1 sin θ 2 + 4 2 π u 1 u 2 k cos θ 1 cos θ 2 k · k cos θ 1 sin θ 2 k · i sin θ 1 cos θ 2 + k · i · k sin θ 1 sin θ 2 = 1 2 π u 1 u 2 cos θ 1 cos θ 2 k cos θ 1 sin θ 2 i sin θ 1 cos θ 2 + j sin θ 1 sin θ 2 + 2 2 π u 1 u 2 i cos θ 1 cos θ 2 j cos θ 1 sin θ 2 sin θ 1 cos θ 2 + k sin θ 1 sin θ 2 + 3 2 π u 1 u 2 j cos θ 1 cos θ 2 + i cos θ 1 sin θ 2 k sin θ 1 cos θ 2 sin θ 1 sin θ 2 + 4 2 π u 1 u 2 k cos θ 1 cos θ 2 + cos θ 1 sin θ 2 j sin θ 1 cos θ 2 i sin θ 1 sin θ 2 = 1 2 π u 1 u 2 cos θ 1 cos θ 2 2 sin θ 1 cos θ 2 3 sin θ 1 sin θ 2 + 4 cos θ 1 sin θ 2 + i 2 π u 1 u 2 sin θ 1 cos θ 2 + 2 cos θ 1 cos θ 2 + 3 cos θ 1 sin θ 2 4 sin θ 1 sin θ 2 + j 2 π u 1 u 2 sin θ 1 sin θ 2 2 cos θ 1 sin θ 2 + 3 cos θ 1 cos θ 2 4 sin θ 1 cos θ 2 + k 2 π u 1 u 2 cos θ 1 sin θ 2 + 2 sin θ 1 sin θ 2 3 sin θ 1 cos θ 2 + 4 cos θ 1 cos θ 2 .
The graphical representation of the given biquaternion signal f ( x ) = α exp ( β x 1 2 + γ x 2 2 ) , when β = i / 2 , γ = j / 2 and α = 1 + 2 i + 3 j + 4 k is plotted in Figure 8, whereas its RBWLCT (14) of a signal f ( x ) with respect to the rectangular window g ( x ) and the real part of the transformed signal are depicted in Figure 9, for a = 1 , t 1 = t 2 = 1 , α = 1 + 2 i + 3 j + 4 k and A 1 = A 2 = 1 1 1 0 . From Figure 9, we see that the proposed transform reveals the local RBWLCT-frequency contents with a higher degree of freedom and enjoys high concentrations.
Moreover, the original image (Figure 4a) can be depicted in its red, green, and blue components as follows (Figure 10):

5. Conclusions

This paper defines RBWLCT, which can be viewed as a generalization of classical LCT and gives its main properties. A typical convolution operator of RBWLCT and an associated correlation operator for RBWLCT are proposed. Furthermore, based on the proposed operators, the corresponding generalized convolution, correlation, and product theorems are derived; then, the RBWLCT fast algorithm was studied. The computational complexity of RBWLCT was calculated by the computational complexity of 2D FT. Finally, the application of RBWLCT to the color images is given. First, to capture the local time-frequency properties, we set different window steps of the rectangular window function and obtained different spectra of the color images. Second, we give a specific 2D biquaternion Gaussian function for RBWLCT as well as its simulations.

Author Contributions

Conceptualization, H.Y. and Q.F.; methodology, H.Y. and Q.F.; software, H.Y., Q.F. and A.A.T.; validation, H.Y., Q.F. and A.A.T.; formal analysis, H.Y., X.W., Q.F. and D.U.; writing—original draft, H.Y. and Q.F.; writing—review and editing, H.Y., X.W., Q.F., D.U. and A.A.T. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. 62261055, 61861044), the project of Natural Science Foundation of Shaanxi Province (2022JM-400, 2023-JC-YB-085), Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan, (No. AP14871252). The APC was funded by the National Natural Science Foundation of China and the Natural Science Foundation of Shaanxi Province.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The authors thank the anonymous referees for their insightful remarks that helped to the improved version of this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Feng, Q.; Li, B.Z. Convolution and correlation theorems for the two-dimensional linear canonical transform and its applications. IET Signal Process. 2016, 10, 125–132. [Google Scholar] [CrossRef]
  2. Deng, B.; Tao, R.; Wang, Y. Convolution theorems for the linear canonical transform and their applications. Sci. China Ser. F Inf. Sci. 2006, 49, 592–603. [Google Scholar] [CrossRef]
  3. Huang, X.; Zhang, L.; Li, S.; Zhao, Y. Radar high speed small target detection based on keystone transform and linear canonical transform. Digit. Signal Process. 2018, 82, 203–215. [Google Scholar] [CrossRef]
  4. Kundu, M.; Prasad, A.; Verma, R.K. Multidimensional linear canonical transform and convolution. J. Ramanujan Math. Soc. 2022, 37, 159–171. [Google Scholar]
  5. Zalevsky, Z.; Mendlovic, D.; Kutay, M.A.; Ozaktas, H.M.; Solomon, J. Improved acoustic signals discrimination using fractional Fourier transform based phase-space representations. Opt. Commun. 2001, 190, 95–101. [Google Scholar] [CrossRef]
  6. Tao, R.; Li, B.Z.; Wang, Y.; George, K.A. On sampling of band-limited signals associated with the linear canonical transform. IEEE Trans. Signal Process. 2008, 56, 5454–5464. [Google Scholar]
  7. Kou, K.I.; Xu, R.H.; Zhang, Y.H. Paley-Wiener theorems and uncertainty principles for the windowed linear canonical transform. Math. Methods Appl. Sci. 2012, 35, 2122–2132. [Google Scholar] [CrossRef]
  8. Kou, K.I.; Xu, R.H. Windowed linear canonical transform and its applications. Signal Process. 2012, 92, 179–188. [Google Scholar] [CrossRef]
  9. Bahri, M.; Ashino, R. Some properties of windowed linear canonical transform and its logarithmic uncertainty principle. Int. J. Wavelets Multiresolut Inf. Process. 2016, 14, 1650015. [Google Scholar] [CrossRef]
  10. Gao, W.B.; Li, B.Z. Uncertainty principles for the short-time linear canonical transform of complex signals. Digit Signal Process. 2021, 111, 102953. [Google Scholar] [CrossRef]
  11. Huang, L.; Zhang, K.; Chai, Y.; Xu, S.Q. Computation of the short-time linear canonical transform with dual window. Math. Probl. Eng. 2017, 2017, 4127875. [Google Scholar] [CrossRef]
  12. Zhang, Z.C. Sampling theorem for the short-time linear canonical transform and its applications. Signal Process. 2015, 113, 138–146. [Google Scholar] [CrossRef]
  13. Hamilton, W.R. Elements of Quaternions; Longmans Green: London, UK, 1866. [Google Scholar]
  14. Kantor, I.L.; Solodovnikov, A.S. Hypercomplex Number: An Elementary Introduction to Algebras; Springer: New York, NY, USA, 1989. [Google Scholar]
  15. Bahri, M.; Hitzer, E. An uncertainty principle for quaternion Fourier transform. Comput. Math. Appl. 2008, 56, 2398–2410. [Google Scholar] [CrossRef]
  16. Bujack, R.N.; Bie, H.D. Convolution products for hypercomplex Fourier transforms. J. Math. Imaging Vis. 2014, 48, 606–624. [Google Scholar] [CrossRef]
  17. Brahim, K.; Tefjeni, E. Uncertainty principle for the two sided quaternion windowed Fourier transform. J. Pseudo-Differ Oper. 2020, 11, 159–185. [Google Scholar] [CrossRef]
  18. LeBihan, N.; Sangwine, S.J.; Ell, T.A. Instantaneous frequency and amplitude of orthocomplex modulated signals based on quaternion Fourier transform. Signal Process. 2014, 94, 308–318. [Google Scholar] [CrossRef]
  19. Chen, B.J.; Yu, M.; Tian, Y.H.; Li, L.D.; Wang, D.C.; Sun, X.M. Multiple-parameter fractional quaternion Fourier transform and its application in colour image encryption. IET Image Process. 2018, 12, 2238–2249. [Google Scholar] [CrossRef]
  20. Xu, G.L.; Wang, X.T.; Xu, X.G. Fractional quaternion Fourier transform, convolution and correlation. Signal Process. 2008, 88, 2511–2517. [Google Scholar]
  21. Li, Z.F.; Shi, H.P.; Qiao, Y.Y. Two-sided fractional quaternion Fourier transform and its application. J. Inequal. Appl. 2021, 2021, 121. [Google Scholar] [CrossRef]
  22. Bahri, M.; Ashino, R.; Makis, V. Two-dimensional quaternion linear canonical transform: Properties, convolution, correlation and uncertainty principle. J. Math. 2019, 2019, 1062979. [Google Scholar] [CrossRef]
  23. Achak, A.; Ahmad, O.; Belkhadir, A.; Daher, R. Jackson Theorems for the Quaternion Linear Canonical transform. Adv. Appl. Clifford Algebr. 2022, 32, 41. [Google Scholar] [CrossRef]
  24. Mei, Y.Y.; Feng, Q.; Gao, X.X.; Zhao, Y.B. Convolution theorem associated with the QWFRFT. Chinese J. Electron. 2023, 32, 485–492. [Google Scholar] [CrossRef]
  25. Hu, X.X.; Cheng, D.; Kou, K.I. Sampling formulas for 2D quaternionic signals associated with various quaternion Fourier and linear canonical transforms. Front. Inf. Technol. Electron. Eng. 2022, 23, 463–478. [Google Scholar] [CrossRef]
  26. Bahri, M.; Ashino, R. A Simplified proof of uncertainty principle for quaternion linear canonical transform. Abstr. Appl. Anal. 2016, 2016, 5874930. [Google Scholar] [CrossRef]
  27. Urynbassarova, D.; Teali, A.A. Convolution, Correlation, and uncertainty principles for the quaternion offset linear canonical transform. Mathematics 2023, 11, 2201. [Google Scholar] [CrossRef]
  28. Yang, Y.; Kou, K.I. Uncertainty principles for hypercomplex signals in the linear canonical transform domains. Signal Process. 2014, 95, 67–75. [Google Scholar] [CrossRef]
  29. Kou, K.I.; Ou, J.Y.; Morais, J. On uncertainty principle for quaternionic linear canonical transform. Abstr. Appl. Anal. 2013, 2013, 725952. [Google Scholar] [CrossRef]
  30. Zhang, Y.N.; Li, B.Z. Novel uncertainty principles for two-sided quaternion linear canonical transform. Adv. Appl. Clifford Algebr. 2018, 28, 15. [Google Scholar] [CrossRef]
  31. Hu, X.; Cheng, D.; Kou, K.I. Convolution theorems associated with quaternion linear canonical transform and applications. Signal Process. 2020, 39, 4436–4458. [Google Scholar] [CrossRef]
  32. Gao, W.B.; Li, B.Z. Quaternion windowed linear canonical transform of two-dimensional signals. Adv. Appl. Clifford Algebr. 2020, 30, 16. [Google Scholar] [CrossRef]
  33. Gao, W.B.; Li, B.Z. Uncertainty principle for the two-sided quaternion windowed linear canonical transform. Circuits Syst. Signal Process. 2022, 41, 1324–1348. [Google Scholar] [CrossRef]
  34. Bulow, T. Hypercomplex Spectral Signal Representations for the Processing and Analysis of Images. Ph.D. Dissertation, Christian Albrechts University, Kiel, Germany, 1999. [Google Scholar]
  35. Schutte, H.D.; Wenzel, J. Hypercomplex numbers in digital signal processing. IEEE Int. Symp. Circuits Syst. 1990, 1–4, 1557–1560. [Google Scholar]
  36. Pei, S.C.; Chang, J.H.; Ding, J.J. Commutative reduced biquaternions and their Fourier transform for signal and image processing applications. IEEE Trans. Signal Process. 2004, 52, 2012–2031. [Google Scholar] [CrossRef]
  37. Sun, J.; Li, Y.; Zhang, M.; Liu, Z.; Wei, A. A new method based on semi-tensor product of matrices for solving reduced biquaternion matrix equation ∑p=1lApXBp = C and its application in color image restoration. Math. Model. Control. 2023, 3, 218–232. [Google Scholar] [CrossRef]
  38. Gai, S. Theory of reduced biquaternion sparse representation and its applications. Expert Syst. Appl. 2023, 213, 119245. [Google Scholar] [CrossRef]
  39. Isokawa, T.; Nishimura, H.; Matsui, N. Commutative quaternion and multistate Hopfield neural networks. In Proceedings of the The 2010 International Joint Conference on Neural Networks (IJCNN), Barcelona, Spain, 18–23 July 2010; pp. 1–6. [Google Scholar]
  40. Zhang, D.; Jiang, T.; Wang, G.; Vasil’ev, V.I. An efficient method for the total least squares problem in reduced biquaternionic electromagnetics. Eur. Phys. J. Plus. 2023, 138, 826. [Google Scholar] [CrossRef]
  41. Guo, L.Q.; Zhu, M.; Ge, X.H. Reduced biquaternion canonical transform, convolution and correlation. Signal Process. 2011, 91, 2147–2153. [Google Scholar] [CrossRef]
  42. Pei, S.C.; Ding, J.J.; Chang, J.H. Efficient implementation of quaternion Fourier transform, convolution, and correlation by 2-D complex FFT. IEEE Trans. Signal Process. 2001, 49, 2783–2797. [Google Scholar]
  43. Majorkowska-Mech, D.; Cariow, A. One-dimensional quaternion discrete Fourier transform and an approach to its fast computation. Electronics 2023, 12, 4974. [Google Scholar] [CrossRef]
Figure 1. The calculation process of RBWLCT.
Figure 1. The calculation process of RBWLCT.
Mathematics 12 00743 g001
Figure 2. Implementation of convolution operation for RBWLCT.
Figure 2. Implementation of convolution operation for RBWLCT.
Mathematics 12 00743 g002
Figure 3. The calculation process of RBWLCT.
Figure 3. The calculation process of RBWLCT.
Mathematics 12 00743 g003
Figure 4. Color image for RBWLCT. (a) color image; (b) the module of the RBWLCT spectrum.
Figure 4. Color image for RBWLCT. (a) color image; (b) the module of the RBWLCT spectrum.
Mathematics 12 00743 g004
Figure 5. RBWLCT spectrum of the three imaginary parts of the color image. (a) ith imaginary part; (b) jth imaginary part; (c) kth imaginary part.
Figure 5. RBWLCT spectrum of the three imaginary parts of the color image. (a) ith imaginary part; (b) jth imaginary part; (c) kth imaginary part.
Mathematics 12 00743 g005
Figure 6. Partial color images. (a) window length = [ 1 , 1 , 64 , 64 ] ; (b) window length = [ 1 , 31 , 64 , 64 ] ; (c) window length = [ 61 , 1 , 64 , 64 ] ; (d) window length = [ 61 , 31 , 64 , 64 ] ; (e) window length = [ 31 , 61 , 64 , 64 ] ; (f) window length = [ 1 , 61 , 64 , 64 ] .
Figure 6. Partial color images. (a) window length = [ 1 , 1 , 64 , 64 ] ; (b) window length = [ 1 , 31 , 64 , 64 ] ; (c) window length = [ 61 , 1 , 64 , 64 ] ; (d) window length = [ 61 , 31 , 64 , 64 ] ; (e) window length = [ 31 , 61 , 64 , 64 ] ; (f) window length = [ 1 , 61 , 64 , 64 ] .
Mathematics 12 00743 g006
Figure 7. Part of the RBWLCT spectrum of color images. (a) window length = [ 1 , 1 , 64 , 64 ] ; (b) window length = [ 1 , 31 , 64 , 64 ] ; (c) window length = [ 61 , 1 , 64 , 64 ] ; (d) window length = [ 61 , 31 , 64 , 64 ] ; (e) window length = [ 31 , 61 , 64 , 64 ] ; (f) window length = [ 1 , 61 , 64 , 64 ] .
Figure 7. Part of the RBWLCT spectrum of color images. (a) window length = [ 1 , 1 , 64 , 64 ] ; (b) window length = [ 1 , 31 , 64 , 64 ] ; (c) window length = [ 61 , 1 , 64 , 64 ] ; (d) window length = [ 61 , 31 , 64 , 64 ] ; (e) window length = [ 31 , 61 , 64 , 64 ] ; (f) window length = [ 1 , 61 , 64 , 64 ] .
Mathematics 12 00743 g007
Figure 8. The real and imaginary parts of the signal (a) the real part of f ( x ) ; (b) the ith imaginary part of f ( x ) ; (c) the jth imaginary part of f ( x ) ; (d) the kth imaginary part of f ( x ) .
Figure 8. The real and imaginary parts of the signal (a) the real part of f ( x ) ; (b) the ith imaginary part of f ( x ) ; (c) the jth imaginary part of f ( x ) ; (d) the kth imaginary part of f ( x ) .
Mathematics 12 00743 g008
Figure 9. RBWLCT of f ( x ) with respect to rectangular window g ( x ) .
Figure 9. RBWLCT of f ( x ) with respect to rectangular window g ( x ) .
Mathematics 12 00743 g009
Figure 10. Red, green, and blue components of the original image.
Figure 10. Red, green, and blue components of the original image.
Mathematics 12 00743 g010
Table 1. Some properties of the RBWLCT.
Table 1. Some properties of the RBWLCT.
PropertyRBWLCT
Parity G P ϕ A 1 , A 2 { P f } ( u , t ) = G ϕ A 1 , A 2 f ( u , t ) , P f = f ( x ) , P ϕ = ϕ ( x ) .
Conjugation G ϕ A 1 , A 2 { f ( x ) ¯ } ( u , t ) = G ϕ A 1 1 , A 2 1 { f ( x ) } ( u , t ) ¯ .
Boundedness | G ϕ A 1 , A 2 ( f ) ( w , u ) | 1 2 π b 1 b 2 f L 2 ( R 2 ) ϕ L 2 ( R 2 ) .
Linearity G ϕ A 1 , A 2 { α ( x ) + β ( x ) } ( u , t ) = α G ϕ A 1 , A 2 { f } ( u , t ) + β G ϕ A 1 , A 2 { g } ( u , t ) , α , β a r e c o n s t a n t s .
Shift G ϕ A 1 , A 2 { f ( x z ) } ( u , t ) = G ϕ A 1 , A 2 { f } ( r , v ) e i h 1 u 1 c 1 e k h 2 u 2 c 2 e i a 1 h 1 2 2 e k a 2 h 2 2 2 .
Modulation G ϕ A 1 , A 2 { M s f } ( u , t ) = G ϕ A 1 , A 2 { f } ( w , t ) e i u 1 s 1 d 1 e k u 2 s 2 d 2 e i b 1 d 1 s 1 2 2 e k b 2 d 2 s 2 2 2 , M s f = e i x 1 s 1 f ( x ) e k x 2 s 2 .
Inversion formula f ( x ) = 1 ϕ 2 R 2 R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) K A 1 i ( x 1 , u 1 ) ¯ K A 2 k ( x 2 , u 2 ) ¯ ϕ ( x t ) d u d t .
Parseval formula f ( x ) g ( x ) ¯ = 1 i 2 π b 1 2 1 k 2 π b 2 2 ψ 2 ϕ 2 R 2 R 2 G ϕ A 1 , A 2 ( f ) ( u , t ) G ψ A 1 , A 2 ( g ) ( u , t ) ¯ d u d t .
Switching f with ϕ G ϕ A 1 , A 2 { f ( x ) } ( u , t ) = e i a 1 2 b 1 t 1 2 · e i 1 b 1 t 1 u 1 · e k a 2 2 b 2 t 2 2 · e k 1 b 2 t 2 u 2 · G f A 1 1 , A 2 1 ϕ ( u ta , u ) ¯ .
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

Yang, H.; Feng, Q.; Wang, X.; Urynbassarova, D.; Teali, A.A. Reduced Biquaternion Windowed Linear Canonical Transform: Properties and Applications. Mathematics 2024, 12, 743. https://doi.org/10.3390/math12050743

AMA Style

Yang H, Feng Q, Wang X, Urynbassarova D, Teali AA. Reduced Biquaternion Windowed Linear Canonical Transform: Properties and Applications. Mathematics. 2024; 12(5):743. https://doi.org/10.3390/math12050743

Chicago/Turabian Style

Yang, Hehe, Qiang Feng, Xiaoxia Wang, Didar Urynbassarova, and Aajaz A. Teali. 2024. "Reduced Biquaternion Windowed Linear Canonical Transform: Properties and Applications" Mathematics 12, no. 5: 743. https://doi.org/10.3390/math12050743

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