# Compressive Sensing Approach in the Hermite Transform Domain

Authors: Srdjan Stanković; Ljubiša Stanković; Irena Orović
Journal: Mathematical Problems in Engineering
 (2015)

---

## Abstract

Compressive sensing has attracted significant interest of researchers providing an alternative way to sample and reconstruct the signals. This approach allows us to recover the entire signal from just a small set of random samples, whenever the signal is sparse in certain transform domain. Therefore, exploring the possibilities of using different transform basis is an important task, needed to extend the field of compressive sensing applications. In this paper, a compressive sensing approach based on the Hermite transform is proposed. The Hermite transform by itself provides compressed signal representation based on a smaller number of Hermite coefficients compared to the signal length. Here, it is shown that, for a wide class of signals characterized by sparsity in the Hermite domain, accurate signal reconstruction can be achieved even if incomplete set of measurements is used. Advantages of the proposed method are demonstrated on numerical examples. The presented concept is generalized for the short-time Hermite transform and combined transform.


---

## Body

## 1. Introduction

The Hermite polynomials and Hermite functions have attracted the attention of researchers in various fields of engineering and signal processing [1–7], such as in quantum mechanics (harmonic oscillators), ultra-high band telecommunication channels, and ECG data compression using Hermite functions representation of the QRS complexes. A set of Hermite functions forming an orthonormal basis is suitable for approximation, classification, and data compression tasks [3]. Since the Hermite functions are eigenfunctions of the Fourier transform, time and frequency spectra are simultaneously approximated. Here, we are especially interested in a class of signals that are sparse in the Hermite transform domain. Note that, generally, such signals are not sparse in the Fourier transform domain. In the light of compressive sensing (CS) theory [8–12], we propose the method for efficient reconstruction of signals from its incomplete set of samples using the Hermite transform. The number of Hermite functions used in this approach is much smaller compared to the original length of the signal. The proposed approach is useful in the applications where the significant information is missing and the total signal reconstruction is required. Note that the large amount of missing signal samples may occur as a consequence of the compressed sampling strategy but also as a consequence of discarding damaged signal parts [13–15]. The theory is illustrated through examples showing that the Hermite transform based CS for certain types of signals can outperform the Fourier transform related reconstructions. Furthermore, in analogy with the time-frequency analysis based on the Fourier transform, the short-time Hermite transform is defined as a linear representation that reveals the local behavior of windowed signal parts. If the signal components are of short duration, then the short-time Hermite transform is more suitable for compressive sensing than the standard Hermite transform. Finally, the possibility of combining different transforms depending on the signal characteristics is explored.The paper is organized as follows. The theory behind the Hermite transform and the fast method for Hermite coefficients calculation is given in Section2. The formulation of compressive sensing approach in the Hermite transform domain is given in Section 3. The possibilities to exploit other sparsity domains based on the short-time Hermite transform and combined transform are presented in Section 4. The experimental evaluation of the proposed approach is given in Section 4, while the concluding remarks are given in Section 5.


## 2. Hermite Transform

