Adaptive Embedded Flexible Tensor Singular Spectrum Decomposition

Abstract

To address the difficulty in extracting fault features from dual-channel signals, this work proposes a multichannel signal fusion processing method based on Flexible Tensor Singular Spectrum Decomposition (FTSSD) with adaptive embedding dimension selection. Firstly, the optimal embedding dimension of the trajectory tensor is adaptively determined using the proposed Trajectory Dimension Ratio (TDR) index. Once the optimal embedding dimension is obtained, the multichannel signals are represented as an optimal trajectory tensor. Then, FTSSD is employed to decompose the tensor and extract feature component signals. Moreover, by setting a residual threshold or maximum number of components to control the iterative process, the precision and rationality of the decomposition are ensured. Finally, all component signals are reconstructed, and their waveforms and spectra are comprehensively analyzed. The experimental results demonstrate that the proposed adaptive embedding FTSSD algorithm achieves a high accuracy and robustness in multichannel signal decomposition and feature extraction, making it suitable for the multicomponent analysis of complex dynamic signals such as mechanical fault diagnosis and vibration analysis.

1. Introduction

With the continuous development of industrial automation and intelligent production, condition monitoring and fault diagnosis have become essential means for ensuring the safe and efficient operation of industrial systems. Efficient decomposition and analysis are crucial for the fault diagnosis of mechanical equipment [1,2,3]. In particular, employing multichannel signal acquisition allows for the synchronous capture of vibration signals in multiple directions and locations. It provides a more comprehensive reflection of the equipment’s dynamic characteristics and helps to identify potential faults. However, due to the complex and variable nature of such signals, existing decomposition algorithms struggle to effectively address this challenge.

In recent years, numerous researchers have sought to improve methods for rolling bearing fault diagnosis. Yin et al. [4] studied a fault diagnosis approach that combines Fast Fourier Transform (FFT) and Convolutional Neural Networks, which significantly improves its diagnostic accuracy while reducing its dependence on expert experience. However, its feature extraction capabilities are limited, and high-quality training data are required. Wang et al. [5] introduced a bearing fault diagnosis method leveraging deep feature enhancement combined with reinforcement learning to improve diagnostic robustness and capture global information. However, the model is complex, and its interpretability of features is limited. Chen et al. [6] successfully identified weak transient fault features under strong noise environments by combining the squared envelope spectrum and successive variational mode decomposition, though the computational cost of this was high. Fei et al. [7] proposed a hierarchical decision fusion diagnosis method aimed at improving diagnostic accuracy, which can accurately detect faults under different working conditions, locate faults, and estimate fault severity. However, this method has the disadvantage of being complex in model parameter tuning. Xu et al. [8] developed a diagnostic approach that integrates Singular Value Decomposition with the squared envelope spectrum, aiming to address the challenge of weak early defect signals being prone to noise interference and thereby effectively identify early fault types, although its noise suppression capability remains limited. To address compound faults caused by bearings and other components, Fan et al. [9] presented a method based on information fusion, Empirical Mode Decomposition (EMD), and polar coordinate adaptive distribution images for detecting the compound faults of rolling bearings and rotors. This method, when dealing with complex compound faults, may require specific handling for each type of fault feature, and its applicability could be limited if confronted with unknown or diverse types of faults. Gao et al. [10] proposed a fault classification method that utilizes Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN), Fuzzy Measure Entropy (FME), and a Particle Swarm Optimized Probabilistic Neural Network (PSO-PNN) for improved fault detection. This method decomposes noise components from the signal and extracts features using fuzzy measure entropy, followed by classification through an optimized probabilistic neural network, but it has high computational costs. Wu et al. [11] addressed the insufficient feature extraction under complex working conditions and the low diagnostic accuracy in small datasets by proposing a fault diagnosis method based on MTF-CBAM-IResNet, significantly improving diagnostic accuracy. By introducing a Multi-scale Temporal Feature (MTF) and Convolutional Block Attention Module (CBAM), the feature extraction effectiveness is enhanced, and an improved residual network (IResNet) is utilized for more accurate classification. However, the adaptability and generalizability of this method to other fault scenarios or significantly different data distributions still need verification. Jiang et al. [12] proposed a dual-channel CNN rolling bearing fault diagnosis method, which combines Sparrow Search Algorithm optimized Variational Mode Decomposition (SSA-VMD) and Symmetric Dot Pattern (SDP) to address the nonlinearity, nonstationarity, and limited feature extraction performance of single-channel CNNs in rolling bearing fault signals. However, the computational complexity of this method remains high, and its robustness is limited. To extract and fuse complementary fault features from multi-sensor data, Wang et al. [13] proposed a multi-level feature tensor fusion network for bearing fault diagnosis, effectively improving fault diagnosis performance, though there is a risk of overfitting.

