Yong Chang

Yong Chang

Auto-generated profile, based on publicly available information

Yong Chang

School of Electrical Engineering and Information, Southwest Petroleum University, Chengdu, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 June 2024 in IEEE Access
Verified
Journal Article
Open access
YCYong Chang
Yong Chang
GBGuangqing Bao
Guangqing Bao
This study addresses the challenges posed by the strong noise and nonstationary characteristics of vibration signals to enhance the efficiency and accuracy of rolling-bearing fault diagnosis in electric motors. A fault diagnosis model is proposed based on improved variational mode decomposition (VMD) and a convolutional neural network bidirectional long short-term memory (CNN-BiLSTM). In the feature extraction stage, the Osprey-Cauchy-Sparrow search algorithm (OCSSA) optimizes the modal number K and penalty coefficient α of the VMD, facilitating the decomposition and reconstruction of the original vibration signals to extract fault features based on the minimum envelope entropy criterion. In the fault diagnosis stage, the mean, variance, peak value, kurtosis, RMS value, peak-to-average ratio (PAR), impulse factors, form factor, and clearance factor were computed from the reconstructed signals. These indicators were used to construct a feature vector for each sample, serving as the input for the OCSSA-VMD-CNN-BiLSTM fault diagnosis model, which quickly and accurately identifies the fault types. Experimental verification confirms that this method enhances the speed and accuracy of rolling-bearing fault identification compared to traditional approaches.

1 April 2021 in IET Signal Processing
Verified
Journal Article
Open access
PDF file
YCYong Chang
Yong Chang
CYchang yong
chang yong
SCSikai Cheng
Sikai Cheng
THTing He
Ting He
QYQiaoling Yang
Qiaoling Yang
In order to make accurate judgements of rolling bearing main fault types using the small sample size fault data set, a novel approach is put forward that combines particle swarm optimisation kernel fuzzy C‐means (PSO‐KFCM) and variational mode decomposition (VMD). Firstly, by calculating the centre frequency and Pearson correlation coefficient of each mode function of VMD, the decomposition level K of VMD is determined, and the optimal decomposition result is obtained. The singular value decomposition method was used to extract a characteristic value corresponding to the main fault types of bearings from the optimal decomposition results, and faulty feature sample space was established. Then, the kernel function parameters and the initial clustering centre were used as optimisation variables. The PSO algorithm was used to solve the clustering model. The clustering centre of each fault type under the optimal classification result was obtained, and the fault diagnosis model was established. Finally, different fault classification methods are compared, and the conclusions drawn from the experiment show that the method can achieve good results in bearing fault diagnosis. The accuracy of fault classification was improved obviously.

21 February 2024 in Electronics Letters
Verified
Journal Article
Open access
CYChang Yong
Chang Yong
HTHe Ting
He Ting
CPChen Peng
Chen Peng
This study enhances the traditional sparrow search algorithm (SSA) to address its weaknesses, such as poor convergence rates and precision due to a tendency to fall into local optima. The improved version, OCSSA, integrates the Osprey optimization algorithm (OOA) and Cauchy mutation. Logistic chaotic mapping is used for initial population generation to increase genetic diversity. OOA boosts global exploration in the producer phase, and Cauchy mutation in the scroungers phase disrupts suboptimal solutions, enhancing the algorithm's ability to avoid local optima. OCSSA's performance, validated through ten benchmark functions and fault diagnosis optimization tasks, significantly improves convergence speed and accuracy, proving its effectiveness in complex optimization challenges.