The Hermite functions provide good localization and the compact support in both time and frequency domain [4]. The ith order Hermite function is defined as follows:(1)
ψ
i
t
=
-
1
i
e
t
2
/
2
2
i
i
!
π
·
d
i
e
-
t
2
d
t
i
. The Hermite functions provide an orthonormal basis set for an optimal representation of different signals using the fewest number of basis functions. Signal expansion into Hermite functions, known as the Hermite transform, has been used for both 1D and 2D signals in various applications. The Hermite expansion for a signal f
(
t
) can be defined as follows:(2)
f
^
t
=
∑
i
=
0
N
-
1
C
i
ψ
i
t
,where ψ
i
(
t
) are the Hermite functions and N is the number of functions used for the approximation. The number of Hermite functions N could be usually much smaller than the number of signal samples M (N
≤
M). The Hermite coefficients can be defined by using the Hermite polynomials as follows:(3)
C
i
=
1
2
i
i
!
π
∫
-
∞
∞
e
-
t
2
f
t
e
t
2
H
i
t
d
t
,where (4)
H
i
t
=
-
1
i
e
t
2
d
i
e
-
t
2
d
t
i represents the Hermite polynomial. An efficient procedure for calculation of Hermite coefficients can be done by applying the Gauss-Hermite quadrature [5]:(5)
C
i
=
1
2
i
i
!
π
∑
m
=
1
M
2
M
-
1
M
!
π
M
2
H
M
-
1
2
t
m
f
t
m
e
t
m
2
/
2
H
i
t
m
, where t
m are zeros of Hermite polynomials. By using the Hermite functions instead of polynomials, a simplified expression is obtained: (6)
C
i
≈
1
M
∑
m
=
1
M
μ
M
-
1
i
t
m
f
t
m
.The constants μ
M
-
1
i
(
t
m
) are calculated as follows:(7)
μ
M
-
1
i
t
m
=
ψ
i
t
m
ψ
M
-
1
t
m
2
.


## 3. Compressive Sensing Formulation in the Hermite Transform Domain

