K-singular Value Decomposition Research Articles

A novel gearbox local fault feature extraction method based on quality coefficient and dictionary learning

The performance of sparse decomposition is directly determined by the similarity between impact atoms and the actual fault impact waveform. The shift-invariant K-singular value decomposition (K-SVD) dictionary learning algorithm is capable of training impact patterns from vibration signals collected by sensors to construct impact atoms, thereby extracting fault impact components from the vibration signals. However, the impact pattern training using the shift-invariant K-SVD algorithm is influenced by the presence of harmonics and white noise in the gear transmission system vibration signals. To solve the above problems, a novel gearbox local fault feature extraction method based on the quality coefficient and dictionary learning is proposed in this paper. Firstly, the original signal is decomposed into a series of intrinsic mode functions (IMFs) by empirical mode decomposition. Then, a new quality coefficient is proposed by comprehensively considering the intensity of the impact, harmonics and noise components in each IMF, as well as the degree of correlation with the original signal. The IMF with the largest quality coefficient is used to train the impact pattern and solve the sparse coefficients. Finally, the orthogonal matching pursuit algorithm is adopted to solve the sparse coefficients, which are used to reconstruct the fault impact response signal from the dictionary. Simulation and experimental analysis demonstrate the superior performance of the proposed method compared to other state-of-the-art methods.

Partial Discharge Signal Denoising Algorithm Based on Aquila Optimizer–Variational Mode Decomposition and K-Singular Value Decomposition

Partial discharge (PD) is a primary factor leading to the deterioration of insulation in electrical equipment. However, it is hard for traditional methods to precisely extract PD signals in increasingly complex engineering environments. This paper proposes a new PD signal denoising method combining Aquila Optimizer–Variational Mode Decomposition (AO-VMD) and K-Singular Value Decomposition (K-SVD) algorithms. Firstly, the AO algorithm optimizes critical parameters of the VMD algorithm. For the PD signal overwhelmed by noise, the AO-VMD algorithm can decompose it and reconstruct it by using kurtosis. In this process, the majority of the noise is removed, and the characteristics of the original signal are shown. Subsequently, the K-SVD algorithm performs sparse decomposition on the signal after OA-VMD, constructs a learned dictionary, and captures the characteristics of the signal for continuous learning and updating. After the dictionary learning is completed, the best matching atoms from the dictionary are selected to precisely reconstruct the original noiseless signal. Finally, the proposed method is compared with three traditional algorithms, Adaptive Ensemble Empirical Mode Decomposition (AEEMD), SVD-VMD, and the Adaptive Wavelet Multilevel Soft Threshold algorithm, on the simulated signal and the actual engineering signal. The results both demonstrate that the algorithm proposed by this paper has superior noise reduction and signal extraction performance.

A Filling Method Based on K-Singular Value Decomposition (K-SVD) for Missing and Abnormal Energy Consumption Data of Buildings

Massive data can be collected from meters to analyze the energy use behavior and detect the operation problems of buildings. However, missing and abnormal data often occur for the raw data. Effective data filling and smoothing methods are required to improve data quality before conducting the analysis. This paper introduces a data filling method based on K-SVD. The complete dictionary is trained and then utilized to reconstruct incomplete samples to fill the missing or abnormal data. The impacts of the dictionary size, the data missing continuity, and the sample size on the performance of the proposed method are studied. The results show that a smaller dictionary size is recommended considering the computational complexity and accuracy. The K-SVD method outperforms traditional methods, showing a reduction in the MAPE and CVRMSE by 3.8–5.4% and 6.7–87.8%. The proposed K-SVD filling method performs better for non-consecutive missing data, with an improvement in the MAPE and CVRMSE by 0.1–4% and 5.1–6.7%. Smaller training samples are recommended. The method proposed in this study would provide an effective solution for data preprocessing in building and energy systems.

On-line monitoring of membrane fouling based on an improved electrical measurement method.

