Fourier and Wavelet 3D−Transforms in the

octonions.

Eusebio Ariza García

September 28, 2021
Yachay Tech University
School of Mathematical and Computational Sciences
DMV-ÖMG meeting Passau 2021
Structure of the talk

The octonions

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

Plancherel and Parseval’s Theorems

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

Plancherel and Parseval’s Theorems

Admissible Octonion Wavelets

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

Plancherel and Parseval’s Theorems

Admissible Octonion Wavelets

Three−dimensional Continuous Octonion Wavelet Transform

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

Plancherel and Parseval’s Theorems

Admissible Octonion Wavelets

Three−dimensional Continuous Octonion Wavelet Transform

Basic properties of the 3D−COWT

1
Structure of the talk

The octonions

The three−dimensional octonion Fourier transform

Some Algebraic Properties

Convolution

Plancherel and Parseval’s Theorems

Admissible Octonion Wavelets

Three−dimensional Continuous Octonion Wavelet Transform

Basic properties of the 3D−COWT

Inversion Formula and Inner product relation

1
The octonions
The Octonions

Definition
The octonions O are an 8−dimensional algebra with basis:
{e0 = 1, e1 , e2 , e3 , e4 , e5 , e6 , e7 } .

2
The Octonions

Definition
The octonions O are an 8−dimensional algebra with basis:
{e0 = 1, e1 , e2 , e3 , e4 , e5 , e6 , e7 } . An arbitrary element o ∈ O can be
represented as

o = o0 + o1 e1 + o2 e2 + o3 e3 + o4 e4 + o5 e5 + o6 e6 + o7 e7 ,

where o0 , . . . , o7 ∈ R.

2
The Octonions

Definition
The octonions O are an 8−dimensional algebra with basis:
{e0 = 1, e1 , e2 , e3 , e4 , e5 , e6 , e7 } . An arbitrary element o ∈ O can be
represented as

o = o0 + o1 e1 + o2 e2 + o3 e3 + o4 e4 + o5 e5 + o6 e6 + o7 e7 ,

where o0 , . . . , o7 ∈ R. The table of multiplication in O is

• 1 e1 e2 e3 e4 e5 e6 e7
1 1 e1 e2 e3 e4 e5 e6 e7
e1 e1 −1 e3 −e2 e5 −e4 −e7 e6
e2 e2 −e3 −1 e1 e6 e7 −e4 −e5
e3 e3 e2 −e1 −1 e7 −e6 e5 −e4
e4 e4 −e5 −e6 −e7 −1 e1 e2 e3
e5 e5 e4 −e7 e6 −e1 −1 −e3 e2
e6 e6 e7 e4 −e5 −e2 e3 −1 −e1
e7 e7 −e6 e5 e4 −e3 −e2 e1 −1
2
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

3
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

If o = o then o is called a pure octonion.

3
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

If o = o then o is called a pure octonion. The subset of all pure
octonions is denoted by Vec O, while the subset of all scalars will be
denoted by Sc O.

3
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

If o = o then o is called a pure octonion. The subset of all pure
octonions is denoted by Vec O, while the subset of all scalars will be
denoted by Sc O. The octonion

o = o0 − o

is called the conjugate of o.

3
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

If o = o then o is called a pure octonion. The subset of all pure
octonions is denoted by Vec O, while the subset of all scalars will be
denoted by Sc O. The octonion

o = o0 − o

is called the conjugate of o. The mapping o 7−→ o is called

conjugation.

3
The Octonions

Definition
We will call the part o0 =: Sc o, the scalar part of o and

o = o − o0 =: Vec o,

the vector part of o.

If o = o then o is called a pure octonion. The subset of all pure
octonions is denoted by Vec O, while the subset of all scalars will be
denoted by Sc O. The octonion

o = o0 − o

is called the conjugate of o. The mapping o 7−→ o is called

conjugation. A well known fact about conjugation is that, for
o1 , o2 ∈ O,
o1 o2 = o2 o1 .

3
The Octonions

Definition
The norm or absolute value of a octonion o is defined as
√
|o| := oo. (1.1)

4
The Octonions

Definition
The norm or absolute value of a octonion o is defined as
√
|o| := oo. (1.1)

If |o| = 1 the octonion o is said to be a unit octonion.

4
The Octonions

Definition
The norm or absolute value of a octonion o is defined as
√
|o| := oo. (1.1)

If |o| = 1 the octonion o is said to be a unit octonion. The imaginary

octonions of norm 1 form a 6 − sphere in the 7 − dimensional space
of imaginary octonions

S6O := o = e1 r1 + · · · + e7 r7 | r21 + · · · + r27 = 1 . (1.2)

4
The Octonions

Definition
The norm or absolute value of a octonion o is defined as
√
|o| := oo. (1.1)

If |o| = 1 the octonion o is said to be a unit octonion. The imaginary

octonions of norm 1 form a 6 − sphere in the 7 − dimensional space
of imaginary octonions

S6O := o = e1 r1 + · · · + e7 r7 | r21 + · · · + r27 = 1 . (1.2)

Remark
A well know property of O is that of alternativity,

4
The Octonions

Definition
The norm or absolute value of a octonion o is defined as
√
|o| := oo. (1.1)

If |o| = 1 the octonion o is said to be a unit octonion. The imaginary

octonions of norm 1 form a 6 − sphere in the 7 − dimensional space
of imaginary octonions