Generally, the compressive sensing scenarios are focused on the new sampling strategy, which results in a large number of randomly missing samples compared to the standard sampling methods [8]. Hence, based on a small set of acquired measurements, the entire signal needs to be reconstructed. The missing samples in compressive sensing generally cannot be recovered using standard interpolation methods due to the complexity of nonstationary signals in real applications. Namely, the interpolation methods such as polynomial fit, cubic spline interpolation, or similar usually assume certain model function, which is mostly inappropriate for time domain signal modeling. Therefore, the compressive sensing reconstruction is formulated in the literature as an optimization problem (rather than interpolation) which reconstructs the signal by finding the sparsest transform domain solution corresponding to the available small set of samples.In the CS context, we are dealing with a small set of randomly chosen samples off
(
t
). Let us assume that we have only M
A out of M available samples (M is the total number of signal samples and M
≫
M
A). The vector of available measurements is denoted as y. Now we may write(8)
y
=
Φ
f
, where f is original full signal (of length M) written in the vector form, while Φ (M
A
×
M) is the measurement matrix. The original signal f can be expressed using the Hermite transform as follows:(9)
f
=
Ψ
C
, where C is the vector of Hermite transform coefficients, while Ψ is the inverse Hermite transform matrix of size M
×
N (N
≤
M):(10)
Ψ
=
ψ
0
0
ψ
1
0
⋯
ψ
N
-
1
0
ψ
0
1
ψ
1
1
⋯
ψ
N
-
1
1
⋯
⋯
⋯
⋯
ψ
0
M
-
1
ψ
1
M
-
1
⋯
ψ
N
-
1
M
-
1
,
H
=
1
M
ψ
0
0
ψ
N
-
1
0
2
ψ
0
1
ψ
N
-
1
1
2
⋯
ψ
0
M
-
1
ψ
N
-
1
M
-
1
2
ψ
1
0
ψ
N
-
1
0
2
ψ
1
1
ψ
N
-
1
1
2
⋯
ψ
1
M
-
1
ψ
N
-
1
M
-
1
2
⋯
⋯
⋯
⋯
ψ
N
-
1
0
ψ
N
-
1
0
2
ψ
N
-
1
1
ψ
N
-
1
1
2
⋯
ψ
N
-
1
M
-
1
ψ
N
-
1
M
-
1
2
. The direct Hermite transform matrix is given by H. In the extended form, (9) can be written as follows:(11)
f
0
f
1
⋯
f
M
-
1
︸
f
=
ψ
0
0
ψ
1
0
⋯
ψ
N
-
1
0
ψ
0
1
ψ
1
1
⋯
ψ
N
-
1
1
⋯
⋯
⋯
⋯
ψ
0
M
-
1
ψ
1
M
-
1
⋯
ψ
N
-
1
M
-
1
︸
Ψ
C
0
C
1
⋯
C
N
-
1
︸
C
.The Hermite basis functions are calculated using the fast recursive realization defined as follows:(12)
ψ
0
t
=
1
π
4
e
-
t
2
/
2
,
ψ
1
t
=
2
t
π
4
e
-
t
2
/
2
,
ψ
i
t
=
t
2
i
Ψ
i
-
1
t
-
i
-
1
i
Ψ
i
-
2
t
,
∀
i
≥
2
.According to (8) and (9), we have(13)
y
=
Φ
Ψ
C
=
Θ
C
.The reconstructed signalf can be obtained as a solution of M
A linear equations with M unknowns. The system is undetermined and can have infinitely many solutions. Now we assume that the signal is sparse in the Hermite transform domain. It means that the observed signal can be efficiently represented by a very small number K of Hermite expansion coefficients, such that K
<
M
A. Therefore, the optimization based mathematical algorithms should be employed to search for the sparsest solution. A near optimal solution is achieved by using the l
1 norm based minimization as follows: (14)
min
⁡
C
^
l
1
subject to
y
=
Θ
C
,where C
^ is the Hermite transform vector of signal f.In order to solve the previous minimization problem, first we need to calculate the initial Hermite transform using the available set ofM
A samples with the time support Ω
:
y
=
Φ
f
=
f
(
Ω
). Therefore, we observe the signal in the following form:(15)
f
0
n
=
y
n
,
for
n
∈
Ω
0
,
elsewhere. The initial vector of Hermite transform coefficients can be then calculated using N Hermite functions (N
≤
M) as follows:(16)
C
0
=
H
Ω
y
, where H
Ω contains only the columns of H that correspond to instants n
∈
Ω. Alternatively, we can write(17)
C
0
i
=
1
M
∑
n
=
0
M
-
1
ψ
i
n
ψ
M
-
1
n
2
f
0
n
,
i
=
1
,
…
,
N
. In order to determine the signal support in the Hermite transform domain, the initial vector of the Hermite transform coefficients C
0 is compared by the threshold T: (18)
k
=
arg
⁡
C
0
>
T
. The exact values of Hermite coefficients at positions selected in vector k are obtained as a solution of the CS problem:(19)
Θ
CS
C
0
=
y
.The CS matrix Θ
C
S is obtained from the inverse Hermite transform matrix Θ
C
S
=
Ψ
(
Ω
,
k
), using columns that correspond to frequencies k and rows corresponding to measurements with support Ω. The system is solved in the least square sense as follows:(20)
C
=
Θ
CS
∗
Θ
CS
-
1
Θ
CS
∗
y
,where (∗) denotes the conjugate transpose operation.Analysis of Components Reconstruction. Let us consider the isometry property of Hermite transform matrix Ψ: (21)
Ψ
C
2
2
=
f
2
2
=
f
0
2
+
⋯
+
f
N
-
1
2
=
∑
k
=
0
N
-
1
C
k
ψ
k
0
2
+
⋯
+
∑
k
=
0
N
-
1
C
k
ψ
k
N
-
1
2
=
∑
k
=
0
N
-
1
C
k
2
∑
n
=
0
N
-
1
ψ
k
n
2
+
∑
k
1
=
0
N
-
2
∑
k
2
=
k
1
+
1
N
-
1
2
C
k
1
C
k
2
∑
n
=
0
N
-
1
ψ
k
1
n
ψ
k
2
n
.The previous equation can be written as follows:(22)
Ψ
C
2
2
=
C
0
2
∑
n
=
0
N
-
1
ψ
0
n
2
+
⋯
+
C
N
-
1
2
∑
n
=
0
N
-
1
ψ
N
-
1
n
2
+
∑
k
1
=
0
N
-
2
∑
k
2
=
k
1
+
1
N
-
1
2
C
k
1
C
k
2
∑
n
=
0
N
-
1
ψ
k
1
n
ψ
k
2
n
.Now, observe the first term on the right side given by P
=
C
(
0
)
2
∑
n
=
0
N
-
1
ψ
0
(
n
)
2
+
⋯
+
C
(
N
-
1
)
2
∑
n
=
0
N
-
1
ψ
N
-
1
(
n
)
2, particularly the sum of squared values of different Hermite functions. Figure 1 illustrates the sum of squared values of different Hermite functions calculated in the zeros of Hermite polynomials for N = (128, 100, 70 and 50). Unlike in the case of the Fourier transform basis, where the sum of absolute values of complex exponential basis would be constant for any frequency k, from Figure 1 we can note an approximate low-pass characteristic of the curves, meaning that the lower-order coefficients are favored compared to the higher order coefficients. Consequently, when applying the threshold for components detection, it would be easier to detect a set of low-order coefficients than the high-order ones.Figure 1
Sum of squared values of Hermite functions for differentN.


