Next Article in Journal
Longitudinal–Torsional Frequency Coupling Design of Novel Ultrasonic Horns for Giant Magnetostrictive Transducers
Previous Article in Journal
Target Recognition Based on Infrared and Visible Image Fusion and Improved YOLOv8 Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Communication

Signal Separation Operator Based on Wavelet Transform for Non-Stationary Signal Decomposition

1
School of Mathematical Sciences, Tiangong University, Tianjin 300387, China
2
Geogia Tech Shenzhen Institute, Tianjin University, Shenzhen 518055, China
*
Author to whom correspondence should be addressed.
Sensors 2024, 24(18), 6026; https://doi.org/10.3390/s24186026
Submission received: 29 August 2024 / Revised: 15 September 2024 / Accepted: 16 September 2024 / Published: 18 September 2024

Abstract

:
This paper develops a new frame for non-stationary signal separation, which is a combination of wavelet transform, clustering strategy and local maximum approximation. We provide a rigorous mathematical theoretical analysis and prove that the proposed algorithm can estimate instantaneous frequencies and sub-signal modes from a blind source signal. The error bounds for instantaneous frequency estimation and sub-signal recovery are provided. Numerical experiments on synthetic and real data demonstrate the effectiveness and efficiency of the proposed algorithm. Our method based on wavelet transform can be extended to other time–frequency transforms, which provides a new perspective of time–frequency analysis tools in solving the non-stationary signal separation problem.

1. Introduction

Many signals that occur in a wide range of engineering and scientific fields, such as remote sensing signals, mobile communication, sensor arrays, radar systems, are composed of nonlinear and non-stationary components. Decomposition of such signals and efficient extraction of information from individual components including frequencies, amplitudes and waveforms will be useful to identify and quantify the underlying multicomponent signal. In the last few decades, many decomposition methods have been developed to deal with nonlinear and non-stationary systems in time, frequency or time–frequency domains. In this paper, we model a non-stationary signal by
f ( t ) = k = 1 K A k ( t ) cos ( 2 π ϕ k ( t ) ) ,
where the phase functions ϕ k ( t ) are differentiable, and the amplitude functions A k ( t ) are non-negative and continuous.
The empirical mode decomposition (EMD) proposed in [1] is an iterative algorithm that decomposes the given non-stationary signal into a sum of intrinsic mode functions (IMFs) with a minimally oscillatory function, called trend, as the remainder and computes the instantaneous frequency on a time interval of each IMF by applying the Hilbert transform.
Although more subsequent studies, like [2,3,4,5,6,7,8], have been proposed to improve and extend EMD, there is no rigorous mathematical analysis at this moment. Inspired by EMD and compressed sensing theory, the authors in [9] introduce a nonlinear matching pursuit method (NMP) to find the sparsest representation of a signal over the possible largest dictionary, consisting of intrinsic mode functions with the form { a ( t ) cos ( θ ( t ) ) } . As an EMD-like tool, the empirical wavelet transform [10] decomposes a given signal into different modes by designing an adaptive wavelet basis. Additionally, variational model decomposition [11] is proposed to decompose a signal into its principal modes with specific sparsity properties. Note that variational model decomposition is based on the assumption of narrow-band characteristics; an alternative algorithm named variational nonlinear chirp mode decomposition [12] is developed to concurrently extract all modes. The other similar strategy is adaptive local iterative filtering [13,14], which employs an adaptive iterative filtering to decompose nonlinear and non-stationary signals. To deal with oscillatory signals composed of different modes with fast-varying instantaneous frequencies, a convex optimization [15] is proposed to achieve the decomposition.
The reassignment method [16,17,18,19,20] and the synchrosqueezing transform (SST) [21,22] (a special reassignment technique) are other well-known time–frequency analysis tools. The mathematical theory of SST based on continuous wavelet transform (CWTSST) is presented in [22]. The main idea of SST is to concentrate the time–frequency representation into the frequency re-assignment reference. In this way, it will sharpen the time–frequency representation and decrease smearing while still reconstructing different signal components. As powerful tools for the mode retrieval, SST can be extended to other time–frequency representations, such as wavelet packet transform [23], curvelet transform [24], S-transform [25] and short-time Fourier transform [26,27]. The stability and theoretical properties of SST have been studied extensively [28,29,30,31]. For obtaining a more accurate estimate of instantaneous frequencies than the original SST, two-order or high-order adaptive SST [32,33,34,35,36,37,38] have been put forward to achieve mode retrieval results with a high accuracy.
Recently, an effective non-stationary signal separation method based on discrete modulated short-time Fourier transform was introduced in [39]. The procedure is first to remove (or extract) the polynomial trend from the blind source signal. The second step is to apply the signal separation operator to some discrete samples in the fixed time and extract different modes and instantaneous frequencies via finding the maximum over the frequency domain. In this regard, a family of minimum-supported cardinal spline-wavelets is introduced and developed in [40]. Unfortunately, its rigorous mathematical theoretical analysis of the error bounds for instantaneous frequency estimation and sub-signal recovery is still an open problem. It is important to point out that the objective of [40] is the implementation of non-stationary signal separation by a special wavelet. The extension of non-stationary signal separation to generalized continuous wavelet transform, (CWT) along with rigorous mathematical theoretical analysis, deserves further study.
To solve this problem, in this paper, we introduce a direct, local and mathematical rigorous non-stationary signal separation operator based on wavelet transform (CWTSSO) for analyzing and decomposing non-stationary data. Considering a general adaptive harmonic model
f ( t ) = k = 1 K A k ( t ) e i 2 π ϕ k ( t ) ,
where the phase functions ϕ k ( t ) are differential, and the amplitude functions A k ( t ) are non-negative and continuous. Observe that the non-stationary signal model (1) can be regarded as the real part of adaptive harmonic model. Let ψ α be a continuous wavelet and f ( t ) be a given signal. The CWT of f ( t ) is defined by
( W ψ α f ) ( t , a ) = 1 a + ψ α ( x t a ) f ( x ) d x ,
where ψ α ( x ) = α ψ ( α x ) and the parameter α controls the width of the wavelet. Then, ( W ψ α f ) ( t , a ) can be used directly to extract all instantaneous frequencies and reconstruct all modes by achieving energy-concentrated clusters with an approximate threshold and finding the maximum over scales for each cluster. The superiority of CWTSSO is a more simple and direct decomposition method that reconstructs all instantaneous frequencies and modes simultaneously. It is different from CWTSST [22], which is to first compute a reference frequency value from CWT of the given signal and then to apply this value for SST to further obtain estimates of all instantaneous frequencies and modes. Compared with CWTSST, CWTSSO does not require the synchrosqueezing transform to compute reference frequencies as required by CWTSST. Hence, the CWTSSO provides superior efficiency against the CWTSST, as illustrated in numerical experiments (see Table 1 in Section 3). It should be pointed out that the proposed time–frequency analysis tool can be extended to other time–frequency transforms, e.g., wavelet packet transform, curvelet transform, S-transform, short-time Fourier transform, etc. This paper provides a new perspective of time–frequency analysis tools in solving the non-stationary signal separation problem.