S6O := o = e1 r1 + · · · + e7 r7 | r21 + · · · + r27 = 1 . (1.2)

Remark
A well know property of O is that of alternativity, i.e., given o1 , o1 ∈ O,
then

(o1 o1 )o2 = o1 (o1 o2 ), (o1 o2 )o1 = o1 (o2 o1 ), (o2 o1 )o1 = o2 (o1 o1 ).

4
The Octonions

Definition
The exponential of an octonion is defined through the infinite series:
For any o ∈ O,
X∞
ok
eo := .
k!
k=0

5
The Octonions

Definition
The exponential of an octonion is defined through the infinite series:
For any o ∈ O,
X∞
ok
eo := .
k!
k=0

Remark
It can be shown that if we denote o = Vec o, then
 
o Sc o o
e =e cos |o| + sin |o| ,
|o|

where | · | is the octonion norm.

5
The Octonions

Definition
The exponential of an octonion is defined through the infinite series:
For any o ∈ O,
X∞
ok
eo := .
k!
k=0

Remark
It can be shown that if we denote o = Vec o, then
 
o Sc o o
e =e cos |o| + sin |o| ,
|o|

where | · | is the octonion norm. Due to the fact that octonions are
non-commutative, the relation

eo1 +o2 = eo1 · eo2

is not always true.

5
The Octonions

Definition
The exponential of an octonion is defined through the infinite series:
For any o ∈ O,
X∞
ok
eo := .
k!
k=0

Remark
It can be shown that if we denote o = Vec o, then
 
o Sc o o
e =e cos |o| + sin |o| ,
|o|

where | · | is the octonion norm. Due to the fact that octonions are
non-commutative, the relation

eo1 +o2 = eo1 · eo2

is not always true. However, this property holds when o1 · o2 = o2 · o1 .

5
The Octonions

Lemma
Given any two octonions o1 , o2 , the subalgebra generated by
{1, o1 , o2 } is associative.

6
The Octonions

Lemma
Given any two octonions o1 , o2 , the subalgebra generated by
{1, o1 , o2 } is associative. This means, in particular, that, given
o, µ ∈ O, where µ is a pure unit octonion, and a, b, c, d, α, β ∈ R, we
have
[o · (a + bµ)] · (c + dµ) = o · [(a + bµ) · (c + dµ)]

6
The Octonions

Lemma
Given any two octonions o1 , o2 , the subalgebra generated by
{1, o1 , o2 } is associative. This means, in particular, that, given
o, µ ∈ O, where µ is a pure unit octonion, and a, b, c, d, α, β ∈ R, we
have
[o · (a + bµ)] · (c + dµ) = o · [(a + bµ) · (c + dµ)]
and
[(a + bµ) · o] · (c + dµ) = (a + bµ) · [o · (c + dµ)],

6
The Octonions

Lemma
Given any two octonions o1 , o2 , the subalgebra generated by
{1, o1 , o2 } is associative. This means, in particular, that, given
o, µ ∈ O, where µ is a pure unit octonion, and a, b, c, d, α, β ∈ R, we
have
[o · (a + bµ)] · (c + dµ) = o · [(a + bµ) · (c + dµ)]
and
[(a + bµ) · o] · (c + dµ) = (a + bµ) · [o · (c + dµ)],
which implies

(o · eαµ ) · eβµ = o · (eαµ · eβµ ) and (eαµ · o) · eβµ = eαµ · (o · eβµ ). (1.3)

6
The three−dimensional octonion
Fourier transform
The three−dimensional octonion Fourier transform

Definition

Let f ∈ L1 R3 ; O . The (right) 3−dimensional Octonion Fourier
Transform of f (or 3D−OFT for short) is the function
FOFT {f} : R3 → O, defined by
Z
b
FOFT {f(x)}(ω) = f(ω) = f(x)e−µω·x d3 x, (2.1)
R3

where x = x1 e1 + x2 e2 + x3 e3 , ω = ω1 e1 + ω2 e2 + ω3 e3 , µ is a pure unit

octonion and e−µω·x is called the octonion Fourier kernel.

7
The three−dimensional octonion Fourier transform

Definition

Let f ∈ L1 R3 ; O . The (right) 3−dimensional Octonion Fourier
Transform of f (or 3D−OFT for short) is the function
FOFT {f} : R3 → O, defined by
Z
b
FOFT {f(x)}(ω) = f(ω) = f(x)e−µω·x d3 x, (2.1)
R3

where x = x1 e1 + x2 e2 + x3 e3 , ω = ω1 e1 + ω2 e2 + ω3 e3 , µ is a pure unit

octonion and e−µω·x is called the octonion Fourier kernel.
Example

For positive real numbers a, b, c, we obtain

r  
n o π3 ω2 ω2 ω2
−(ax21 +bx22 +cx23 )
FOFT e (ω) = exp − 1 − 2 − 3 .
abc 4a 4b 4c

7
The three−dimensional octonion Fourier transform

Definition

Let f ∈ L1 R3 ; O . The (right) 3−dimensional Octonion Fourier
Transform of f (or 3D−OFT for short) is the function
FOFT {f} : R3 → O, defined by
Z
b
FOFT {f(x)}(ω) = f(ω) = f(x)e−µω·x d3 x, (2.1)
R3

where x = x1 e1 + x2 e2 + x3 e3 , ω = ω1 e1 + ω2 e2 + ω3 e3 , µ is a pure unit