## 4. Introducing the Short-Time Hermite Transform and Short-Time Combined Transform

### 4.1. Short-Time Hermite Transform

Let us assume thatN
=
M in (10) and define an M
×
M Hermite matrix:(23)
H
M
=
1
M
ψ
0
0
ψ
M
-
1
0
2
ψ
0
1
ψ
M
-
1
1
2
⋯
ψ
0
M
-
1
ψ
M
-
1
M
-
1
2
ψ
1
0
ψ
M
-
1
0
2
ψ
1
1
ψ
M
-
1
1
2
⋯
ψ
1
M
-
1
ψ
M
-
1
M
-
1
2
⋯
⋯
⋯
⋯
ψ
M
-
1
0
ψ
M
-
1
0
2
ψ
M
-
1
1
ψ
M
-
1
1
2
⋯
ψ
M
-
1
M
-
1
ψ
M
-
1
M
-
1
2
. The short-time Hermite transform (STHT) can be defined as a composition of Hermite transform matrices whose size is defined by the window width. Without loss of generality, we may assume the nonoverlapping unit rectangular windows (with the width of M samples). The total transform matrix for the STHT can be created as follows:(24)
W
=
I
L
/
M
⊗
H
M
=
H
M
0
⋯
0
0
H
M
⋯
0
⋯
⋯
⋯
0
0
0
⋯
H
M
,where I is identity matrix of size (L
/
M
×
L
/
M), 0 is M
×
M zero matrix, and L is the total length of the signal, while ⊗ denotes the Kronecker product. TheSTHT can be defined using transform matrix W as follows:(25)
S
T
H
T
=
W
f
=
W
Ψ
L
C
,where f is a time domain signal vector of size L
×
1 and C is a Hermite transform vector of size L
×
1, whileSTHT is a column vector containing all STHT vectors S
T
H
T
M
i
(
m
i
), i
=
0,1
,
…
,
P (P is the number of windows). Furthermore we may write(26)
S
T
H
T
=
A
C
, where A
=
W
Ψ
L is matrix of size L
×
L that maps the global transform domain information in C into local information in S
T
H
T. In the case of windows with variable length over time (time-varying windows), the smaller matrices within W will be of different sizes. Particularly, for a set of P rectangular windows of sizes M
1
,
M
2
,
…
,
M
P instead of H
M we will have H
M
1
,
H
M
2
,
…
,
H
M
P.In the context of compressive sensing, the STHT allows us to define two types of CS problem. A common CS problem is defined by assuming that the missing samples appear in the time domain, while the sparsity is exploited in the transform domain. However, the missing samples may also appear in the STHT domain, after applying certain filter forms such as theL-estimate filtering in the presence of strong noisy pulses. The two CS optimization problems are discussed in the sequel.(1) Assume that CS procedure is done in the time domain, such that the measurements are taken from each windowed signal part:y
i
=
f
M
i
(
Ω
). Based on the definitions given in Section 3, the minimization problem is given by(27)
min
⁡
C
i
l
1
subject to
y
i
=
Ψ
M
Ω
C
i
,for i
=
1,2
,
…
,
P, where P is the total number of windows, while Ψ
M is the inverse Hermite transform of size M
×
M, where only the rows corresponding to the set of positions Ω are kept.(2) Let us observe the missing values in the STHT domain, where the measurements vector is denoted byS
T
H
T
CS. The CS problem formulation is defined using the linear relationship (26). The CS matrix, denoted by A
CS, is formed by omitting the rows from A corresponding to the positions of missing values in S
T
H
T
CS. Then, a simple linear relationship can be established between the reduced observations in S
T
H
T
CS and the sparse Hermite transform vectorC (corresponding to the entire signal). Hence, the CS problem is given in the following form: (28)
m
i
n
C
1
subject to
S
T
H
T
CS
=
A
CS
C
.It means that the missing samples in the S
T
H
T can be reconstructed such as to provide the best concentrated C. The above CS optimization problem can be solved using various existing CS reconstruction algorithms.