On-line monitoring of membrane fouling is essential in the water treatment process. Drawbacks such as low-sensitivity and off-line limitations limit the application of existing methods. An on-line monitoring method based on Electrical Resistance Tomography (ERT) sensors is put forward in this paper. The Particle Swarm Optimization with Simulated Annealing (PSO-SA) algorithm is used in optimizing the topologies of finite element models in order to decrease the ill-posedness of sensitivity matrices. The deep denoising extreme learning machine with an auto-encoder model and the K-singular value decomposition algorithm are used in ERT reconstruction to improve imaging quality. The lift-wavelet is adopted in measuring the permeate flux to improve measuring accuracy. The ERT pixel values of the membrane module and the result of flux are used to analyze the fouling status. The results of membrane fouling experiments demonstrate the following: (1) Based on the local ERT pixels, the "two stage" phenomenon of membrane fouling can be observed. (2) In the early stage, the fouling distribution of the localized membrane module is consistent with its ERT pixels. (3) The deposition process of foulants for the localized membrane module is synchronized with the variation of ERT pixels. (4) The integrity of the membrane module can be detected according to the ERT pixels. Therefore, the novel method can effectively reflect the membrane fouling process, especially in the early stages of membrane fouling.

Sparse Regularization Based on Orthogonal Tensor Dictionary Learning for Inverse Problems

In seismic data processing, data recovery including reconstruction of the missing trace and removal of noise from the recorded data are the key steps in improving the signal-to-noise ratio (SNR). The reconstruction of seismic data and removal of noise becomes a sparse optimization problem that can be solved by using sparse regularization. Sparse regularization is a key tool in the solution of inverse problems. They are used to introduce prior knowledge and make the approximation of ill-posed inverses feasible. It deals with ill-posedness by replacing an ill-posed inverse problem with a well-posed problem that has a solution close to the true solution. In the last 2 decades, interest has shifted from linear toward nonlinear regularization methods even for linear inverse problems. In inverse problems, regularizations serve as stabilizing the solution of ill-posed inverse problems and give a solution that adequately fits measurements without producing unjustifiably complex artifacts. In this paper, we present a novel sparse regularization based on a tensor-based dictionary method for inverse problems (seismic data interpolation and denoising). This regularization avoids the vectorization step for sparse representation of seismic data during the reconstruction process. The key step in sparsifying signals is the choice of sparsity-promoting dictionary learning. The learning-based approach can adaptively sparsify datasets but has high computational complexity and involves no prior-constraint pattern information for the dataset. Many existing dictionary learning methods would be computationally infeasible for the high dimensional seismic data processing. These methods also destroy the essential information as well as it reduces the discriminability and expressibility of the signal, since they deal with vectorization. In this paper, the orthogonal tensor dictionary learning that learns a dictionary from the input data by employing orthogonality and separability is proposed as sparse regularization for the inverse problems. The performance of the proposed method was validated in seismic data interpolation and denoising individually as well as simultaneously. Numerical examples of synthetic and real seismic datasets demonstrate the validity of the proposed method. The SNR of the recovered data confirms that the proposed method is the most effective method than K-singular value decomposition and orthogonal dictionary learning methods.

Enhancing the robustness of ocean sound speed profile representation via interpretable deep matrix decomposition.

Developing an effective and robust representation model for ocean sound speed profiles (SSPs) is crucial for numerous ocean acoustic applications. However, the performance of existing sound speed profile (SSP) representation methods, such as empirical orthogonal function and K-singular value decomposition, heavily relies on the number of selected basis functions. This could lead to overfitting of noise, as these methods are unable to distinguish between signals and noise during the basis function learning process. To overcome these limitations and effectively learn a large number of basis functions with strong representation power from potentially noisy SSP data, we propose a novel algorithm called deep matrix decomposition (deep MD). This algorithm utilizes untrained deep neural networks as priors to reject noise within the interpretable matrix decomposition framework. To achieve optimal performance with deep MD, we propose a stopping strategy based on the rank estimate to determine the termination epoch. Experimental results using real-life datasets demonstrate that deep MD is robust against various types of noise and outperforms traditional SSP representation methods in terms of SSP reconstruction and characterizing the transmission loss in underwater acoustics.

Nectarine Disease Identification Based on Color Features and Label Sparse Dictionary Learning with Hyperspectral Images