octonion and e−µω·x is called the octonion Fourier kernel.
Example

For positive real numbers a, b, c, we obtain

r  
n o π3 ω2 ω2 ω2
−(ax21 +bx22 +cx23 )
FOFT e (ω) = exp − 1 − 2 − 3 .
abc 4a 4b 4c

If a = b = c = 21 ,
7
The three−dimensional octonion Fourier transform

Definition

Let f ∈ L1 R3 ; O . The (right) 3−dimensional Octonion Fourier
Transform of f (or 3D−OFT for short) is the function
FOFT {f} : R3 → O, defined by
Z
b
FOFT {f(x)}(ω) = f(ω) = f(x)e−µω·x d3 x, (2.1)
R3

where x = x1 e1 + x2 e2 + x3 e3 , ω = ω1 e1 + ω2 e2 + ω3 e3 , µ is a pure unit

octonion and e−µω·x is called the octonion Fourier kernel.
Example

For positive real numbers a, b, c, we obtain

r  
n o π3 ω2 ω2 ω2
−(ax21 +bx22 +cx23 )
FOFT e (ω) = exp − 1 − 2 − 3 .
abc 4a 4b 4c
n 1 2 2 2o ω12 +ω22 +ω32
If a = b = c = 21 , then FOFT e− 2 (x1 +x2 +x3 ) (ω) = (2π)3/2 e− 2 .
7
Inversion formula for the 3D−OFT

Theorem

(Inversion formula for the 3D−OFT)

Suppose that f ∈ L2 R3 ; O .

8
Inversion formula for the 3D−OFT

Theorem

(Inversion formula for the 3D−OFT)

Suppose that f ∈ L2 R3 ; O . Then the 3D−OFT is invertible with
inverse
Z
−1 1 bf(ω)eµω·x d3 ω.
FOFT [FOFT {f}] (x) = f(x) = (2.2)
(2π)3 R3

8
Some Algebraic Properties
Some Algebraic Properties

Proposition
(R−linearity)
The 3D−OFT is R−linear.

9
Some Algebraic Properties

Proposition
(R−linearity)
The 3D−OFT is R−linear. That is, given a, b ∈ R and f, g ∈ L1 (R3 ; O),

FOFT {(af + bg)(x)} (ω) = abf(ω) + bg

b(ω). (3.1)

9
Some Algebraic Properties

Proposition
(R−linearity)
The 3D−OFT is R−linear. That is, given a, b ∈ R and f, g ∈ L1 (R3 ; O),

FOFT {(af + bg)(x)} (ω) = abf(ω) + bg

b(ω). (3.1)

Remark
In view of non-associativity, (left) O−linearity is false in general.

9
Some Algebraic Properties

Proposition
(R−linearity)
The 3D−OFT is R−linear. That is, given a, b ∈ R and f, g ∈ L1 (R3 ; O),

FOFT {(af + bg)(x)} (ω) = abf(ω) + bg

b(ω). (3.1)

Remark
In view of non-associativity, (left) O−linearity is false in general.
However, if a ∈ O and 1, a, f and µ generate an associative
sub-algebra of O is not difficult to see that

FOFT {af(x)} (ω) = abf(ω).

9
Some Algebraic Properties

Proposition

(Shift Property)
Let x0 ∈ R3 and f ∈ L1 (R3 ; O).

10
Some Algebraic Properties

Proposition

(Shift Property)
Let x0 ∈ R3 and f ∈ L1 (R3 ; O). Then,

FOFT {f (x − x0 )} (ω) = bf(ω)e−µω·x0 . (3.2)

10
Some Algebraic Properties

Proposition

(Shift Property)
Let x0 ∈ R3 and f ∈ L1 (R3 ; O). Then,

FOFT {f (x − x0 )} (ω) = bf(ω)e−µω·x0 . (3.2)

Proposition
(Modulation Property 1)
Let ω 0 ∈ R3 and f ∈ L1 (R3 ; O).

10
Some Algebraic Properties

Proposition

(Shift Property)
Let x0 ∈ R3 and f ∈ L1 (R3 ; O). Then,

FOFT {f (x − x0 )} (ω) = bf(ω)e−µω·x0 . (3.2)

Proposition
(Modulation Property 1)
Let ω 0 ∈ R3 and f ∈ L1 (R3 ; O). Then,

FOFT {f(x)eµω0 ·x } (ω) = bf (ω − ω 0 ) . (3.3)

10
Some Algebraic Properties

Proposition

(Modulation Property 2) Let ω 0 ∈ R3 , f ∈ L1 (R3 ; O) and η ∈ O be

a pure unit octonion.

11
Some Algebraic Properties

Proposition

(Modulation Property 2) Let ω 0 ∈ R3 , f ∈ L1 (R3 ; O) and η ∈ O be

a pure unit octonion. Then,
1 b 
FOFT {f(x)eηω0 ·x } (ω) = f (ω − ω 0 ) + bf (ω + ω 0 )
2
1 b 
b (ω + ω 0 ) · µ,
− fη (ω − ω 0 ) − fη
2

11
Some Algebraic Properties

Proposition

(Modulation Property 2) Let ω 0 ∈ R3 , f ∈ L1 (R3 ; O) and η ∈ O be