### 4.2. Short-Time Combined Transform

On the basis of the STHT, we can also define the short-time combined transform as follows:(29)
X
=
Z
f
, where the transform matrix Z is made as a combination of Hermite transform matrices and other transforms: (30)
Z
=
Z
M
1
0
⋯
0
0
Z
M
2
⋯
0
⋯
⋯
⋯
0
0
0
⋯
Z
M
P
, where Z
M
i can be either the M
i
×
M
i Hermite transform or some other suitable transform matrix of the same size. For instance, we may observe one example of the combination of Hermite transform and Fourier transform as a special case:(31)
Z
=
H
M
0
⋯
0
0
F
M
⋯
0
⋯
⋯
F
M
0
0
0
⋯
H
M
. The combined matrix Z is thus composed of Hermite transform matrix H
M of size M
×
M, two sequential Fourier transform matrices F
M of size M
×
M, and again one Hermite transform matrix of the same size. In the case of windows with variable length over time, the short-time combined transform can be written as: (32)
X
M
1
X
M
2
⋯
X
M
P
=
Z
M
1
0
⋯
0
0
Z
M
2
⋯
0
⋯
⋯
⋯
0
0
0
⋯
Z
M
P
f
M
1
f
M
2
⋯
f
M
P
, where f
M
1 represents the vector containing first M
1 samples in f and vector f
M
2 contains the next M
2 samples from f, while f
M
P contains the last M
P samples from f such that M
1
+
M
2
+
⋯
+
M
P
=
L.We can again observe the set of measurements corresponding to different signal parts:y
i
=
f
M
i
(
Ω
), where Θ
M
i
=
i
n
v
Z
M
i. Therefore, the CS minimization problem is given by(33)
m
i
n
X
M
i
1
subject to
y
i
=
Θ
M
i
Ω
X
M
i
,for i
=
1,2
,
…
,
P, where Ω in superscript denotes that we use only the rows corresponding to available samples defined by the set Ω. The inverse transform denoted by Θ
M
i
Ω can be changed in each window depending on the signal characteristics.


## 4.1. Short-Time Hermite Transform