In summary, the above methods still face the issues of insufficient resolution, sensitivity to noise, and a high computational complexity when handling multichannel signals. Tensor decomposition, as an effective multidimensional data analysis tool, has increasingly become a research focus in the signal processing field due to its capability to simultaneously handle multichannel and multidimensional signal data. Over the years, various advancements in tensor decomposition techniques have been proposed to address various challenges. Kilmer et al. [14] proposed a tensor–tensor product and tensor–SVD. Wang et al. [15] proposed a truncated higher-order tensor singular value decomposition to extract fault features, aiming at the problem of the truncation parameters of higher-order tensor singular value decomposition not being determined. Lu et al. [16] developed a tensor robust principal component (TRPCA) approach. Huang et al. [17,18] presented a flexible tensor multiplication and two kinds of tensor singular value decomposition. These advancements have enriched the theoretical framework of tensor decomposition and contributed to its ongoing development. Particularly, the first kind of tensor decomposition method can deeply reveal the intrinsic structure and multidimensional characteristics of signals, providing new insights for the decomposition and feature extraction of complex signals.

However, existing tensor decomposition methods still have shortcomings in practical applications. Firstly, the choice of embedding dimensions significantly affects the signal decomposition effect; fixed embedding dimensions struggle to adapt to the complex dynamic characteristics of different signals, potentially leading to insufficient information capture or excessive noise introduction. Secondly, existing tensor decomposition algorithms face a trade-off between computational efficiency and decomposition accuracy when dealing with large-scale data, necessitating improvements in computational performance while ensuring decomposition effectiveness. To address these issues, this study investigates a novel dual-channel signal decomposition algorithm based on flexible tensor decomposition combined with adaptive dimension selection. By introducing a Tensor Dynamic Range (TDR) metric, the embedding dimensions are adaptively selected to ensure that the embedding dimensions automatically adjust with changes in the signal characteristics, thereby improving the accuracy of signal decomposition. Furthermore, this study aims to enhance the efficiency and precision of multichannel signal decomposition through improved tensor decomposition methods. The main contributions of this work are as follows:

• A trajectory tensor embedding dimension adaptive selection algorithm is proposed, allowing for the dynamic adjustment of embedding dimensions based on signal component characteristics.
• Efficient and accurate dual-channel signal decomposition is realized through flexible tensor decomposition, enhancing the overall performance of signal analysis.

The remainder of this paper is organized as follows: Section 1 introduces the adaptive embedding dimension selection method and its implementation steps; Section 2 elaborates on the flexible tensor decomposition principle and the new algorithm; Section 3 presents the experimental design and result analysis for the proposed algorithm in dual-channel signals, verifying the effectiveness of the proposed method; and Section 4 provides the conclusions.

Through this research, we aim to provide an efficient, robust, and adaptive approach for dual-channel signal decomposition and analysis, advancing the application and development of advanced signal processing techniques in areas such as mechanical fault diagnosis.

2. Adaptive Embedding Dimension Method

The embedding dimension refers to the number of dimensions used when mapping the original multidimensional signal to a higher-dimensional space in signal processing and tensor decomposition. Specifically, the embedding dimension determines the representation of data in the high-dimensional space, directly impacting the effectiveness of signal feature capture and the accuracy of subsequent analysis. In the tensorization of multichannel signals, the embedding dimension is used to construct high-order tensors to fully reflect the complex dynamic characteristics of the signal. The selection of the embedding dimension plays a crucial role in time series analysis and signal processing. Traditional methods typically use a fixed embedding dimension, which may lead to insufficient feature capture or overfitting. To address the limitations of the embedding dimension in tensor decomposition, Feng et al. [19] proposed a rolling bearing fault diagnosis method based on a multi-level denoising approach and an improved deep residual network, optimizing matrix singular value decomposition. This method automatically determines the optimal embedding dimension by calculating the DR values under different embedding dimensions. Building on this foundation, this paper proposes the TDR index, as follows:

$$\mathrm{T}\mathrm{D}\mathrm{R}=\rho {\displaystyle \frac{\mathrm{abs}\left({\sigma }_{i,j}^2\right)-\mathrm{abs}\left({\sigma }_{i,j}^3\right)}{\mathrm{abs}\left({\sigma }_{i,j}^1\right)}}-\left(1-\rho \right){\displaystyle \frac{\mathrm{abs}\left({\sigma }_{i,j}^1\right)-\mathrm{abs}\left({\sigma }_{i,j}^2\right)}{\mathrm{abs}\left({\sigma }_{i,j}^1\right)}}$$

(1)

where ${\sigma }_{i,j}^1~{\sigma }_{i,j}^3$represent the elements of the first to third horizontal slices of the core tensor in the tensor singular value decomposition, and $\rho$ is the weighting coefficient, with a range of $0<\rho <1$. Each trajectory tensor dimension corresponds to a TDR value, and the dimension with the highest TDR index is considered to be the optimal embedding dimension. Figure 1 illustrates the calculation and application process of the TDR index.

3. Flexible Tensor Singular Spectrum Decomposition

Tensor decomposition is an essential tool in multidimensional data analysis, used to decompose high-order tensors (multi-dimensional arrays) into combinations of simpler, structured lower-order tensors. Tensor decomposition has broad applications in various fields, including signal processing, machine learning, image analysis, and natural language processing, and demonstrates significant advantages, especially when handling multichannel and multidimensional signals.

Traditional tensor decomposition, such as CP decomposition and Tucker decomposition based on n-mode products, suffer from inherent issues like non-unique rank and a non-pseudo-diagonal core tensor. Additionally, a T-T product [20] can only be used for multiplication between tensors of the same order, greatly limiting the applicability of tensor singular value decomposition algorithms based on the T-T product. Flexible tensor products are one of the latest advancements in tensor decomposition theory [18], and can be represented as follows:

$${\left(\mathcal{X}{\times }_{o,⟨p,q⟩}\mathcal{Y}\right)}_{k_1,k_2,\cdots ,k_{m+n-2o}}=\sum _{s_1=1}^{S_1}\cdots \sum _{s_o=1}^{S_o}{\mathcal{X}}_{k_1,{\overrightarrow{\Delta }}_x^p}{\mathcal{Y}}_{{\overrightarrow{\Delta }}_y^q,k_{m+n-2o}}$$

(2)

where p and q represent the respective orders for the first and second tensors. Here, the symbol ’1’ denotes the forward order, i.e., the sequence of tensor modes follows the forward index, while ’2’ indicates the reverse order, following the reverse index. The parameter o, a positive integer, indicates the order for the multiplier during the tensor product, with an allowable range of $\mathrm{1,2},\dots ,\mathrm{m}\mathrm{i}\mathrm{n}\left(\mathrm{N},\mathrm{M}\right)-1$. This flexibility provides more computational possibilities for tensor multiplication, making it adaptable to various application scenarios. To clearly denote the different forms of flexible tensor products, ref. [18] described it as an “o-order (p, q)-mode product.” This terminology provides a straightforward way to identify the particular type of tensor multiplication. Based on the flexible tensor product, the first kind of flexible tensor singular value decomposition can be derived as follows:

$$\mathcal{X}=\mathcal{U}{\times }_{1,⟨2,1⟩}\mathcal{S}{\times }_{1,⟨2,1⟩}{\mathcal{V}}^T$$

(3)

where $\mathcal{U}\in {ℝ}^{I_1\times I_1}$ and $\mathcal{V}\in {ℝ}^{I_3\times I_3}$ are orthogonal singular tensors, and $\mathcal{S}\in {ℝ}^{I_1\times I_2\times I_3}$ is the core tensor. The first kind of flexible tensor singular value decomposition (1K-FTSVD) for a third-order tensor $\mathcal{X}\in {ℝ}^{I_1\times I_2\times I_3}$ is illustrated in Figure 2.