Fruit cracking and rust spots are common diseases of nectarines that seriously affect their yield and quality. Therefore, it is essential to construct fast and accurate disease-identification models for agricultural products. In this paper, a sparse dictionary learning method was proposed to realize the rapid and nondestructive identification of nectarine disease based on multiple color features combined with improved LK-SVD (Label K-Singular Value Decomposition). According to the color characteristics of the nectarine itself and the significant color differences existing in the three categories of nectarine (diseased, normal, and background parts), multiple color spaces of RGB, HSV, Lab, and YCbCr were studied. It was concluded that the G channel in RGB space, Y channel in YCbCr space, and L channel in Lab space can better distinguish the diseased part from the other parts. At the model-training stage, pixels of the diseased, normal, and background parts in the nectarine image were randomly selected as the initial training sets, and then, the neighboring image blocks of the pixels were selected to construct the feature vectors based on the above color space channels. An improved LK-SVD dictionary learning algorithm was proposed that integrated the category label into the process of dictionary learning, and thus, an over-complete feature dictionary with significant discrimination was obtained. At the model-testing stage, the orthogonal matching pursuit (OMP) algorithm was used for sparse reconstruction of the original data, which can obtain the classification categories based on the optimized feature dictionary. The experimental results show that the sparse dictionary learning method based on multi-color features combined with improved LK-SVD can identify fruit cracking and rust spot diseases of nectarines quickly and accurately, and the average overall classification accuracies were 92.06% and 88.98%, respectively, which were better than those of k-nearest neighbor (KNN), support vector machine (SVM), DeepLabV3+, and Unet++; the identification results of DeepLabV3+ and Unet++ were also relatively high, but their average time costs were much higher, requiring 126.46~265.65 s. It is demonstrated that this study can provide technical support for disease identification in agricultural products.

Adaptive VMD-K-SVD-Based Rolling Bearing Fault Signal Enhancement Study.

To address the challenges associated with nonlinearity, non-stationarity, susceptibility to redundant noise interference, and the difficulty in extracting fault feature signals from rolling bearing signals, this study introduces a novel combined approach. The proposed method utilizes the variational mode decomposition (VMD) and K-singular value decomposition (K-SVD) algorithms to effectively denoise and enhance the collected rolling bearing signals. Initially, the VMD method is employed to separate the overall noise into intrinsic mode functions (IMFs), reducing the noise content within each IMF. To optimize the mode component, K, and the penalty factor, α, in VMD, an improved arithmetic optimization algorithm (IAOA) is employed. This ensures the selection of optimal parameters and the decomposition of the signal into a set of IMFs, forming the original dictionary. Subsequently, the signals are decomposed into multiple IMFs using VMD, and an original dictionary is constructed based on these IMFs. K-SVD is then applied to the original dictionary to further reduce the noise in each IMF, resulting in a denoised and enhanced signal. To validate the efficacy of the proposed method, rolling bearing signals collected from Case Western Reserve University (CWRU) and thrust bearing test rigs were utilized. The experimental results demonstrate the feasibility and effectiveness of the proposed approach in denoising and enhancing the rolling bearing signals.

Weighted IMF-based denoising and multi-scale kurtosis weighted K singular value decomposition dictionary learning model for bearing fault diagnosis

Generally, bearing early failure-induced impulses is weak and easily submerged by strong background noise. How to extract weak impulses is a big challenge. In this paper, based on the K Singular Value Decomposition (KSVD) algorithm, an improved dictionary learning model (WID-MSKW-KSVD) is proposed, which integrates a special denoising method and a multi-scale transformation into a typical dictionary learning model and it successfully overcomes two major shortcomings of traditional KSVD model including the lack of multi-scale learning process and the ability of dictionary atoms to resist strong noise interference. Furthermore, the kurtosis of the envelope spectrum is weighted into the proposed model as a fault matrix to enhance the fault feature. Finally, the feasibility of the proposed model is demonstrated by numerical simulation and practical experiments, and the superiority and reliability of this model in suppressing noise interference and extracting fault features are verified by comparison with other state-of-the-art methods.

Dictionary Learning for Single-Channel Passive Seismic Denoising

Abstract Passive seismic denoising is mostly performed using a simple band-pass filter, which can be problematic when signal and noise share the same frequency band. More advanced passive seismic denoising methods take advantage of fixed-basis transforms, for example, the wavelet, to remove noise. Here, we present an open-source package for data-driven denoising based on adaptively learning sparse transform. Contrary to the fixed-basis transforms, the proposed method belongs to the adaptive-basis transforms. We learn the 1D features embedded in the passive seismic data from all the available waveform data sets without requiring spatial coherency in a data-driven way. Thus, the new method is flexible to apply in any passive seismic monitoring project because of its data-driven and single-channel nature when implemented. Considering the computationally expensive K-singular-value-decomposition (KSVD) in the traditional dictionary learning framework, we suggest applying a fast SVD-free dictionary learning method that can be readily applicable to process massive seismic data during passive seismic monitoring. The proposed method is applied to two synthetic data examples and three real passive seismic data sets to demonstrate its effectiveness in improving the signal-to-noise ratio, and its potential in applications like arrival picking. The open-source reproducible package can be found in the Data and Resources section.