Let us assume thatN
=
M in (10) and define an M
×
M Hermite matrix:(23)
H
M
=
1
M
ψ
0
0
ψ
M
-
1
0
2
ψ
0
1
ψ
M
-
1
1
2
⋯
ψ
0
M
-
1
ψ
M
-
1
M
-
1
2
ψ
1
0
ψ
M
-
1
0
2
ψ
1
1
ψ
M
-
1
1
2
⋯
ψ
1
M
-
1
ψ
M
-
1
M
-
1
2
⋯
⋯
⋯
⋯
ψ
M
-
1
0
ψ
M
-
1
0
2
ψ
M
-
1
1
ψ
M
-
1
1
2
⋯
ψ
M
-
1
M
-
1
ψ
M
-
1
M
-
1
2
. The short-time Hermite transform (STHT) can be defined as a composition of Hermite transform matrices whose size is defined by the window width. Without loss of generality, we may assume the nonoverlapping unit rectangular windows (with the width of M samples). The total transform matrix for the STHT can be created as follows:(24)
W
=
I
L
/
M
⊗
H
M
=
H
M
0
⋯
0
0
H
M
⋯
0
⋯
⋯
⋯
0
0
0
⋯
H
M
,where I is identity matrix of size (L
/
M
×
L
/
M), 0 is M
×
M zero matrix, and L is the total length of the signal, while ⊗ denotes the Kronecker product. TheSTHT can be defined using transform matrix W as follows:(25)
S
T
H
T
=
W
f
=
W
Ψ
L
C
,where f is a time domain signal vector of size L
×
1 and C is a Hermite transform vector of size L
×
1, whileSTHT is a column vector containing all STHT vectors S
T
H
T
M
i
(
m
i
), i
=
0,1
,
…
,
P (P is the number of windows). Furthermore we may write(26)
S
T
H
T
=
A
C
, where A
=
W
Ψ
L is matrix of size L
×
L that maps the global transform domain information in C into local information in S
T
H
T. In the case of windows with variable length over time (time-varying windows), the smaller matrices within W will be of different sizes. Particularly, for a set of P rectangular windows of sizes M
1
,
M
2
,
…
,
M
P instead of H
M we will have H
M
1
,
H
M
2
,
…
,
H
M
P.In the context of compressive sensing, the STHT allows us to define two types of CS problem. A common CS problem is defined by assuming that the missing samples appear in the time domain, while the sparsity is exploited in the transform domain. However, the missing samples may also appear in the STHT domain, after applying certain filter forms such as theL-estimate filtering in the presence of strong noisy pulses. The two CS optimization problems are discussed in the sequel.(1) Assume that CS procedure is done in the time domain, such that the measurements are taken from each windowed signal part:y
i
=
f
M
i
(
Ω
). Based on the definitions given in Section 3, the minimization problem is given by(27)
min
⁡
C
i
l
1
subject to
y
i
=
Ψ
M
Ω
C
i
,for i
=
1,2
,
…
,
P, where P is the total number of windows, while Ψ
M is the inverse Hermite transform of size M
×
M, where only the rows corresponding to the set of positions Ω are kept.(2) Let us observe the missing values in the STHT domain, where the measurements vector is denoted byS
T
H
T
CS. The CS problem formulation is defined using the linear relationship (26). The CS matrix, denoted by A
CS, is formed by omitting the rows from A corresponding to the positions of missing values in S
T
H
T
CS. Then, a simple linear relationship can be established between the reduced observations in S
T
H
T
CS and the sparse Hermite transform vectorC (corresponding to the entire signal). Hence, the CS problem is given in the following form: (28)
m
i
n
C
1
subject to
S
T
H
T
CS
=
A
CS
C
.It means that the missing samples in the S
T
H
T can be reconstructed such as to provide the best concentrated C. The above CS optimization problem can be solved using various existing CS reconstruction algorithms.


## 4.2. Short-Time Combined Transform