2. Main Result

To facilitate the proof of the main result to be stated and established in this section, we consider a class of wavelet functions with certain conditions on the amplitude and phase functions that allow us to separate signal components, to compute instantaneous frequencies (IFs) and to obtain both instantaneous amplitudes (IAs) and signal components.
Definition 1. 
Let A α denote the set consisting of general adaptive harmonic models defined by
f ( t ) = = 1 K f ( t ) = = 1 K A ( t ) e i 2 π ϕ ( t )
with
M = M ( t ) : = = 1 K | A ( t ) | , μ = μ ( t ) : = min 1 K | A ( t ) | , B = B ( t ) : = max 1 K | ϕ ( t ) | , ν = ν ( t ) : = min 1 K | ϕ ( t ) | ,
and there exists α = α ( t ) > 0 , such that
| A ( t + u ) A ( t ) | α 2 | u | | A ( t ) | , | ϕ ( t + u ) ϕ ( t ) | α 3 | u | | ϕ ( t ) | , = 1 , , K .
In addition, we assume that the IFs satisfy
min 1 k K | 1 ϕ ( t ) 1 ϕ k ( t ) | = : η ( t ) = η > 0 .
The main result of this paper is as follows:
Theorem 1. 
Let f ( t ) A α for some α > 0 . Let ψ be a wavelet such that its Fourier transform ψ ^ is supported in [ κ / α Δ , κ / α + Δ ] and ρ = max | ψ ^ ( · ) | = | ψ ^ ( κ / α ) | . Consider the continuous wavelet transform ( W ψ α f ) ( t , a ) , as defined in (3), with the set
S = S ( t ) : = { a = a ( t ) : | ( W ψ α f ) ( t , a ) | μ ρ 2 }
and
α < min { η κ υ 2 Δ , ρ μ 2 a M I 1 + 2 π M B I 2 a 2 , ρ μ ν 2 4 ( ν κ M I 1 + 2 π M B I 2 κ 2 ) } ,
where a S . The following statements hold:
(a) 
The set S can be expressed as a disjoint union of exactly K non-empty sets, i.e.,
S = S ( t ) : = { a S ( t ) : | a κ ϕ ( t ) | Δ α ν } , = 1 , , K .
(b) 
Let
a ˇ = a ˇ ( t ) : = arg max a S | ( W ψ α f ) ( t , a ) | , = 1 , , K ,
then
| | ( W ψ α f ) ( t , a ˇ ) | / ρ | A ( t ) | | α 3 2 π M B I 2 Δ 2 / ( ρ ν 2 ) + α 2 4 π M B I 2 Δ κ / ρ ν 2 + M I 1 Δ / ρ ν + α M I 1 κ / ρ ν + 2 π M B I 2 κ 2 / ρ ν 2 ,
| a ˇ κ ϕ ( t ) | = α o ( 1 ) ,
and
| ( W ψ α f ) ( t , a ˇ ) / ρ A ( t ) e i 2 π ϕ ( t ) | α 3 2 π M B I 2 Δ 2 / ( ρ ν 2 ) + α 2 4 π M B I 2 Δ κ / ρ ν 2 + M I 1 Δ / ρ ν + α ( M I 1 κ / ρ ν + 2 π M B I 2 κ 2 / ρ ν 2 + 2 π M B I 0 o ( 1 ) / ρ )
as α 0 + .
Before proceeding to the theoretical proof, we would like to explain the implementation of the proposed method by a numerical example. To illustrate the process, we consider the following multicomponent signal,
f ( t ) = f 1 ( t ) + f 2 ( t ) , 0 t 30 , f 1 ( t ) = ( t / 10 + 2 ) cos 2 π ( 3 t + t 2 / 50 ) , f 2 ( t ) = exp ( t 2 / 450 t / 15 + 1 ) cos 2 π ( 2 t + cos ( t ) / 10 ) ,
as shown in Figure 1a. This experiment is carried out using Morlet wavelet, defined by
ψ ^ ( ξ ) = k 0 σ 2 π e 1 2 σ 2 ( κ ξ ) 2 e 1 2 σ 2 ( κ 2 + ξ 2 ) ,
where k 0 is a constant, and κ and σ are wavelet parameters. With discrete grids of scales, the first step is to apply discrete wavelet transform to uniform or nonuniform samples f ( t n ) , n = 1 , 2 , , N , where N is the number of samples and { t n } denotes uniform or nonuniform sampling points. As shown in the time-scale spectrogram | ( W ψ f ) ( t , a ) | (see Figure 1b), we can obtain two narrow bands (clusters) after thresholding. The second step is to find two extrema scale curves a ˇ ( t ) ( = 1 , 2 ) in the narrow bands, as shown in Figure 1c. The third step is to compute instantaneous frequencies and signal components: ϕ ( t ) = κ / a ˇ ( t ) , f ( t ) = 2 R e[ ( W ψ f ) ( t , a ˇ ) / ρ ] , where R e denotes taking the real part of a complex number. Figure 1d–f show reconstructed results of instantaneous frequencies and sub-signals. The pseudo-code of our method can be found in Algorithm 1.
Algorithm 1: CWTSSO for non-stationary signal decomposition
  • Input: signal f ( t ) , μ (a small thresholding parameter).
  • Calulate CWT of f ( t ) to obtain ( W ψ f ) ( t , a ) .
  • For each t, cluster | ( W ψ f ) ( t , a ) | > μ 2 to obtain precisely K clusters S ( t ) , = 1 , , K .
  • Extrema estimation a ˇ ( t ) = arg max a S ( t ) | ( W ψ f ) ( t , a ) | .
  • Output: Recovered frequencies ϕ ( t ) = κ / a ˇ ( t ) ,
                        recovered modes f ( t ) = 2 R e[ ( W ψ f ) ( t , a ˇ ) / ρ ] .