Pulsation artifact removal from intra-operatively recorded local field potentials using sparse signal processing and data-specific dictionary.

Neural recordings frequently get contaminated by ECG or pulsation artifacts. These large amplitude components can mask the neural patterns of interest and make the visual inspection process difficult. The current study describes a sparse signal representation strategy that targets to denoise pulsation artifacts in local field potentials (LFPs) recorded intraoperatively. To estimate the morphology of the artifact, we first detect the QRS-peaks from the simultaneously recorded ECG trace as an anchor point. After the LFP data has been epoched with respect to each beat, a pool of raw data segments of a specific length is generated. Using the K-singular value decomposition (K-SVD) algorithm, we constructed a data-specific dictionary to represent each contaminated LFP epoch in a sparse fashion. Since LFP is aligned to each QRS complex and the background neural activity is uncorrelated to the anchor points, we assumed that constructed dictionary will be formed to mainly represent the pulsation artifact. In this scheme, we performed an orthogonal matching pursuit to represent each LFP epoch as a linear combination of the dictionary atoms. The denoised LFP data is thus obtained by calculating the residual between the raw LFP and its approximation. We discuss and demonstrate the improvements in denoised data and compare the results with respect to principal component analysis (PCA). We noted that there is a comparable change in the signal for visual inspection to observe various oscillating patterns in the alpha and beta bands. We also see a noticeable compression of signal strength in the lower frequency band (<13 Hz), which was masked by the pulsation artifact, and a strong increase in the signal-to-noise ratio (SNR) in the denoised data.Clinical Relevance- Pulsation artifact can mask relevant neural activity patterns and make their visual inspection difficult. Using sparse signal representation, we established a new approach to reconstruct the quasiperiodic pulsation template and computed the residue signal to achieve noise-free neural activity.

A sea clutter suppression algorithm for over-the-horizon radar based on dictionary learning and subspace estimation

Detecting a ship target by over-the-horizon radar (OTHR) is seriously affected by sea clutter. This paper proposes a clutter suppression algorithm based on dictionary learning and subspace estimation (DLSE). First, the K-singular value decomposition (K-SVD) is used for dictionary learning and sparse representation of the sea clutter. Then, the orthogonal matching pursuit (OMP) is used to reconstruct the sea clutter component to suppress the outliers. Finally, the clutter covariance matrix is calculated using the reconstructed clutter spectrum, and the clutter subspace of the covariance matrix is estimated to achieve clutter suppression. In this paper, the K-SVD is improved to preserve the phase information of the complex signal. The sea clutter spectrum, after sparse representation and reconstruction, is not impacted by outliers in neighboring cells. Therefore, the clutter covariance matrix has a better estimate accuracy than existing subspace decomposition algorithm. The adaptive parameter estimate method also enhances the adaptability of the DLSE. The experimental results of real data demonstrate that the DLSE is as sophisticated as existing subspace decomposition algorithms while having a higher output signal-to-clutter-plus-noise ratio (SCNR) and peak-to-side lobe ratio (PSLR), improving about 2-5 dB. Results of outlier suppression attest to the robustness of the DLSE. Under various coherent integration times (CIT) and frequencies, the DLSE has the best clutter suppression performance among the comparison algorithms.

Compressed sampling of gearbox oil temperature signal based on an improved intrinsic mode function basis mixed-dictionary

The oil temperature signal of gearbox is always redundant in long-term use, which will occupy a lot of computer storage space. An improved intrinsic mode function basis mixed-dictionary K-singular value decomposition (IMDK-SVD) algorithm for compressed sampling of the aperiodic oil temperature signal is proposed. Firstly, an improved mixed-dictionary is designed for sparse representation of the aperiodic oil temperature signal, this mixed-dictionary is composed of a class-specific dictionary that extracts the commonness of the same group of data and a shared dictionary that extracts the difference of the different group of data. Secondly, the measurement matrix with variable-step sampling is proposed, and the sampling points is adaptively determined by the information entropy index of signal. Benefitting from these improvements, the advantages of high reconstruction accuracy and saving sampling points as possible are achieved, and the effectiveness of proposed method is verified based on the simulation signal and the experimental signal.