As observed in Figure 2, it is evident that the 1K-FTSVD method breaks down third-order tensors into the following three constituent tensors: $\mathcal{U}\in {ℝ}^{I_1\times I_1}$, $\mathcal{S}\in {ℝ}^{I_1\times I_2\times I_3}$ and $\mathcal{V}\in {ℝ}^{I_3\times I_3}$. The left singular tensor $\mathcal{U}\in {ℝ}^{I_1\times I_1}$ and the right singular tensor $\mathcal{V}\in {ℝ}^{I_3\times I_3}$ are both of the second order. Furthermore, 1K-FTSVD guarantees a unique decomposition result and maintains a simple computation process. Based on the principle of 1K-FTSVD, an adaptive embedding Flexible Tensor Singular Spectrum Decomposition (FTSSD) algorithm is constructed.

For multichannel signals, tensorization is performed to map the time series of k channels with N sampling points into a third-order tensor space, in order to capture the high-dimensional characteristics of the signal. Each forward slice of the third-order tensors $\mathcal{X}\in$ $R^{I_1\times I_2\times I_3}$ corresponds to a trajectory matrix ${\mathcal{X}}_{:,:,k}$ for the following:

$${\mathcal{X}}_{:,:,k}=\left[\begin{array}{cccc}{x}_k\left(1\right)& x_k\left(N\right)& x_k\left(N-1\right)& \dots \\ x_k\left(2\right)& x_k\left(1\right)& x_k\left(N\right)& \dots \\ ⋮& ⋮& ⋮& ⋮\\ x_k\left(N\right)& x_k\left(N-1\right)& \dots & \dots \end{array}\right]$$

(4)

where $I_1=N$, $I_3=K$, and $I_2$ is the embedding dimension.

The selection of the embedding dimension $I_2$ is adaptively determined using the TDR formula. Subsequently, the resulting trajectory tensor $\mathcal{X}$ undergoes tensor singular value decomposition, as described in Equation (3).

This process achieves dimensionality reduction and feature extraction by progressively extracting the characteristic components from multichannel signals. In the reconstruction process, all feature components ${\mathcal{X}}_i$ are first divided into two disjoint sets $\{I_C,I_R\}$, where the tensor for $I_C$ group is calculated using the following formula:

$${\mathcal{X}}_{I_C}=\sum _{i_c=i_1}^{i_C}{\mathcal{X}}_{i_c}$$

(5)

where ${\mathcal{X}}_{{\mathrm{i}}_{\mathrm{c}}}=\widehat{\mathcal{U}}{\times }_{1,⟨\mathrm{2,1}⟩}\mathcal{S}{\times }_{1,⟨\mathrm{2,1}⟩}{\mathcal{V}}^{\mathrm{T}}$. This method of tensor selection avoids including noise signals with large singular values. Subsequently, the tensor ${\mathcal{X}}_{{\mathrm{I}}_{\mathrm{C}}}$ undergoes diagonal averaging, and the next iteration is carried out using the residual signal. This iterative process concludes when the normalized mean squared error drops below a specified threshold. The proposed adaptive embedding FTSSD algorithm can effectively decompose and reconstruct multichannel signals, extracting physically meaningful signal components while removing interfering noise.

4. Result Analysis

4.1. Simulation Signal Analysis

To verify the effectiveness of the proposed method, we first introduced random noise into the simulation signals and processed the faulty signals of the bearing. Figure 3 presents the dual-channel time domain, frequency spectrum, and envelope spectrum of the bearing simulation signal after adding noise. It can be observed that, under the interference of noise, the bearing fault features are difficult to effectively identify and extract.

Next, we applied the proposed adaptive embedding FTSSD to process the simulation signals. Figure 4 shows the processed signal. It is evident that the bearing fault features, formerly masked by noise, are clearly extracted. This demonstrates that the proposed method could effectively extract the bearing fault features from noisy signals. These processed results indicate that the proposed method possesses a strong anti-interference capability, enabling the accurate capture of critical fault information even in high-noise environments.

4.2. Experimental Signal Analysis