We then present the proof of Theorem 1. In this proof, let
( Q ψ α f ) ( t , a ) = = 1 K A ( t ) e i 2 π ϕ ( t ) ψ ^ α ( a ϕ ( t ) ) .
Lemma 1. 
For f ( t ) A α , let ( W ψ α f ) ( t , a ) be its continuous wavelet transform and ( Q ψ α f ) ( t , a ) be the approximation of ( W ψ α f ) ( t , a ) defined by (13), then
| ( W ψ α f ) ( t , a ) ( Q ψ α f ) ( t , a ) | a M I 1 α + 2 π M B I 2 a 2 α .
Using the fact that
( Q ψ α f ) ( t , a ) = = 1 K A ( t ) e i 2 π ϕ ( t ) ψ ^ α ( a ϕ ( t ) ) = = 1 K A ( t ) e i 2 π ϕ ( t ) α a ψ ( α ( x t ) a ) e i 2 π ( x t ) ϕ ( t ) d x ,
together with (5) and (6), we have
| ( W ψ α f ) ( t , a ) ( Q ψ α f ) ( t , a ) | = 1 K α a ψ ( α ( x t ) a ) | A ( x ) A ( t ) | e i 2 π ϕ ( x ) d x + = 1 K A ( t ) | e i 2 π ϕ ( x ) e i 2 π ϕ ( t ) e i 2 π ( x t ) ϕ ( t ) | α a ψ ( α ( x t ) a ) d x = 1 K α a ψ ( α ( x t ) a ) α 2 | A ( t ) | | x t | d x + = 1 K A ( t ) 2 π | ϕ ( x ) ϕ ( t ) ( x t ) ϕ ( t ) | α a ψ ( α ( x t ) a ) d x a M I 1 α + = 1 K A ( t ) 2 π | ( x t ) | | ϕ ( t ) ϕ ( ζ ) | α a ψ ( α ( x t ) a ) d x a M I 1 α + = 1 K A ( t ) 2 π | ( x t ) | 2 α 3 | ϕ ( t ) | α a ψ ( α ( x t ) a ) d x a M I 1 α + 2 π M B I 2 a 2 α ,
where I n = | x | n | ψ ( x ) | d x .
Lemma 2. 
For f ( t ) A α , let ( Q ψ α f ) ( t , a ) be defined in (13), then
| ( Q ψ α f ) ( t , a ) A k ( t ) e i 2 π ϕ k ( t ) ψ ^ α ( a ϕ k ( t ) ) | = 0 , a S k ( t ) ,
| ( Q ψ α f ) ( t , κ ϕ k ( t ) ) ρ A k ( t ) e i 2 π ϕ k ( t ) | = 0 .
Proof. 
Since ψ α ( t ) = α ψ ( α t ) and supp ( ψ ^ ) [ κ / α Δ , κ / α + Δ ] , we have supp ( ψ ^ α ) [ κ Δ α , κ + Δ α ] . Indeed,
| ( Q ψ α f ) ( t , a ) A k ( t ) e i 2 π ϕ k ( t ) ψ ^ α ( a ϕ k ( t ) ) | = | k K A ( t ) e i 2 π ϕ ( t ) ψ ^ α ( a ϕ ( t ) | ,
together with (7) and (8) and the definition of S ( t ) (9), the proof of (17) is straightforward. With ρ = ψ ^ α ( κ ) , taking a = κ ϕ k ( t ) in (17), we have (18) □
Proof of Theorem 1 (a). 
Let a S , i.e., | ( W ψ α f ) ( t , a ) | ρ μ 2 . Suppose a S for any , then
| a κ ϕ ( t ) | > α Δ ν , = 1 , , K .
Since supp ( ψ ^ α ) [ κ Δ α , κ + Δ α ] , we derive that
| ( Q ψ α f ) ( t , a ) | = | = 1 K A ( t ) e i 2 π ϕ ( t ) ψ ^ α ( a ϕ ( t ) ) | = 0 .
Furthermore,
| ( W ψ α f ) ( t , a ) | | ( W ψ α f ) ( t , a ) ( Q ψ α f ) ( t , a ) | + | ( Q ψ α f ) ( t , a ) | a M I 1 α + 2 π M B I 2 a 2 α ρ μ 2 .
The last inequality follows (8) for α . This contradicts the condition that | ( W ψ α f ) ( t , a ) | ρ μ 2 . Consequently, there exists at least one , 1 K , such that a S . Since | a κ ϕ ( t ) | α Δ ν and min 1 k K | 1 ϕ ( t ) 1 ϕ k ( t ) | = η > 2 Δ α κ ν , is unique, i.e., S ( 1 K ) are disjoint. Then, we show that each S is non-empty. To this regard, we prove that κ ϕ ( t ) S . Indeed, according to (18), we have
| ( Q ψ α f ) ( t , κ ϕ ( t ) | = | ρ A ( t ) | ρ μ > 3 μ ρ 4 .
It implies
| ( W ψ α f ) ( t , κ ϕ ( t ) | | ( Q ψ α f ) ( t , κ ϕ ( t ) ) | | ( W ψ α f ) ( t , κ ϕ ( t ) ) ( Q ψ α f ) ( t , κ ϕ ( t ) ) | > 3 μ ρ 4 α κ M I 1 / ϕ ( t ) + 2 π M B I 2 κ 2 / ϕ ( t ) 2 > 3 μ ρ 4 α ( κ M I 1 / ν + 2 π M B I 2 κ 2 / ν 2 ) > 3 μ ρ 4 μ ρ 4 = μ ρ 2 .
Hence, κ ϕ ( t ) S .
Proof of (10). 
By the definition of a ˇ , we have
| ( W ψ α f ) ( t , a ˇ ) | | ( W ψ α f ) ( t , κ ϕ ( t ) | | ( Q ψ α f ) ( t , κ ϕ ( t ) ) | α κ M I 1 / ( ϕ ( t ) ) + 2 π M B I 2 κ 2 / ( ϕ ( t ) ) 2 = ρ | A ( t ) | α κ M I 1 / ϕ ( t ) + 2 π M B I 2 κ 2 / ( ϕ ( t ) ) 2 ρ | A ( t ) | α κ M I 1 / ν + 2 π M B I 2 κ 2 / ν 2 .
On the other hand, by (14), we have
| ( W ψ α f ) ( t , a ˇ ) | | ( Q ψ α f ) ( t , a ˇ ) | + α ( a ˇ M I 1 + 2 π M B I 2 a ˇ 2 ) = | A ( t ) e i 2 π ϕ ( t ) ψ ^ α ( a ˇ ϕ ( t ) ) | + α ( a ˇ M I 1 + 2 π M B I 2 a ˇ 2 ) ρ | A ( t ) | + α α Δ / ν + κ / ϕ ( t ) M I 1 + 2 π M B I 2 α Δ / ν + κ / ϕ ( t ) 2 ( by | a ˇ κ ϕ ( t ) | α Δ ν ) ρ | A ( t ) | + α 3 2 π M B I 2 Δ 2 / ν 2 + α 2 4 π M B I 2 Δ κ / ν 2 + M I 1 Δ / ν + α M I 1 κ / ν + 2 π M B I 2 κ 2 / ν 2 ,
where the last inequality follows from (5). Combining (19) and (20) yields (10).
Proof of (11). 
Let ( W ψ α f ) ( t , a ˇ ) = | ( W ψ α f ) ( t , a ˇ ) | e i 2 π θ ( t ) for some real valued function θ ( t ) . Note that for any complex number z 1 , z 2 , | | z 1 | | z 2 | | | z 1 z 2 | , we deduce that
A ( t ) | ψ ^ α ( a ˇ ϕ k ( t ) ) ρ | A ( t ) | ψ ^ α ( a ˇ ϕ ( t ) ) e i 2 π ϕ ( t ) ρ e i 2 π θ ( t ) | = | ψ ^ α ( a ˇ ϕ ( t ) ) A ( t ) e i 2 π ϕ ( t ) ρ A ( t ) e i 2 π θ ( t ) | | ψ ^ α ( a ˇ ϕ ( t ) ) A ( t ) e i 2 π ϕ ( t ) ( W ψ α f ) ( t , a ˇ ) | + | ( W ψ α f ) ( t , a ˇ ) ρ A ( t ) e i 2 π θ ( t ) | | ψ ^ α ( a ˇ ϕ ( t ) ) A ( t ) e i 2 π ϕ ( t ) ( Q ψ α f ) ( t , a ˇ ) | + | ( Q ψ α f ) ( t , a ˇ ) ( W ψ α f ) ( t , a ˇ ) | + | | ( W ψ α f ) ( t , a ˇ ) | ρ A ( t ) | a ˇ M I 1 α + 2 π M B I 2 a ˇ 2 α + α 3 2 π M B I 2 Δ 2 / ν 2 + α 2 4 π M B I 2 Δ κ / ν 2 + M I 1 Δ / ν + α M I 1 κ / ν + 2 π M B I 2 κ 2 / ν 2 α 3 4 π M B I 2 Δ 2 / ν 2 + α 2 8 π M B I 2 Δ κ / ν 2 + 2 M I 1 Δ / ν + α 2 M I 1 κ / ν + 4 π M B I 2 κ 2 / ν 2 ,
where the second last inequality follows from (17), (14) and (10), and the last inequality uses the fact a ˇ κ / ν + Δ α / ν . With ψ ^ α ( a ˇ ϕ ( t ) ) = ψ ^ ( a ˇ ϕ ( t ) α ) and ρ = ψ ^ ( κ α ) , for sufficiently small α , (11) holds by the property of continuity of ψ ^ . □
Proof of (12). 
By (14), (15) and (17), we have
| ( W ψ α f ) ( t , a ˇ ) ρ f ( t ) | | ( W ψ α f ) ( t , a ˇ ) ( Q ψ α f ) ( t , a ˇ ) | + | ( Q ψ α f ) ( t , a ˇ ) ( Q ψ α f ) ( t , κ ϕ ( t ) ) | + | ( Q ψ α f ) ( t , κ ϕ ( t ) ) ρ f ( t ) | a ˇ M I 1 α + 2 π M B I 2 a ˇ 2 α + | = 1 K A ( t ) e i 2 π ϕ ( t ) | | ψ ^ α a ˇ ϕ ( t ) ψ ^ α ( κ ) | α 3 2 π M B I 2 Δ 2 / ν 2 + α 2 4 π M B I 2 Δ κ / ν 2 + M I 1 Δ / ν + α M I 1 κ / ν + 2 π M B I 2 κ 2 / ν 2 + M α | φ ( α x ) | | e i 2 π a ˇ ϕ ( t ) e i 2 π κ | d x α 3 2 π M B I 2 Δ 2 / ν 2 + α 2 4 π M B I 2 Δ κ / ν 2 + M I 1 Δ / ν + α M I 1 κ / ν + 2 π M B I 2 κ 2 / ν 2 + 2 π M B I 0 α o ( 1 ) .
Using the fact | e i u e i u | | u v | , together with (11) and (5), we obtain the last inequality.

3. Experimentation and Examples

In this section, we demonstrate the effectiveness of CWTSSO by solving the inverse problem of recovering IFs and IMFs on several examples. First, we will present three artificial signals in synthetic experiments. In each synthetic experiment, we consider white noise with zero mean and variance σ 2 . The Signal-to-Noise Ratio (SNR) is defined by
SNR [ dB ] = 10 log 10 var ( f ) σ 2 .
The running time (as shown in Table 1) and the mean square error (MSE) are used as performance measures. The MSE is defined as follows
MSE = f f ˜ 2 2 / f 2 2 ,
where f is the original signal and f ˜ denotes the recovered signal. Since the choice of noise is random, we repeat each experiment 500 times. The accuracy of the reconstructed IMFs is measured by the normalized mean square error (NMSE), calculated by averaging the MSE of 500 independent trials. Then, we shift our attention to real data, i.e., a bat echolocation signal. The overall performances of CWTSSO are compared with CWTSST in terms of execution time and NMSE.
We must comment that the comparisons are far from complete. High-order synchrosqueezing transforms are not included because those high-order synchrosqueezing transforms are designed to achieve perfect performance for strongly amplitude-modulated and frequency-modulated (AM–FM) modes. However, in this paper, we focus on general signals with the modest frequency modulation hypothesis for the IMFs constituting the blind source signal. In fact, our method can also be extended to signals with strongly modulated modes using adaptive continuous wavelet transform with time-varying parameters [38].
Example 1 (see Figure 2). 
In the first example, we consider a blind source signal
f a ( t ) = f a , 1 ( t ) + f a , 2 ( t ) ,
with an unknown number K = 2 of unknown sub-signals
f a , 1 ( t ) = t / 10 + 13 / 10 cos 2 π 7 t / 2 + sin t / 2 / 5 0 < t < 30 , f a , 2 ( t ) = exp 1 t / 30 2 + t / 30 3 cos 2 π 2 t + t 2 / 100 0 < t < 30 .
f a ( t ) is sampled uniformly with 512 sample points. In Figure 2, we plot the original signal f a ( t ) and the observed signal (SNR = 20 dB), together with the reconstructed results of sub-signals by CWTSST and CWTSSO. The comparisons of NMSE of recovered sub-signals show that CWTSSO delivers better performance than CWTSST. It also can be seen that the differences between the recovered frequencies and the truth by CWTSSO are smaller than ones by CWTSST. In estimating the running time, CWTSST takes much time since it needs to calculate synchrosqueezed transform and CWTSSO provides a better speed performance than CWTSST.
Figure 2. (a) Blind−source signal f a ( t ) . (b) The observed signal f a ( t ) with additive noise (SNR = 20). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Figure 2. (a) Blind−source signal f a ( t ) . (b) The observed signal f a ( t ) with additive noise (SNR = 20). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Sensors 24 06026 g002
Example 2 (see Figure 3). 
Next, we consider a challenging example, defined by
f b ( t ) = f b , 1 ( t ) + f b , 2 ( t ) + f b , 3 ( t ) ,
where
f b , 1 ( t ) = ( 2 t 2 / 5 2 t / 5 + 1 / 2 ) cos ( 2 π ( 50 t + 2 cos ( 4 π t ) ) ) , 0 < t < 1 / 2 , f b , 2 ( t ) = ( t / 20 + 9 / 20 ) cos ( 2 π ( 10 t + 2 t 2 ) ) , 0 < t < 1 / 2 , f b , 3 ( t ) = ( 1 / 2 ) exp ( ( t 1 / 2 ) 2 / 50 ) cos ( 2 π ( 150 t + 2 cos ( 4 π t ) ) ) , 1 / 4 < t < 1 ,
And add a noise with SNR = 15 dB to this signal. In Figure 3a,b, we display the blind source signal f b ( t ) and the observed signal with additive noise (SNR = 15). In this experiment, the sampling rate is 512 Hz. The results of the recovered sub-signals together with the recovery accuracy for both CWTSST and CWTSSO are depicted in Figure 3d,e. While the waveforms can be successfully recovered by CWTSST and CWTSSO, CWTSSO achieves a more accurate reconstruction. It can be verified by recovered frequencies, as shown in Figure 3f. Referring to running time, CWTSSO is more than seven orders-of-magnitude faster than that of CWTSST. This experiment suggests that CWTSSO has an obvious advantageous ability of efficiency and accuracy than CWTSST.
Figure 3. (a) Blind−source signal f b ( t ) . (b) The observed signal f b ( t ) with additive noise (SNR = 15). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Figure 3. (a) Blind−source signal f b ( t ) . (b) The observed signal f b ( t ) with additive noise (SNR = 15). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Sensors 24 06026 g003
Example 3 (see Figure 4). 
In this example, we illustrate the proposed method when applied to a non-stationary signal, i.e., a signal where amplitudes are also time-dependent in addition to frequencies, defined by
f c ( t ) = f c , 1 ( t ) + f c , 2 ( t ) + f c , 3 ( t ) + f c , 4 ( t ) ,
where
f c , 1 ( t ) = exp ( ( 1 t / 30 ) 2 + ( t / 30 ) 3 ) cos ( 2 π ( t + cos ( t / 2 ) / 10 ) ) , 0 < t < 10 and 20 < t < 30 , f c , 2 ( t ) = ( 3 / 2 ) cos ( 2 π ( 2 t + t 2 / 100 ) ) , 10 < t < 30 , f c , 3 ( t ) = ( t / 10 + 13 / 10 ) cos ( 2 π ( 7 t / 2 + sin ( 2 t / 3 ) / 5 ) ) , 0 < t < 20 , f c , 4 ( t ) = ( 2 + cos ( 2 π t / 100 ) ) cos ( 2 π ( 5 t + t 2 / 50 ) ) , 10 < t < 30 .
The signal f c ( t ) is added with a white noise with SNR = 10 dB and sampled at a rate of 64 Hz on [ 0 , 30 ] . The results measuring the accuracy of mode reconstruction in terms of NMSE are shown in Figure 4d,e, with running times in Table 1. As shown, CWTSSO behaves better than CWTSST in each case, and CWTSSO is much faster than CWTSST. Figure 4f shows that instantaneous frequencies of both components are better extracted by CWTSSO than those by CWTSST.
Figure 4. (a) Blind−source signal f c ( t ) . (b) The observed signal f c ( t ) with additive noise (SNR = 10). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Figure 4. (a) Blind−source signal f c ( t ) . (b) The observed signal f c ( t ) with additive noise (SNR = 10). (c) Sub-signals of blind source signal. (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered frequencies.
Sensors 24 06026 g004
Example 4 (see Figure 5). 
We consider a real-word signal, namely, “a bat echolocation signal” f bat emitted by a large brown bat, and discover that it consists of four IMFs,
f bat = f bat , 1 + f bat , 2 + f bat , 3 + f bat , 4 .
To convince ourselves that this decomposition makes sense, we add an unknown signal f bat , 5 , given by
f bat , 5 ( t ) = ( 4 / 125 ( 7 / 254 ) cos ( 2 π t ) ) cos ( 2 π ( 30 t 13 t 2 ) ) ,
To f bat and decompose the combined blind source signal f bat + f bat , 5 , and discover that it consists of five IMFs. Both CWTSSO and CWTSST can successfully recover the IMFs, while the MSE of the added component f bat , 5 ( t ) by CWTSSO and CWTSST are 8.37 × 10 3 and 6.39 × 10 2 , respectively. Table 1 shows the execution-time comparison. Through the comparison, it demonstrates that CWTSSO is superior to CWTSST in both efficiency and effectiveness.
Figure 5. (a) A bat echolocation signal f bat . (b) Added component f bat , 5 . (c) Combined blind source signal f bat + f bat , 5 . (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered sub-signal f bat , 5 ( t ) .
Figure 5. (a) A bat echolocation signal f bat . (b) Added component f bat , 5 . (c) Combined blind source signal f bat + f bat , 5 . (d) Recovered sub-signals by CWTSST. (e) Recovered sub-signals by CWTSSO. (f) Recovered sub-signal f bat , 5 ( t ) .
Sensors 24 06026 g005

4. Conclusions

In this paper, we develop a rigorous mathematical theory of signal separation operator based on continuous wavelet transform (CWTSSO). An in-depth error analysis study of instantaneous frequency estimation and component recovery is provided. In contrast to CWTSST, CWTSSO is a direct method for mode decomposition and retrieval by plugging the extracted instantaneous frequency values in the signal separation operator. Hence, the CWTSSO provides superior efficiency against the CWTSST. Numerical experiments demonstrate the efficiency and effectiveness of CWTSSO for a blind source non-stationary signal separation. A Matlab implementation of CWTSSO can be obtained by communicating with authors. Our future work will focus on algorithms that apply the proposed scheme to engineering and scientific fields, such as mobile communication, sensor arrays, radar systems.

Author Contributions

Writing—original draft preparation, N.H. Methodology, Software, Y.P. Investigation, Validation, Z.S. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported in part by the National Natural Science Foundation of China (grant nos. 12201456, 12371499, 62306031), in part by Guangdong Basic and Applied Basic Research Foundation grant 2021A1515110530 and in part by the Shenzhen Sustainable Development Project, China (KCXFZ20211020172544004).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the authors on request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Huang, N.E.; Shen, Z.; Long, S.R.; Wu, M.C.; Shih, H.H.; Zheng, Q.; Yen, N.C.; Tung, C.C.; Liu, H.H. The empirical mode decomposition and the Hilbert spectrum for nonlinear and non-stationary time series analysis. Proc. R. Soc. Lond. Ser. Math. Phys. Eng. Sci. 1998, 454, 903–995. [Google Scholar] [CrossRef]
  2. Wu, Z.; Huang, N.E. Ensemble empirical mode decomposition: A noise-assisted data analysis method. Adv. Adapt. Data Anal. 2009, 1, 1–41. [Google Scholar] [CrossRef]
  3. Pustelnik, N.; Borgnat, P.; Flandrin, P. Empirical mode decomposition revisited by multicomponent non-smooth convex optimization. Signal Process. 2014, 102, 313–331. [Google Scholar] [CrossRef]
  4. Rilling, G.; Flandrin, P. One or two frequencies? The empirical mode decomposition answers. IEEE Trans. Signal Process. 2008, 56, 85–95. [Google Scholar] [CrossRef]
  5. Flandrin, P.; Rilling, G.; Goncalves, P. Empirical mode decomposition as a filter bank. IEEE Signal Process. Lett. 2004, 11, 112–114. [Google Scholar] [CrossRef]
  6. Rehman, N.; Mandic, D.P. Empirical mode decomposition for trivariate signals. IEEE Trans. Signal Process. 2010, 58, 1059–1068. [Google Scholar] [CrossRef]
  7. Rehman, N.; Mandic, D.P. Filter bank property of multivariate empirical mode decomposition. IEEE Trans. Signal Process. 2011, 59, 2421–2426. [Google Scholar] [CrossRef]
  8. Oberlin, T.; Meignen, S.; Perrier, V. An alternative formulation for the empirical mode decomposition. IEEE Trans. Signal Process. 2012, 60, 2236–2246. [Google Scholar] [CrossRef]
  9. Hou, T.Y.; Shi, Z. Data-driven time-frequency analysis. Appl. Comput. Harmon. Anal. 2013, 35, 284–308. [Google Scholar] [CrossRef]
  10. Gilles, J. Empirical wavelet transform. IEEE Trans. Signal Process. 2013, 61, 3999–4010. [Google Scholar] [CrossRef]
  11. Dragomiretskiy, K.; Zosso, D. Variational mode decomposition. IEEE Trans. Signal Process. 2014, 62, 531–544. [Google Scholar] [CrossRef]
  12. Chen, S.; Dong, X.; Peng, Z.; Zhang, W.; Meng, G. Nonlinear chirp mode decomposition: A variational method. IEEE Trans. Signal Process. 2017, 65, 6024–6037. [Google Scholar] [CrossRef]
  13. Cicone, A.; Liu, J.; Zhou, H. Adaptive local iterative filtering for signal decomposition and instantaneous frequency analysis. Appl. Comput. Harmon. Anal. 2016, 41, 384–411. [Google Scholar] [CrossRef]
  14. Cicone, A.; Dell’Acqua, P. Study of boundary conditions in the iterative filtering method for the decomposition of nonstationary signals. J. Comput. Appl. Math. 2020, 373, 112248. [Google Scholar] [CrossRef]
  15. Kowalski, M.; Meynard, A.; Wu, H.T. Convex Optimization approach to signals with fast varying instantaneous frequency. Appl. Comput. Harmon. Anal. 2018, 41, 89–112. [Google Scholar] [CrossRef]
  16. Kodera, K.; Gendrin, R.; Villedary, C. Analysis of time-varying signals with small BT values. IEEE Trans. Acoust. Speech Signal Process. 1978, 26, 64–76. [Google Scholar] [CrossRef]
  17. Auger, F.; Flandrin, P. Improving the readability of time-frequency and time-scale representations by the reassignment method. IEEE Trans. Signal Process. 1995, 43, 1068–1089. [Google Scholar] [CrossRef]
  18. Auger, F.; Chassande-Mottin, E.; Flandrin, P. Making reassignment adjustable: The levenberg-marquardt approach. In Proceedings of the 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 25–30 March 2012; pp. 3889–3892. [Google Scholar]
  19. Chassande-Mottin, E.; Auger, F.; Flandrin, P. Time-frequency/timescale reassignment. In Wavelets and Signal Processing; Springer: Berlin/Heidelberg, Germany, 2003; pp. 233–267. [Google Scholar]
  20. Auger, F.; Flandrin, P.; Lin, Y.; McLaughlin, S.; Meignen, S.; Oberlin, T.; Wu, H.-T. Time-frequency reassignment and synchrosqueezing: An overview. IEEE Signal Process. Mag. 2013, 30, 32–41. [Google Scholar] [CrossRef]
  21. Daubechies, I.; Maes, S. A nonlinear squeezing of the continuous wavelet transform based on auditory nerve models. In Wavelets in Medicine and Biology; Routledge: London, UK, 1996; pp. 527–546. [Google Scholar]
  22. Daubechies, I.; Lu, J.; Wu, H.-T. Synchrosqueezed wavelet transforms: An empirical mode decomposition-like tool. Appl. Comput. Harmon. Anal. 2011, 30, 243–261. [Google Scholar] [CrossRef]
  23. Yang, H. Synchrosqueezed wave packet transforms and diffeomorphism based spectral analysis for 1D general mode decompositions. Appl. Comput. Harmon. Anal. 2015, 39, 33–66. [Google Scholar] [CrossRef]
  24. Yang, H.; Ying, L. Synchrosqueezed curvelet transform for two-dimensional mode decomposition. Siam J. Math. Anal. 2014, 46, 2052–2083. [Google Scholar] [CrossRef]
  25. Huang, Z.L.; Zhang, J.; Zhao, T.H.; Sun, Y. Synchrosqueezing S-transform and its application in seismic spectral decomposition. IEEE Trans. Geosci. Remote. Sens. 2016, 54, 817–825. [Google Scholar] [CrossRef]
  26. Thakur, G.; Wu, H.T. Synchrosqueezing-based recovery of instantaneous frequency from nonuniform samples. Siam J. Math. Anal. 2011, 43, 2078–2095. [Google Scholar] [CrossRef]
  27. Oberlin, T.; Meignen, S.; Perrier, V. The Fourier-based synchrosqueezing transform. In Proceedings of the 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Florence, Italy, 4–9 May 2014; pp. 315–319. [Google Scholar]
  28. Chen, Y.C.; Cheng, M.Y.; Wu, H.T. Non-parametric and adaptive modelling of dynamic periodicity and trend with heteroscedastic and dependent errors. J. R. Stat. Soc. Ser. Stat. Methodol. 2014, 76, 651–682. [Google Scholar] [CrossRef]
  29. Meignen, S.; Oberlin, T.; McLaughlin, S. A new algorithm for multicomponent signals analysis based on synchrosqueezing: With an application to signal sampling and denoising. IEEE Trans. Signal Process. 2012, 60, 5787–5798. [Google Scholar] [CrossRef]
  30. Thakur, G.; Brevdo, E.; Fckar, N.S.; Wu, H.T. The synchrosqueezing algorithm for time-varying spectral analysis: Robustness properties and new paleoclimate applications. Signal Process. 2012, 93, 1079–1094. [Google Scholar] [CrossRef]
  31. Yang, H. Statistical analysis of synchrosqueezed transforms. Appl. Comput. Harmon. Anal. 2018, 45, 526–550. [Google Scholar] [CrossRef]
  32. Oberlin, T.; Meignen, S.; Perrier, V. Second-order synchrosqueezing transform or invertible reassignment? Towards ideal time-frequency representations. IEEE Trans. Signal Process. 2015, 63, 1335–1344. [Google Scholar] [CrossRef]
  33. Pham, D.H.; Meignen, S. High-order synchrosqueezing transform for multicomponent signals analysis with an application to gravitational-wave signal. IEEE Trans. Signal Process. 2017, 65, 3168–3178. [Google Scholar] [CrossRef]
  34. Behera, R.; Meignen, S.; Oberlin, T. Theoretical analysis of the second-order synchrosqueezing transform. Appl. Comput. Harmon. Anal. 2018, 45, 379–404. [Google Scholar] [CrossRef]
  35. Meignen, S.; Pham, D.H.; Mclaughlin, S. On demodulation, ridge detection and synchrosqueezing for multicomponent signals. IEEE Trans. Signal Process. 2017, 65, 2093–2103. [Google Scholar] [CrossRef]
  36. Wang, S.; Chen, X.; Cai, G.; Chen, B.; Li, X.; He, Z. Matching demodulation transform and synchrosqueezing in time–frequency analysis. IEEE Trans. Signal Process. 2014, 62, 69–84. [Google Scholar] [CrossRef]
  37. Li, L.; Cai, H.Y.; Han, H.X.; Jiang, Q.T.; Ji, H.B. Adaptive short-time Fourier transform and synchrosqueezing transform for non-stationary signal separation. Signal Process. 2020, 166, 107–231. [Google Scholar] [CrossRef]
  38. Li, L.; Cai, H.Y.; Jiang, Q.T. Adaptive synchrosqueezing transform with a time-varying parameter for non-stationary signal separation. Appl. Comput. Harmon. Anal. 2020, 49, 1075–1106. [Google Scholar] [CrossRef]
  39. Chui, C.K.; Mhaskar, H.N. Signal decomposition and analysis via extraction of frequencies. Appl. Comput. Harmon. Anal. 2016, 40, 97–136. [Google Scholar] [CrossRef]
  40. Chui, C.K.; Han, N.N. Wavelet thresholding for recovery of active sub-signals of a composite signal from its discrete samples. Appl. Comput. Harmon. Anal. 2021, 52, 1–24. [Google Scholar] [CrossRef]
Figure 1. (a) Blind−source signal f ( t ) . (b) Time-scale spectrogram | ( W ψ f ) ( t , a ) | . (c) Extrema scale curves. (d) Recovered frequencies. (e) Recovered sub-signal f 1 ( t ) . (f) Recovered sub-signal f 2 ( t ) .
Figure 1. (a) Blind−source signal f ( t ) . (b) Time-scale spectrogram | ( W ψ f ) ( t , a ) | . (c) Extrema scale curves. (d) Recovered frequencies. (e) Recovered sub-signal f 1 ( t ) . (f) Recovered sub-signal f 2 ( t ) .
Sensors 24 06026 g001
Table 1. Comparisons of running time(s).
Table 1. Comparisons of running time(s).
Example 1Example 2Example 3Example 4
CWTSST15.4628.62133.2713.81
CWTSSO2.783.8717.771.94
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

Han, N.; Pei, Y.; Song, Z. Signal Separation Operator Based on Wavelet Transform for Non-Stationary Signal Decomposition. Sensors 2024, 24, 6026. https://doi.org/10.3390/s24186026

AMA Style

Han N, Pei Y, Song Z. Signal Separation Operator Based on Wavelet Transform for Non-Stationary Signal Decomposition. Sensors. 2024; 24(18):6026. https://doi.org/10.3390/s24186026

Chicago/Turabian Style

Han, Ningning, Yongzhen Pei, and Zhanjie Song. 2024. "Signal Separation Operator Based on Wavelet Transform for Non-Stationary Signal Decomposition" Sensors 24, no. 18: 6026. https://doi.org/10.3390/s24186026

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