Comparative Analysis of Digital Elevation Model Generation Methods Based on Sparse Modeling

With the spread of aerial laser bathymetry (ALB), seafloor topographies are being measured more frequently. Nevertheless, data deficiencies occur owing to seawater conditions and other factors. Conventional interpolation methods generally need to produce digital elevation models (DEMs) with sufficient accuracy. If the topographic features are considered as a basis, the DEM should be reproducible based on a combination of such features. The purpose of this study is to develop new DEM generation methods based on sparse modeling. Based on a review of the definitions of sparsity, we developed DEM generation methods based on a discrete cosine transform (DCT), DCT with elastic net, K-singular value decomposition (K-SVD), Fourier regularization, wavelet regularization, and total variation (TV) minimization, and conducted a comparative analysis. The developed methods were applied to artificially deficient DEM and ALB data, and their accuracy was evaluated. Thus, as a conclusion, we can confirm that the K-SVD method is appropriate when the percentage of deficiencies is low, and that the TV minimization method is appropriate when the percentage of deficiencies is high. Based on these results, we also developed a method integrating both methods and achieved an RMSE of 0.128 m.

Orthogonal dictionary learning based on l 4-Norm maximisation for seismic data interpolation

Due to geological conditions, acquisition environment, and economic restrictions, acquired seismic data are often incomplete and irregularly distributed, and this affects subsequent migration imaging and inversion. Sparse constraint-based methods are widely used for seismic data interpolation, including fixed-base transform and dictionary learning. Fixed-base transform methods are fast and simple to implement, but the basis function needs to be pre-selected. The dictionary learning method is more adaptive, and provides a means of learning the sparse representation from corrupted data. K-singular value decomposition (K-SVD) is a classical dictionary learning method that combines sparse coding and dictionary updating iteratively. However, the dictionary atoms are updated column-by-column, leading to high computational complexity due to long SVD calculation times. In this study, we evaluated the dictionary learning method via l 4-norm maximisation using an orthogonal dictionary, which is different from the traditional l 0-norm or l 1-norm minimisation, and interpolated the missing traces in the projection onto convex sets (POCS) framework. The optimal objection function is convex, but can be solved using a simple and efficient Matching, Stretching and Projection (MSP) algorithm, which greatly reduces the dictionary learning time. Numerical experiments using synthetic and field data demonstrate the effectiveness of the proposed method.

Sparse adversarial image generation using dictionary learning

Adversarial examples are used to evaluate the robustness of convolutional neural networks (CNNs) to input perturbations. Researchers have proposed different types of adversarial examples that attack CNNs to fool them. These attacks pose a serious threat to applications that use deep neural networks. Existing methods for adversarial image generation struggle in maintaining a balance between attack success rate and imperceptibility (measured in terms of ℓ2-norm) of the generated adversarial examples. Recent sparse methods for this problem focus on limiting the number of pixels in an image but do not cater to the overall imperceptibility of the adversarial images. To address these problems, we introduce adversarial attacks based on K-singular value decomposition sparse dictionary learning. The dictionary is learned using feature maps of the targeted images from the first layer of CNN. The proposed method is evaluated in terms of attack success rate and ℓ2-norm. The extensive experimentation shows our attack achieves a high success rate while maintaining a low imperceptibility score compared to state-of-the-art methods.

Interpretable deep dictionary learning for sound speed profiles with uncertainties.

Uncertainties abound in sound speed profiles (SSPs) measured/estimated by modern ocean observing systems, which impede the knowledge acquisition and downstream underwater applications. To reduce the SSP uncertainties and draw insights into specific ocean processes, an interpretable deep dictionary learning model is proposed to cater for uncertain SSP processing. In particular, two kinds of SSP uncertainties are considered: measurement errors, which generally exist in the form of Gaussian noises; and the disturbances/anomalies caused by potential ocean dynamics, which occur at some specific depths and durations. To learn the generative patterns of these uncertainties while maintaining the interpretability of the resulting deep model, the adopted scheme first unrolls the classical K-singular value decomposition algorithm into a neural network, and trains this neural network in a supervised learning manner. The training data and model initializations are judiciously designed to incorporate the environmental properties of ocean SSPs. Experimental results demonstrate the superior performance of the proposed method over the classical baseline in mitigating noise corruptions, detecting, and localizing SSP disturbances/anomalies.