a pure unit octonion. Then,
1 b 
FOFT {f(x)eηω0 ·x } (ω) = f (ω − ω 0 ) + bf (ω + ω 0 )
2
1 b 
b (ω + ω 0 ) · µ,
− fη (ω − ω 0 ) − fη
2
which in case of real-valued functions reduces to
1 − ηµ b 1 + ηµ b
FOFT {f(x)eηω0 ·x } (ω) = · f (ω − ω 0 ) + · f (ω + ω 0 ) .
2 2

11
Some Algebraic Properties

Proposition
Let A be an invertible 3-by-3 matrix and f ∈ L1 (R3 ; O).

12
Some Algebraic Properties

Proposition
Let A be an invertible 3-by-3 matrix and f ∈ L1 (R3 ; O). Then,
 
FOFT {f(Ax)} (ω) = |det A|−1 bf A−t ω ,

t
where A−t = A−1 .

12
Some Algebraic Properties

Proposition
Let A be an invertible 3-by-3 matrix and f ∈ L1 (R3 ; O). Then,
 
FOFT {f(Ax)} (ω) = |det A|−1 bf A−t ω ,

t
where A−t = A−1 .
Corollary
(Rotation Property) Let R ∈ SO(3) and f ∈ L1 (R3 ; O). Then,

FOFT {f(Rx)} (ω) = bf (Rω) . (3.4)

12
Some Algebraic Properties

Proposition
Let A be an invertible 3-by-3 matrix and f ∈ L1 (R3 ; O). Then,
 
FOFT {f(Ax)} (ω) = |det A|−1 bf A−t ω ,

t
where A−t = A−1 .
Corollary
(Rotation Property) Let R ∈ SO(3) and f ∈ L1 (R3 ; O). Then,

FOFT {f(Rx)} (ω) = bf (Rω) . (3.4)

Corollary
(Dilation or Scaling Property) Let a, b, c ∈ R \ {0} be positive real numbers
and f ∈ L1 (R3 ; O).

12
Some Algebraic Properties

Proposition
Let A be an invertible 3-by-3 matrix and f ∈ L1 (R3 ; O). Then,
 
FOFT {f(Ax)} (ω) = |det A|−1 bf A−t ω ,

t
where A−t = A−1 .
Corollary
(Rotation Property) Let R ∈ SO(3) and f ∈ L1 (R3 ; O). Then,

FOFT {f(Rx)} (ω) = bf (Rω) . (3.4)

Corollary
(Dilation or Scaling Property) Let a, b, c ∈ R \ {0} be positive real numbers
and f ∈ L1 (R3 ; O). Then,
1 n  x x x o
(ω) = bf(aω1 , bω2 , cω3 ).
1 2 3
FOFT f , , (3.5)
|abc| a b c
12
Convolution
Convolution

Definition
The convolution of f, g ∈ L2 (R3 ; O) is defined by
Z
(f ∗ g)(x) = f(y)g (x − y) d3 y. (4.1)
R3

13
Convolution

Definition
The convolution of f, g ∈ L2 (R3 ; O) is defined by
Z
(f ∗ g)(x) = f(y)g (x − y) d3 y. (4.1)
R3

Theorem
Suppose that 1, f, g, µ generate an associative sub-algebra of O.

13
Convolution

Definition
The convolution of f, g ∈ L2 (R3 ; O) is defined by
Z
(f ∗ g)(x) = f(y)g (x − y) d3 y. (4.1)
R3

Theorem
Suppose that 1, f, g, µ generate an associative sub-algebra of O. Then
Z


FOFT {(f ∗ g)(x)} (ω) = b(ω)e−µω·y d3 y.
f(y) g (4.2)
R3

13
Convolution

Remark
Note that

b(ω) commutes with µ,

i) If g

14
Convolution

Remark
Note that

b(ω) commutes with µ, then

i) If g

FOFT {(f ∗ g)(x)} (ω) = bf(ω)g

b(ω).

14
Convolution

Remark
Note that

b(ω) commutes with µ, then

i) If g

FOFT {(f ∗ g)(x)} (ω) = bf(ω)g

b(ω).

b(ω) commutes with f,

ii) If g

14
Convolution

Remark
Note that

b(ω) commutes with µ, then

i) If g

FOFT {(f ∗ g)(x)} (ω) = bf(ω)g

b(ω).

b(ω) commutes with f, then

ii) If g

b(ω)bf(ω).
FOFT {(f ∗ g)(x)} (ω) = g

14
Convolution

Remark
Note that

b(ω) commutes with µ, then

i) If g

FOFT {(f ∗ g)(x)} (ω) = bf(ω)g

b(ω).

b(ω) commutes with f, then

ii) If g

b(ω)bf(ω).
FOFT {(f ∗ g)(x)} (ω) = g

7
X
iii) If commutativity is not assumed, from f = fi ei ,
i=0

14
Convolution

Remark
Note that

b(ω) commutes with µ, then

i) If g

FOFT {(f ∗ g)(x)} (ω) = bf(ω)g

b(ω).

b(ω) commutes with f, then

ii) If g

b(ω)bf(ω).
FOFT {(f ∗ g)(x)} (ω) = g

7
X
iii) If commutativity is not assumed, from f = fi ei , we have
i=0
7
X Z  7
X


FOFT {(f ∗ g)(x)} (ω) = ei g(ω)e−µω·y d3 y
fi (y) b = g(ω)bfi (ω).
ei b
i=0 R3 i=0
14
Convolution

Remark
Also note that the previous result is valid, in particular, when f or g
are real−valued functions.