On the basis of the STHT, we can also define the short-time combined transform as follows:(29)
X
=
Z
f
, where the transform matrix Z is made as a combination of Hermite transform matrices and other transforms: (30)
Z
=
Z
M
1
0
⋯
0
0
Z
M
2
⋯
0
⋯
⋯
⋯
0
0
0
⋯
Z
M
P
, where Z
M
i can be either the M
i
×
M
i Hermite transform or some other suitable transform matrix of the same size. For instance, we may observe one example of the combination of Hermite transform and Fourier transform as a special case:(31)
Z
=
H
M
0
⋯
0
0
F
M
⋯
0
⋯
⋯
F
M
0
0
0
⋯
H
M
. The combined matrix Z is thus composed of Hermite transform matrix H
M of size M
×
M, two sequential Fourier transform matrices F
M of size M
×
M, and again one Hermite transform matrix of the same size. In the case of windows with variable length over time, the short-time combined transform can be written as: (32)
X
M
1
X
M
2
⋯
X
M
P
=
Z
M
1
0
⋯
0
0
Z
M
2
⋯
0
⋯
⋯
⋯
0
0
0
⋯
Z
M
P
f
M
1
f
M
2
⋯
f
M
P
, where f
M
1 represents the vector containing first M
1 samples in f and vector f
M
2 contains the next M
2 samples from f, while f
M
P contains the last M
P samples from f such that M
1
+
M
2
+
⋯
+
M
P
=
L.We can again observe the set of measurements corresponding to different signal parts:y
i
=
f
M
i
(
Ω
), where Θ
M
i
=
i
n
v
Z
M
i. Therefore, the CS minimization problem is given by(33)
m
i
n
X
M
i
1
subject to
y
i
=
Θ
M
i
Ω
X
M
i
,for i
=
1,2
,
…
,
P, where Ω in superscript denotes that we use only the rows corresponding to available samples defined by the set Ω. The inverse transform denoted by Θ
M
i
Ω can be changed in each window depending on the signal characteristics.


## 5. Experimental Evaluation