SNR improvement for Φ-OTDR with sparse representation denoising method

A Rayleigh backscattering (RBS) signal denoising method based on sparse representation is proposed in this paper. The method can effectively reduce the noise of the RBS signal and improve the signal-to-noise ratio (SNR) of vibration location results for the phase-sensitive optical time-domain reflectometry (Φ-OTDR) system. In the experiments, the initial dictionary is constructed by discrete cosine transform, the dictionary matrix and sparse matrix are updated by the k-singular value decomposition method, and then RBS signal reconstruction is executed. In this process of reconstruction, the effective signals can be sparsely represented by the linear combination of dictionary atoms, while the noise signals are discarded as the residual between the original RBS signals and the reconstructed target signals, which makes the noise separated and improves the SNR of the system. To validate the feasibility and effectiveness of the proposed approach for the SNR enhancement, we have carried out experiments on the actual signals obtained from the Φ-OTDR system. The experimental result indicates that the average increment of SNR is 3.44 dB at 10 km, 20 km, 30 km, and 40 km of the optical fiber after using the sparse representation denoising method. Moreover, the vibration detection range is enhanced to 80 km and the SNR reaches 3.27 dB. This method provides a novel scheme to improve the SNR for the Φ-OTDR system.

Coherent Noise Attenuation by Kurtosis-Guided Adaptive Dictionary Learning Based on Variational Sparse Representation

In seismic data denoising, coherent noise is usually challenging to remove because it has similar features with signal. Therefore, attenuating coherent noise is of great importance for seismic data. In order to obtain a good denoising result, it is necessary to fully consider the features of coherent noise and choose the appropriate denoising methods. Here, we propose a kurtosis-guided adaptive dictionary learning (KGADL) algorithm based on variational sparse representation model. First, the variational sparse representation is to construct initial dictionary that depends on the seismic data, so that it can accurately contain the features of the seismic data, so as to improve the accuracy of sparse representation. Then, we use the K-singular value decomposition (K-SVD) algorithm to update the dictionary and introduce kurtosis to measure each atom after updating. Atoms with high kurtosis values usually exhibit strong irregularities and are considered noise, while atoms with low kurtosis values have more feature of valid waves and are considered signal. The atoms with low kurtosis values characterizing valid signal are retained to get the special dictionary that adapts to the complexity of the input seismic data, and this dictionary is used to suppress the coherent noise in seismic data. Finally, the denoising performance of the proposed method is illustrated by examples of both synthetic and field seismic data.

Intelligent Image Processing Technology for Badminton Robot under Machine Vision of Internet of Things

The present work aims to promote the development of intelligent image processing technology for badminton robots and optimize the application effect of badminton robots in national fitness. Firstly, the problems and common needs of the badminton robot currently in use are investigated. Secondly, a shuttlecock aerodynamic model is established to simulate the effects of air resistance and gravity on the aerial flight of shuttlecock. Besides, the convolution neural network (CNN) is combined with traditional image processing technology to denoise and recognize the collected shuttlecock images. Finally, the badminton robot vision system is constructed and its performance is tested. The results demonstrate that the image denoising method based on CNN and the traditional image processing method can effectively process and denoise the captured moving image. Under the noise level of [Formula: see text], the peak signal-to-noise ratio index of this method is better than the Gaussian Scale Model, k-Singular Value Decomposition, and Color Names methods, slightly better than that of the Multilayer Perceptron (MLP) network. In terms of the time consumed in processing the same number of pictures, the method reported here takes the least time. But when [Formula: see text], the MLP method has a better denoising effect because the noise is overlarge and the features are not easy to learn. Moreover, the detection accuracy of the optimized Single Shot MultiBox Detector (SSD) method adopted here is 79.0%. This accuracy is 1.7% higher than that of the traditional SSD method, and 2.3% higher than that of Faster Region-Convolutional Neural Network based on Region Proposal Network. The optimized network structure reported here provides a certain idea for the software design of the badminton robot.