15
Convolution

Remark
Also note that the previous result is valid, in particular, when f or g
are real−valued functions.

Corollary
Suppose that gb(ω) commutes with µ and 1, f, g, µ generate an
associative sub-algebra of O.

15
Convolution

Remark
Also note that the previous result is valid, in particular, when f or g
are real−valued functions.

Corollary
Suppose that gb(ω) commutes with µ and 1, f, g, µ generate an
associative sub-algebra of O. Then
n o
−1 b b(ω) (x) = (f ∗ g)(x).
FOFT f(ω)g

15
Plancherel and Parseval’s
Theorems
Plancherel and Parseval’s Theorems

Definition
Let f, g ∈ L2 (R3 ; O), we define
Z
hf, giL2 (R3 ;O) := f(x)g(x)d3 x (5.1)
R3

16
Plancherel and Parseval’s Theorems

Definition
Let f, g ∈ L2 (R3 ; O), we define
Z
hf, giL2 (R3 ;O) := f(x)g(x)d3 x (5.1)
R3

and Z 1/2
1/2 2
kfkL2 (R3 ;O) = hf, fiL2 (R3 ;O) = |f(x)| d3 x . (5.2)
R3

16
Plancherel and Parseval’s Theorems

Using the previous definition, we have the following theorem.

17
Plancherel and Parseval’s Theorems

Using the previous definition, we have the following theorem.

Theorem

(Plancherel’s Theorem) Let f, g ∈ L2 (R3 ; O) such that 1, f, g and µ

generate an associative sub-algebra of O.

17
Plancherel and Parseval’s Theorems

Using the previous definition, we have the following theorem.

Theorem

(Plancherel’s Theorem) Let f, g ∈ L2 (R3 ; O) such that 1, f, g and µ

generate an associative sub-algebra of O. Then,
1 b
hf, giL2 (R3 ;O) = biL2 (R3 ;O) .
hf, g (5.3)
(2π)3

17
Plancherel and Parseval’s Theorems

Using the previous definition, we have the following theorem.

Theorem

(Plancherel’s Theorem) Let f, g ∈ L2 (R3 ; O) such that 1, f, g and µ

generate an associative sub-algebra of O. Then,
1 b
hf, giL2 (R3 ;O) = biL2 (R3 ;O) .
hf, g (5.3)
(2π)3

Corollary
(Parseval’s Theorem) In the previous formula, if f = g,

17
Plancherel and Parseval’s Theorems

Using the previous definition, we have the following theorem.

Theorem

(Plancherel’s Theorem) Let f, g ∈ L2 (R3 ; O) such that 1, f, g and µ

generate an associative sub-algebra of O. Then,
1 b
hf, giL2 (R3 ;O) = biL2 (R3 ;O) .
hf, g (5.3)
(2π)3

Corollary
(Parseval’s Theorem) In the previous formula, if f = g, then
1
kfkL2 (R3 ;O) = 3 kbfkL2 (R3 ;O) .
(2π) 2

17
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

18
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

So, Parseval’s theorem is always true for all f ∈ L2 R3 ; O .

18
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

So, Parseval’s theorem is always true for all f ∈ L2 R3 ; O .
The Plancherel’s Theorem can be generalized to the case where f, g
and µ don’t necessarily generate an associative sub-algebra of O, in
the following way:

18
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

So, Parseval’s theorem is always true for all f ∈ L2 R3 ; O .
The Plancherel’s Theorem can be generalized to the case where f, g
and µ don’t necessarily generate an associative sub-algebra of O, in
the following way:
7
X
If we write f = fi ei ,
i=0

18
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

So, Parseval’s theorem is always true for all f ∈ L2 R3 ; O .
The Plancherel’s Theorem can be generalized to the case where f, g
and µ don’t necessarily generate an associative sub-algebra of O, in
the following way:
7
X
If we write f = fi ei , then
i=0

7
X 7
1 X b
hf, giL2 (R3 ;O) = ei hfi , giL2 (R3 ;O) = biL2 (R3 ;O) ,
ei hfi , g
(2π)3
i=0 i=0

18
Plancherel and Parseval’s Theorems

Remark

Note that 1, f and µ always generate an associative sub-algebra of O.

So, Parseval’s theorem is always true for all f ∈ L2 R3 ; O .
The Plancherel’s Theorem can be generalized to the case where f, g
and µ don’t necessarily generate an associative sub-algebra of O, in
the following way:
7
X
If we write f = fi ei , then
i=0

7
X 7
1 X b
hf, giL2 (R3 ;O) = ei hfi , giL2 (R3 ;O) = biL2 (R3 ;O) ,
ei hfi , g
(2π)3
i=0 i=0

since fi , g and µ always generate an associative sub-algebra of O, the

above-mentioned result is valid for all f, g ∈ L2 (R3 ; O).

18
Admissible Octonion Wavelets
Admissible Octonion Wavelets

Definition
The Similitude Group SIM(3) is given by

SIM(3) = G = R+ ×SO (3)×R3 = {(a, r, b)| a ∈ R+ , r ∈ SO (3) , b ∈ R3 },

19
Admissible Octonion Wavelets

Definition
The Similitude Group SIM(3) is given by

SIM(3) = G = R+ ×SO (3)×R3 = {(a, r, b)| a ∈ R+ , r ∈ SO (3) , b ∈ R3 },

where b, a and r are the translation, dilation and rotation elements,