Example 1.
In order to illustrate efficiency of the proposed method, let us observe a signal that is sparse in the Hermite transform domain. The time domain signal is shown in Figure2(a). The Hermite transform of the observed signal consists of ten components with unit amplitudes, as shown in Figure 2(b). The available number of samples is 60% of the total signal length, while the maximal order of Hermite functions used in the expansion is limited to N
=
60.
After calculating the initial Hermite transform using available signal samples, the threshold is applied to select signal support in the Hermite domain. The threshold is set empirically toT
=
α
max
⁡
{
C
}, α
=
0.4, after performing a large number of experiments. Moreover, the results are not very sensitive on threshold settings, and even lower thresholds (e.g., α
=
0.3, α
=
0.2) can be used, because all additional (false) components selected by such a threshold would obtain their true zero values afterwards. The suitable threshold can be even theoretically derived (under certain assumptions). Namely, the effects caused by missing samples in time domain can be modeled by the noise in the Hermite transform domain. The noise can be described using two random variables: the first one corresponds to the noise appearing at nonsignal components (noise alone), while the second one corresponds to the noise appearing at the signal components positions. The two random variables can be described by the corresponding mean values and variances that could be further employed to define the threshold level. Namely, with certain probability, we may define the threshold value that is just above the level of noise components. Consequently, such a threshold would select only the signal components determining the signal support used in the reconstruction procedure. Since the threshold derivation would require significant space and analyses, it could be a topic of some further work.
The selected components in the Hermite transform domain are shown in Figure3. Using the detected positions of components, the exact values of Hermite coefficients are calculated according to (20) (Figure 3). The reconstructed signal and the absolute error between original and reconstructed signal are shown in Figures 4(a) and 4(b), respectively. For the comparison, the reconstruction based on the Fourier transform is considered. However, it is shown that the Fourier transform based reconstruction cannot be used in this case, because it produces a significant error (Figure 4(c), 10 largest Fourier transform components are used for reconstruction). The reason is in the fact that the signals that are sparse in Hermite transform domain do not exhibit sparsity in the Fourier transform domain (or some other transform domains). This means that the exact results, in this case, can be obtained only using the Hermite transform providing the sparse signal representation. Similar conclusion holds for other transform domains where the signal is not sparse (Fractional Fourier, Wavelet, etc.).Figure 2
The original signal: (a) time domain representation, (b) Hermite transform of signal calculated usingN
=
60 Hermite functions.
(a)
(b)Figure 3
Hermite coefficients of signal with missing samples -○, and the reconstructed Hermite coefficients -×.Figure 4
The reconstructed signal: (a) time domain representation, (b) the absolute error between original and reconstructed signal, (c) for comparison: reconstructed signal based on the Fourier transform reconstruction approach (-°) and the corresponding error (solid line).
(a)
(b)
(c)Example 2.
In this example we have observed different sparse signals (having 10 components) in the Hermite domain through the 1000 repetitions of the previously described procedure. The aim is to test how the accuracy of the proposed method changes for different number of missing samples. Namely, the number of missing samples was increased in steps of 10% starting from zero up to 80% of missing samples. For each instance on they-axes, we performed 1000 iterations with different 10-component signals, and the mean square errors between original and reconstructed signals are calculated and shown in Figure 5(a). We can observe that, up to 70% of missing samples, the MSE is still low, but it starts to increase significantly afterwards (for values higher than 70%). This means that the reliable reconstruction cannot be guaranteed for such a large number of missing samples (such as 80% of missing samples).
Additionally, the proposed approach is tested in the presence of external additive Gaussian noise. Namely, the MSE is calculated for different values of SNR (for each SNR, we assume 1000 realizations of random noise). The results are presented in Figure5(b), showing that the proposed approach can be efficiently used for SNR > 8 dB. For SNR < 8 dB the MSE starts to increase rapidly.Figure 5
(a) MSE calculated for 1000 realizations and for different number of missing samples, (b) MSE calculated for different values of SNR in 1000 realizations of external noise.
(a)
(b)Example 3.
This example illustrates the concept of combined Hermite-Fourier transform and CS reconstruction. Observe the signal with the total length ofL
=
32 samples composed of two parts: first part exhibits sparsity in the Hermite transform domain with K
=
2 components (HT components) at positions 7 and 12 with amplitudes 0.8 and 0.65; second part exhibits sparsity in the Fourier transform domain with K
=
2 components (FT components) at positions −3 and 4 with amplitudes 1 and 0.8, respectively. Now consider the compressive sensing scenario with only 50% of samples available (original full length signal and available measurements are shown in Figure 6). The original short-time combined transform obtained using windows width equal to 16 samples is shown in Figure 7(a), where the white fields represent 0 value. Thus, the signal represented by a full set of samples is sparse meaning that it is fully concentrated on a few nonzero components. In the case when we deal with 50% of missing samples, the corresponding short-time combined transform is shown in Figure 7(b). Note that in this case the sparsity is disturbed due to the missing samples. Instead of zero values at nonsignal position, the noise appears as a consequence of missing samples.Figure 6
Missing samples and available measurements in time domain.Figure 7
(a) Original short-time combined transform of full length signal (FT: Fourier transform, HT: Hermite transform), (b) short-time combined transform of available measurements.
(a)
(b)The threshold based components selection and signal reconstruction (in analogy to (18) and (20)) is applied to both parts of the signal, FT components, and HT components (Figures 8(a) and 8(b), resp.). Based on the identified positions of components, the exact signal reconstruction is done using the procedure presented in Section 3. The reconstructed signal components are shown in Figure 9.Figure 8
Selecting the components of interest by applying threshold to the following: (a) FT components and (b) HT components.
(a)
(b)Figure 9
Reconstructed signal components.


## 6. Conclusion

The possibility of using the Hermite transform in compressive sensing applications was explored in this work. The compressive sensing setup and signal reconstruction approach in the Hermite transform domain were defined. A simple and fast procedure for the total reconstruction of signals using selected Hermite transform coefficients provides the results very close to the original signal even when we deal with significant missing information. It is important to emphasize that the proposed concept in the Hermite transform domain can be also combined with other known compressive sensing solvers. The entire concept is generalized and extended by defining the short-time Hermite transform as well as the short-time combined transform. These two transforms open more possibilities to apply the compressive sensing approach in different scenarios.



---

*Source: 286590-2015-12-10.xml*