To further verify the effectiveness of the proposed method under actual working conditions, the signals from the bearing test rig were analyzed. The experimental setup is shown in Figure 5, where the AC motor speed was set to 2250 r/min, the sampling frequency was Fs = 25,600 Hz, and the bearing outer race fault characteristic frequency was f_o = 115.61 Hz. Random noise was added during the experiment to simulate realistic complex conditions. Figure 6 shows the time domain waveforms and frequency spectra of the two-channel signals, where the fault characteristic frequency of the bearing outer race is difficult to identify in the envelope spectrum, and numerous interference components are present in the frequency spectrum.

Subsequently, the proposed method was applied to the experimental signals. Figure 7 presents the time domain, frequency spectrum, and envelope spectrum of the dual-channel component signals. It can be clearly observed from Figure 7 that the fault characteristic frequency of the bearing outer race and its harmonics were effectively extracted. This demonstrates that the proposed method significantly enhances the feature extraction performance for multichannel signals.

To further validate the superiority of the proposed method, Tensor Robust Principal Component Analysis [21] was employed for a comparative analysis of the experimental signals. Figure 8 shows the time domain, frequency spectrum, and envelope spectrum of the dual-channel components processed by TRPCA. Compared to Figure 7, the signal-to-noise ratio in Figure 8 is significantly lower, and the extraction of the outer race characteristic frequency and its harmonics (first to third) in the envelope spectrum is less effective than with the proposed method.

Based on the above experimental results, it can be concluded that the proposed adaptive embedding FTSSD signal decomposition method demonstrates a superior fault feature extraction capability in noisy environments, with both diagnostic accuracy and ignal-to-noise ratio outperforming the traditional Tensor Robust Principal Component Analysis (TRPCA) method. This indicates that the proposed method has a high practicality and effectiveness in multichannel signal decomposition, particularly for fault diagnosis tasks in complex dynamic environments.

To quantitatively evaluate the feature extraction effectiveness of the proposed method compared to the comparison method, we use the defect characteristic frequency amplitude (DCFRA) index. The DCFRA index is represented as follows:

$$DCFRA={\displaystyle \frac{A_{fo}+A_{2fo}+A_{3fo}+\cdots ++A_{nfo}}{{\mathrm{RMS}}_f}}$$

(6)

where RMS_f is the root mean square of the frequency spectrum and A_fo~A_nfo denote the amplitude of the defect characteristic frequency and its harmonics, respectively. The DCFRA values for the proposed method are 0.09745 and 0.26790 for the horizontal accelerometer and the vertical accelerometer, respectively, with a total value of 0.3653. In contrast, the DCFRA values of the TRPCA method for the horizontal and the vertical accelerometers are 0.08201 and 0.05865, respectively, with a total value of 0.14066. These results indicate that the DCFRA value of the proposed method is about 2597 times higher than that of the comparison method.

5. Conclusions

This work proposed a multichannel signal fusion processing algorithm based on adaptive embedding FTSVD for the decomposition and analysis of dual-channel signals. The proposed TDR index was utilized to achieve the adaptive selection of the embedding dimension, effectively improving the accuracy of signal decomposition. By constructing trajectory tensors and performing flexible tensor singular value decomposition, the optimal embedding dimension was adaptively determined, enabling effective signal feature extraction. The experimental results demonstrated that the proposed method has significant advantages in the decomposition of dual-channel signals, effectively extracting the main features of the signal even in noisy environments. Compared to existing methods, the proposed approach better extracted the fault characteristic frequency and its harmonics, exhibiting a higher signal-to-noise ratio and diagnostic accuracy.

Furthermore, the proposed method should not be limited to fault diagnosis and has other potential applications. For instance, it could possibly be applied to speech and audio signal denoising and biomedical signal processing, where the efficient decomposition and feature extraction of multichannel signals are essential.

In future research, efforts can focus on further enhancing the computational efficiency of the proposed method, particularly for large-scale datasets and real-time applications. While the current study primarily focuses on the accurate extraction of fault features, improving the computational efficiency of the algorithm will be an important direction for future research. Addressing this limitation could further enhance the method’s applicability in practical fault diagnosis scenarios, especially in online environments.