respectively, and SO(3) is the special orthogonal group in R3 , i.e. the
rotation group in R3 .

19
Admissible Octonion Wavelets

Definition
The Similitude Group SIM(3) is given by

SIM(3) = G = R+ ×SO (3)×R3 = {(a, r, b)| a ∈ R+ , r ∈ SO (3) , b ∈ R3 },

where b, a and r are the translation, dilation and rotation elements,

respectively, and SO(3) is the special orthogonal group in R3 , i.e. the
rotation group in R3 .

Definition

A function ψ ∈ L2 (R3 ; O) is an admissible octonion wavelet (AOW) if

ψ satisfies the admissibility condition
Z Z
b 2 da dR
Cψ = |ψ(aR(ω))| < ∞, (6.1)
SO(3) R + a

19
Admissible Octonion Wavelets

Definition
The Similitude Group SIM(3) is given by

SIM(3) = G = R+ ×SO (3)×R3 = {(a, r, b)| a ∈ R+ , r ∈ SO (3) , b ∈ R3 },

where b, a and r are the translation, dilation and rotation elements,

respectively, and SO(3) is the special orthogonal group in R3 , i.e. the
rotation group in R3 .

Definition

A function ψ ∈ L2 (R3 ; O) is an admissible octonion wavelet (AOW) if

ψ satisfies the admissibility condition
Z Z
b 2 da dR
Cψ = |ψ(aR(ω))| < ∞, (6.1)
SO(3) R + a

where R ∈ SO(3) and |ω| = 1.

19
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

20
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

Proposition
Let ψ ∈ L2 (R3 ; O) be a radially symmetric function, i.e. rotation
invariant.

20
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

Proposition
Let ψ ∈ L2 (R3 ; O) be a radially symmetric function, i.e. rotation
b is continuous in ω = 0 and |ψ(0)|
invariant. If |ψ| b = 0,

20
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

Proposition
Let ψ ∈ L2 (R3 ; O) be a radially symmetric function, i.e. rotation
b is continuous in ω = 0 and |ψ(0)|
invariant. If |ψ| b = 0, then ψ is an
AOW.

20
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

Proposition
Let ψ ∈ L2 (R3 ; O) be a radially symmetric function, i.e. rotation
b is continuous in ω = 0 and |ψ(0)|
invariant. If |ψ| b = 0, then ψ is an
AOW.

Definition
Let ψ ∈ L2 (R3 ; O) and (a, R, b) ∈ G, we define the unitary linear
operator
Ua,R,b : L2 (R3 ; O) → L2 (R3 ; O), (6.2)

20
Admissible Octonion Wavelets

Remark
Cψ is a positive real constant, independent of ω with |ω| = 1.

Proposition
Let ψ ∈ L2 (R3 ; O) be a radially symmetric function, i.e. rotation
b is continuous in ω = 0 and |ψ(0)|
invariant. If |ψ| b = 0, then ψ is an
AOW.

Definition
Let ψ ∈ L2 (R3 ; O) and (a, R, b) ∈ G, we define the unitary linear
operator
Ua,R,b : L2 (R3 ; O) → L2 (R3 ; O), (6.2)
by   
1 x−b
Ua,R,b (ψ)(x) := ψa,R,b (x) = ψ R . (6.3)
a3/2 a

20
Admissible Octonion Wavelets

Remark
It is easy to check that the operator Ua,R,b preserves the L2 -norm of
an AOW ψ,

21
Admissible Octonion Wavelets

Remark
It is easy to check that the operator Ua,R,b preserves the L2 -norm of
an AOW ψ, i.e. for every (a, R, b) ∈ G, we have

kψa,R,b kL2 (R3 ;O) = kψkL2 (R3 ;O) .

21
Admissible Octonion Wavelets

Remark
It is easy to check that the operator Ua,R,b preserves the L2 -norm of
an AOW ψ, i.e. for every (a, R, b) ∈ G, we have

kψa,R,b kL2 (R3 ;O) = kψkL2 (R3 ;O) .

Remark
For an AOW ψ, we say that ψ is an octonion mother wavelet and
ψa,R,b are called daughter octonion wavelets.

21
Admissible Octonion Wavelets

Remark
It is easy to check that the operator Ua,R,b preserves the L2 -norm of
an AOW ψ, i.e. for every (a, R, b) ∈ G, we have

kψa,R,b kL2 (R3 ;O) = kψkL2 (R3 ;O) .

Remark
For an AOW ψ, we say that ψ is an octonion mother wavelet and
ψa,R,b are called daughter octonion wavelets.
Proposition

Let ψ be an octonion mother wavelet.

21
Admissible Octonion Wavelets

Remark
It is easy to check that the operator Ua,R,b preserves the L2 -norm of
an AOW ψ, i.e. for every (a, R, b) ∈ G, we have

kψa,R,b kL2 (R3 ;O) = kψkL2 (R3 ;O) .

Remark
For an AOW ψ, we say that ψ is an octonion mother wavelet and
ψa,R,b are called daughter octonion wavelets.
Proposition

Let ψ be an octonion mother wavelet. The 3D−OFT of the daughter

octonion wavelets (6.3) can be written as follows:
n o
b
FOFT ψa,R,b (x) (ω) = a3/2 ψ(aR(ω)) · e−µω·b . (6.4)

21
Three−dimensional Continuous
Octonion Wavelet Transform
Three−dimensional Continuous Octonion Wavelet Transform

