Frontiers in Computing and Intelligent Systems ISSN: 2832-6024 | Vol. 11, No. 3, 2025 41 Bearing Acoustic Emission Signal Processing based on Improved SGMD Yue Shen *, Yang Yu School of Information Science and Engineering, Shenyang University of Technology, Shenyang Liaoning, 110870, China * Corresponding author: Yue Shen (Email: 2488119408@qq.com) Abstract: To solve the problems of poor adaptability to fixed thresholds and obvious endpoint effect in traditional Symplectic Geometric Mode Decomposition (SGMD), an improved SGMD (ISGMD) algorithm is proposed to improve the acoustic emission signal processing performance in bearing fault diagnosis. Firstly, a dynamic threshold adjustment model was constructed by fusing the signal Lyapunov exponent and the fractal dimension to realize the adaptive decomposition of signals of different complexity. Secondly, combined with the improved mirror extension and cosine smoothing technology, the endpoint effect is suppressed and the waveform distortion is avoided. Furthermore, the composite multi-scale dispersive entropy (CMSD) is introduced to screen the effective components, and the multi-scale entropy value is used to quantify the signal characteristics, eliminate the noise and reconstruct the components with high information order. Experiments show that ISGMD has excellent decomposition effect in noisy simulation signals, and the decomposition does not produce modal aliasing. In the actual bearing fault signal analysis, the reconstructed signal retains the outstanding peak characteristics, and the noise component is removed to a certain extent. This method significantly improves the robustness of signal decomposition and the ability to extract fault features, and provides an effective tool for the diagnosis of AE bearings under complex working conditions. Keywords: Symplectic Geometric Mode Decomposition; Acoustic Emission; Signal Reconstruction; Entropy Theory; Bearing Fault Diagnosis. 1. Introduction As the core component of large-scale rotating machinery, the operation status of rolling bearings is directly related to the economy and safety of industrial production systems. According to statistics, about 30% of rotating machinery failures originate from bearing failure, of which local damage to rolling elements, inner and outer rings and other components accounts for more than 60%. If such faults are not diagnosed in time, they can lead to equipment chain damage and even safety accidents. Therefore, the development of efficient bearing condition monitoring and fault diagnosis technology is of great engineering value [1-3]. Acoustic Emission (AE) technology [4] can sensitively detect early microcracks and local spalling of bearings by capturing the transient elastic waves generated by the release of stress waves inside the material, and has shown unique advantages in the field of bearing fault detection by virtue of its non-sensitivity to materials and strong environmental adaptability. However, acoustic emission signals are susceptible to environmental noise, mechanical friction noise and electromagnetic interference, and their nonlinearity and non-Gausterity make it difficult for traditional time-frequency analysis methods (such as Fourier transform and wavelet analysis) to effectively extract fault features. In addition, existing adaptive decomposition methods, such as Empirical Mode Decomposition (EMD), Local Mean Decomposition (LMD) and Variational Mode Decomposition (VMD), have problems such as modal aliasing, endpoint effects and parameter sensitivity, which limit their application under complex working conditions. The Symplectic Geometric Mode Decomposition (SGMD) proposed by scholar Pan Haiyang solves the eigenvalues of Hamilton matrices through the symplectic geometric similarity transformation, which effectively suppresses the modal confusion while maintaining the intrinsic characteristics of the sequence. Subsequent scholars have extended SGMD to the fields of gearbox fault current analysis [5], photovoltaic DC denoising [6], fault feature clustering extraction [7], and power load prediction [8]. However, the existing SGMD methods have obvious limitations: the decomposition quality depends on the preset similarity threshold, and the fixed parameters are difficult to adapt to signals of different complexity. At the same time, there is endpoint effect interference, which affects the reconstruction accuracy of AE signals. In this study, an improved SGMD (ISGMD) method is proposed, which improves the adaptability of the algorithm to different signals by constructing an adaptive threshold mechanism, uses the mirror extension technology to eliminate the endpoint effect, and introduces the entropy theory for effective component screening and signal reconstruction. To modify the header, double-click in the Header section at the top of this page. Fill in the author and article titles. To insert images in Word, position the cursor at the insertion point and either use Insert | Picture | From File or copy the image to the Windows clipboard. 2. Theoretical Analysis 2.1. Symplectic Geometric Modal Decomposition Algorithm 2.1.1. Sub-section Headings The core of Symplectic Geometric Mode Decomposition (SGMD) is to obtain the trajectory matrix by reconstructing the phase space of the acquired signal. Then, the symplectic geometric similarity transformation is carried out to obtain the eigenvalues and eigenvectors under the symplectic geometric framework, and the corresponding eigenvectors are used to reconstruct the single-component signal. The process of the symplectic geometric modal 42 decomposition algorithm can be divided into the following four stages: (1) Phase space reconstruction The phase space of the original sequence signal x , ,⋯ , (n represents the signal length) is reconstructed by the Tankens embedding theorem, and the trajectory matrix X of the sequence signal is constructed. X ⋮ ⋮ … ⋮ ⋯ ⋮ 1 Among them, d is the embedding dimension, and its value is determined by the power spectral density (PSD) method: the maximum peak frequency of the PSD of the calculated signal is , and d=n/3 is taken when the ⁄ <10⁻³ is taken, otherwise d=1.2 ⁄ is taken. The delay time τ is determined by an autocorrelation function. (2) QR feature decomposition After the trajectory matrix is constructed, the eigenvalues and eigenvectors are further solved by QR feature decomposition. Firstly, the covariance matrix A=XᵀX is constructed, and the Hamilton matrix is established: M 0 0 2 Convert M to standard by symplectic geometric similarity transformation: 0 0 3 where W is the upper triangular matrix, and its eigenvaluesλ₁,…,λd satisfy . Subsequently, based on the eigenvector , the initial single-component is calculated: 4 In this case, the reconstruction matrix Z is composed of the initial single-component reconstruction matrix Z_i group d: Z ⋯ that is, Z is a m*d reconstruction matrix. (3) Diagonal averaging After solving the reconstruction matrix Z, it needs to be converted into the required one-dimensional time series, so the diagonal averaging method is used. For the element Z in the matrix (1≤ i≤m,1≤ j≤d), let ∗ , , ∗ , , m n 1 . If m