Definition
The three−dimensional Continuous Octonion Wavelet Transform
(3D−COWT) of a function f ∈ L2 (R3 ; O) with respect to an octonion
mother wavelet ψ

22
Three−dimensional Continuous Octonion Wavelet Transform

Definition
The three−dimensional Continuous Octonion Wavelet Transform
(3D−COWT) of a function f ∈ L2 (R3 ; O) with respect to an octonion
mother wavelet ψ is defined by
Z   
1 x−b
Tψ f(a, R, b) = ⟨f, ψa,R,b ⟩L2 (R3 ;O) = f(x) · ψ R d3 x. (7.1)
R3 a3/2 a

22
Three−dimensional Continuous Octonion Wavelet Transform

Definition
The three−dimensional Continuous Octonion Wavelet Transform
(3D−COWT) of a function f ∈ L2 (R3 ; O) with respect to an octonion
mother wavelet ψ is defined by
Z   
1 x−b
Tψ f(a, R, b) = ⟨f, ψa,R,b ⟩L2 (R3 ;O) = f(x) · ψ R d3 x. (7.1)
R3 a3/2 a

Theorem

Let ψ be an octonion mother wavelet and f ∈ L2 (R3 ; O) such that

1, ψ, f and µ generate an associative sub−algebra of O.

22
Three−dimensional Continuous Octonion Wavelet Transform

Definition
The three−dimensional Continuous Octonion Wavelet Transform
(3D−COWT) of a function f ∈ L2 (R3 ; O) with respect to an octonion
mother wavelet ψ is defined by
Z   
1 x−b
Tψ f(a, R, b) = ⟨f, ψa,R,b ⟩L2 (R3 ;O) = f(x) · ψ R d3 x. (7.1)
R3 a3/2 a

Theorem

Let ψ be an octonion mother wavelet and f ∈ L2 (R3 ; O) such that

1, ψ, f and µ generate an associative sub−algebra of O. Then
Z  
a3/2 bf(ω)eµω·b · ψ(aR(ω))d
b 3
Tψ f(a, R, b) = ω.
(2π)3 R3

22
Three−dimensional Continuous Octonion Wavelet Transform

Remark

Note that, if ψ commutes with µ, we can write

b
eµω·b ψ(aR(ω)) b
= ψ(aR(ω))e µω·b
.

23
Three−dimensional Continuous Octonion Wavelet Transform

Remark

Note that, if ψ commutes with µ, we can write

b
eµω·b ψ(aR(ω)) b
= ψ(aR(ω))e µω·b
.

Then, n o
−1
Tψ f(a, R, b) = FOFT a3/2bf(ω)ψ(aR(ω))
b (b).

23
Three−dimensional Continuous Octonion Wavelet Transform

Remark

Note that, if ψ commutes with µ, we can write

b
eµω·b ψ(aR(ω)) b
= ψ(aR(ω))e µω·b
.

Then, n o
−1
Tψ f(a, R, b) = FOFT a3/2bf(ω)ψ(aR(ω))
b (b).

In other words,
n o
FOFT Tψ f(a, R, b) (ω) = a3/2bf(ω)ψ(aR(ω)),
b

23
Three−dimensional Continuous Octonion Wavelet Transform

Remark

Note that, if ψ commutes with µ, we can write

b
eµω·b ψ(aR(ω)) b
= ψ(aR(ω))e µω·b
.

Then, n o
−1
Tψ f(a, R, b) = FOFT a3/2bf(ω)ψ(aR(ω))
b (b).

In other words,
n o
FOFT Tψ f(a, R, b) (ω) = a3/2bf(ω)ψ(aR(ω)),
b

where the 3D−OFT on the left-hand side is calculated with respect to

the variable b.

23
Three−dimensional Continuous Octonion Wavelet Transform

Remark

Note that, if ψ commutes with µ, we can write

b
eµω·b ψ(aR(ω)) b
= ψ(aR(ω))e µω·b
.

Then, n o
−1
Tψ f(a, R, b) = FOFT a3/2bf(ω)ψ(aR(ω))
b (b).

In other words,
n o
FOFT Tψ f(a, R, b) (ω) = a3/2bf(ω)ψ(aR(ω)),
b

where the 3D−OFT on the left-hand side is calculated with respect to

the variable b. This result is true, in particular, if ψ = ψ0 + µψ1 , with
ψ0 , ψ1 : R3 → R.

23
Basic properties of the 3D−COWT
Basic properties of the 3D−COWT

Proposition
(R−Linearity)

24
Basic properties of the 3D−COWT

Proposition
(R−Linearity) For all α, β ∈ R,

[Tψ (αf + βg)(x)] (a, R, b) = αTψ f(x)(a, R, b) + βTψ g(x)(a, R, b).

24
Basic properties of the 3D−COWT

Proposition
(R−Linearity) For all α, β ∈ R,

[Tψ (αf + βg)(x)] (a, R, b) = αTψ f(x)(a, R, b) + βTψ g(x)(a, R, b).

Proposition
(Shift)

24
Basic properties of the 3D−COWT

Proposition
(R−Linearity) For all α, β ∈ R,

[Tψ (αf + βg)(x)] (a, R, b) = αTψ f(x)(a, R, b) + βTψ g(x)(a, R, b).

Proposition
(Shift) For all x0 ∈ R3 ,

[Tψ f (x − x0 )] (a, R, b) = Tψ f(x) (a, R, b − x0 ) .

24
Basic properties of the 3D−COWT

Proposition
(R−Linearity) For all α, β ∈ R,

[Tψ (αf + βg)(x)] (a, R, b) = αTψ f(x)(a, R, b) + βTψ g(x)(a, R, b).

Proposition
(Shift) For all x0 ∈ R3 ,

[Tψ f (x − x0 )] (a, R, b) = Tψ f(x) (a, R, b − x0 ) .

Proposition
(Dilation)

24
Basic properties of the 3D−COWT

Proposition
(R−Linearity) For all α, β ∈ R,

[Tψ (αf + βg)(x)] (a, R, b) = αTψ f(x)(a, R, b) + βTψ g(x)(a, R, b).

Proposition
(Shift) For all x0 ∈ R3 ,

[Tψ f (x − x0 )] (a, R, b) = Tψ f(x) (a, R, b − x0 ) .

Proposition
(Dilation) Let c be a positive real constant. Then,
1
[Tψ f(cx)] (a, R, b) = [Tψ f(x)] (ca, R, cb).
c3/2

24
Basic properties of the 3D−COWT

Proposition
(Rotation)

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 ,

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity)

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity) Let P be the parity operator defined by Pf(x) = f(−x).

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity) Let P be the parity operator defined by Pf(x) = f(−x). Then,

[TPψ Pf(x)] (a, R, b) = Tψ f(a, R, −b).

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity) Let P be the parity operator defined by Pf(x) = f(−x). Then,

[TPψ Pf(x)] (a, R, b) = Tψ f(a, R, −b).

Proposition
(Anti-homogeneity)

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity) Let P be the parity operator defined by Pf(x) = f(−x). Then,

[TPψ Pf(x)] (a, R, b) = Tψ f(a, R, −b).

Proposition
(Anti-homogeneity) Let α ∈ O such that 1, α, f and ψ generate an
associative sub−algebra of O.

25
Basic properties of the 3D−COWT

Proposition
(Rotation) Let R1 be a matrix in SO(3). If R′ = RR−1
1 , then,

[Tψ f (R1 x)] (a, R, b) = Tψ f (a, R′ , R1 b) .

Proposition
(Parity) Let P be the parity operator defined by Pf(x) = f(−x). Then,

[TPψ Pf(x)] (a, R, b) = Tψ f(a, R, −b).

Proposition
(Anti-homogeneity) Let α ∈ O such that 1, α, f and ψ generate an
associative sub−algebra of O. Then,

Tαψ f(a, R, b) = Tψ f(a, R, b)α.

25
Basic properties of the 3D−COWT

Proposition
(Traslation Operator)

26
Basic properties of the 3D−COWT

Proposition
(Traslation Operator) Let Mx0 ψ(x) = ψ (x − x0 ) be the, so called,
traslation operator.

26
Basic properties of the 3D−COWT

Proposition
(Traslation Operator) Let Mx0 ψ(x) = ψ (x − x0 ) be the, so called,
traslation operator. Then
 

TMxo ψ f(x) (a, R, b) = Tψ f(x) a, R, b + aR−1 x0 .

26
Basic properties of the 3D−COWT

Proposition
(Traslation Operator) Let Mx0 ψ(x) = ψ (x − x0 ) be the, so called,
traslation operator. Then
 

TMxo ψ f(x) (a, R, b) = Tψ f(x) a, R, b + aR−1 x0 .

Proposition
Let x
1
Dc ψ(x) = ψ , for c > 0.
c3/2 c

26
Basic properties of the 3D−COWT

Proposition
(Traslation Operator) Let Mx0 ψ(x) = ψ (x − x0 ) be the, so called,
traslation operator. Then
 

TMxo ψ f(x) (a, R, b) = Tψ f(x) a, R, b + aR−1 x0 .

Proposition
Let x
1
Dc ψ(x) = ψ , for c > 0.
c3/2 c
Then,
TDc ψ f(a, R, b) = Tψ f(ac, R, b).

26
Inversion Formula and Inner
product relation
Inversion Formula and Inner product relation

27
Inversion Formula and Inner product relation

Theorem

Let ψ be an AOW. If f ∈ L2 (R3 ; O) is such that 1, f, µ and ψ generate

an associative sub−algebra of O, and µ commutes with ψ,

27
Inversion Formula and Inner product relation

Theorem

Let ψ be an AOW. If f ∈ L2 (R3 ; O) is such that 1, f, µ and ψ generate

an associative sub−algebra of O, and µ commutes with ψ, then
Z
1 da dR
f(x) = Tψ f(a, R, b)ψa,R,b (x) 4 d3 b. (9.1)
Cψ G a

27
Inner product relation

28
Inner product relation

Theorem

Let ψ be an AOW. If f, g ∈ L2 (R3 ; O) are such that 1, f, g, µ and ψ

generate an associative sub-algebra of O and µ commutes with ψ,

28
Inner product relation

Theorem

Let ψ be an AOW. If f, g ∈ L2 (R3 ; O) are such that 1, f, g, µ and ψ

generate an associative sub-algebra of O and µ commutes with ψ,
then
Z
da dR
Tψ f(a, R, b)Tψ g(a, R, b) 4 d3 b = Cψ hf, giL2 (R3 ;O) .
G a

28
THANKS FOR YOUR ATTENTION!

29