Tensor Singular Spectrum Decomposition Algorithm Based on Permutation Entropy for Rolling Bearing Fault Diagnosis

Variational mode decomposition is a new signal decomposition method, which can process non-linear and non-stationary signals. It can overcome the problems of mode mixing and compensate for the shortcomings in empirical mode decomposition. Permutation entropy is a method which can detect the randomness and kinetic mutation behavior of a time series. It can be considered for use in fault diagnosis. The complexity of wind power generation systems means that the randomness and kinetic mutation behavior of their vibration signals are displayed at different scales. Multi-scale permutation entropy analysis is therefore needed for such vibration signals. This research investigated a method based on variational mode decomposition and permutation entropy for the fault diagnosis of a wind turbine roller bearing. Variational mode decomposition was adopted to decompose the bearing vibration signal into its constituent components. The components containing key fault information were selected for the extraction of their permutation entropy. This entropy was used as a bearing fault characteristic value. The nearest neighbor algorithm was employed as a classifier to identify faults in a roller bearing. The experimental data showed that the proposed method can be applied to wind turbine roller bearing fault diagnosis.

Tensor decomposition is one of the model reduction techniques for compressing deep neural networks. Existing methods use either Tucker decomposition (TD) or Canonical Polyadic decomposition (CPD) for model compression, but none of them tried to combine those two methods, owing to the complexity of choosing a proper decomposition method for each layer. In this paper, we adopted the automatic tuning technique to design an algorithm that can mix both tensor decomposition methods, called Mixed Tensor Decomposition (MTD). The goal is to achieve better compression ratio while keeping similar accuracy as the original models. We used VGG type networks for the case study since they are relatively heavy and computationally expensive. We first studied the relation of model accuracy and compression ratio for Tucker and CPD applying to convolution neural networks (CNN). Based on the studied results, we designed a strategy to select the most suitable decomposition method for each layer, and further fine-tunes the models to recover the accuracy. We have conducted experiments using VGG11 and VGG16 with CIFAR10 dataset, and compared MTD with other tensor decomposition algorithms. The results show that MTD can achieve compression ratio 32 × and 37 × for VGG11 and VGG16 respectively with less than 1% accuracy drops, which is much better than the state-of-the-art tensor decomposition algorithms for model compression.

The separation of Electroencephalography (EEG) sources is a typical application of tensor decompositions in biomedical engineering. The objective of most approaches studied in the literature consists in providing separate spatial maps and time signatures for the identified sources. However, for some applications, a precise localization of each source is required. To achieve this, a two-step approach has been proposed. The idea of this approach is to separate the sources using the canonical polyadic decomposition in the first step and to employ the results of the tensor decomposition to estimate distributed sources in the second step, using the so-called disk algorithm. In this paper, we propose to combine the tensor decomposition and the source localization in a single step. To this end, we directly impose structural constraints, which are based on a priori information on the possible source locations, on the factor matrix of spatial characteristics. The resulting optimization problem is solved using the alternating direction method of multipliers, which is incorporated in the alternating least squares tensor decomposition algorithm. Realistic simulations with epileptic EEG data confirm that the proposed single-step source localization approach outperforms the previously developed two-step approach.

A novel classification strategy of motor imagery EEG signals utilizing WT-PSR-SVD-based MTSVM

CANDECOMP/PARAFAC (CP) tensor decomposition is a popular unsupervised machine learning method with numerous applications. This process involves modeling a high-dimensional, multi-modal array (a tensor) as the sum of several low-dimensional components. In order to decompose a tensor, one must solve an optimization problem, whose objective is often given by the sum of the squares of the tensor and decomposition model entry differences. One algorithm occasionally utilized to solve such problems is CP-OPT-DGN, a damped Gauss-Newton all-at-once optimization method for CP tensor decomposition. However, there are currently no published results that consider the decomposition of large-scale (with up to billions of non-zeros), sparse tensors using this algorithm. This work considers the decomposition of large-scale tensors using an efficiently implemented CP-OPT-DGN method. It is observed that CP-OPT-DGN significantly outperforms CP-ALS (CP-Alternating Least Squares) and CP-OPT-QNR (a quasi-Newton-Raphson all-at-once optimization method for CP tensor decomposition), two other widely used tensor decomposition algorithms, in terms of accuracy and latent behavior detection.

We present a new computational approach to analyse nystagmus waveforms. Our framework is designed to fully characterise the state of the nystagmus, aid clinical diagnosis and to quantify the dynamical changes in the oscillations over time. Both linear and nonlinear analyses of time series were used to determine the regularity and complexity of a specific homogenous phenotype of nystagmus. Two-dimensional binocular eye movement recordings were carried out on 5 adult subjects who exhibited a unilateral, uniplanar, vertical nystagmus secondary to a monocular late-onset severe visual loss in the oscillating eye (the Heimann-Bielschowsky Phenomenon). The non-affected eye held a central gaze in both horizontal and vertical planes (± 10 min. of arc). All affected eyes exhibited vertical oscillations, with mean amplitudes and frequencies ranging from 2.0°–4.0° to 0.25–1.5 Hz, respectively. Unstable periodic orbit analysis revealed only 1 subject exhibited a periodic oscillation. The remaining subjects were found to display quasiperiodic (n = 1) and nonperiodic (n = 3) oscillations. Phase space reconstruction allowed attractor identification and the computation of a time series complexity measure—the permutation entropy. The entropy measure was found to be able to distinguish between a periodic oscillation associated with a limit cycle attractor, a quasiperiodic oscillation associated with a torus attractor and nonperiodic oscillations associated with higher-dimensional attractors. Importantly, the permutation entropy was able to rank the oscillations, thereby providing an objective index of nystagmus complexity (range 0.15–0.21) that could not be obtained via unstable periodic orbit analysis or attractor identification alone. These results suggest that our framework provides a comprehensive methodology for characterising nystagmus, aiding differential diagnosis and also permitting investigation of the waveforms over time, thereby facilitating the quantification of future therapeutic managements. In addition, permutation entropy could provide an additional tool for future oculomotor modelling.

An echo state network (ESN) is an efficient recurrent neural network (RNN) that is widely used in time series prediction tasks due to its simplicity and low training cost. However, the "black-box" nature of reservoirs hinders the development of ESN. Although a large number of studies have concentrated on reservoir interpretability, the perspective of reservoir modeling is relatively single, and the relationship between reservoir richness and reservoir projection capacity has not been effectively established. To tackle this problem, a novel reservoir interpretability framework based on permutation entropy (PE) theory is proposed in this paper. In structure, this framework consists of reservoir state extraction, PE modeling, and PE analysis. Based on these, the instantaneous reservoir states and neuronal time-varying states are extracted, which are followed by phase space reconstruction, sorting, and entropy calculation. Firstly, the obtained instantaneous state entropy (ISE) and global state entropy (GSE) can measure reservoir richness for interpreting good reservoir projection capacity. On the other hand, the multiscale complexity-entropy analysis of global and neuron-level reservoir states is performed to reveal more detailed dynamics. Finally, the relationships between ESN performance and reservoir dynamic are investigated via Pearson correlation, considering different prediction steps and time scales. Experimental evaluations on several benchmarks and real-world datasets demonstrate the effectiveness and superiority of the proposed reservoir interpretability framework.

A new fault feature extraction method of rolling bearings based on the improved self-selection ICEEMDAN-permutation entropy

Group analysis of ongoing EEG data based on fast double-coupled nonnegative tensor decomposition

In general, a vibration signal consists of several frequency modulation (FM) components. Every component contains different information, and can be characterized by its instantaneous amplitude (IA) and instantaneous phase (IP). In engineering applications, conventional time-frequency analysis methods and signal decomposition methods have shown their power in investigating features of the vibration signal. However, they are limited in resolution and it is hard to analyze these FM components individually. To overcome these deficiencies, a novel signal decomposition algorithm, named time-frequency distribution decomposition (TFDD), is proposed in this paper, which reconstructs one FM component of the signal at a time by estimating its IP and IA. The IA and IP are approximated by two polynomial functions respectively. One important advantage of TFDD is that it can directly extract the component we are interested in. Therefore, we can analyze the key component of the signal with little influence from other components. This will help us to characterize the vibration signal more deeply. Furthermore, it is very stable to noise. This is conductive to protecting the information of the vibration signal. The effectiveness of the TFDD is validated by a numerical simulation and the study of the vibration response signal collected from a viscoelastic sandwich structure (VSS). From the value of permutation entropy of the component extracted by TFDD, the looseness state of the VSS is recognized.

Reliable detection of incipient faults in rotating machinery under noisy environments and varying speeds is essential for ensuring operational safety and noise reduction. This study explores the potential of ordinal pattern (OP)-based methods for acoustic and vibration signal analysis in fault diagnosis, leveraging their ability to capture underlying modulation structures often masked by background noise. Two types of OP-based methods are investigated: 1. Statistical approaches, including Permutation Entropy (PE) and its amplitude-sensitive extensions-Dispersion Entropy, Bubble Entropy, Amplitude-Aware PE, and improved PE. 2. Time-domain decomposition methods, specifically Ordinal Pattern Mode Decomposition (OPMD), utilize OP-based filters to extract dominant oscillatory and narrowband components iteratively. Theoretical analysis confirms that OPMD outperforms Empirical Mode Decomposition (EMD) in preserving modulation patterns. The study was conducted in a noisy industrial environment. Acoustic signals were recorded, while vibration signals were simultaneously acquired for comparative analysis. The results on five bearing conditions (healthy and faulty) demonstrate that both PE-based approaches and OPMD applied to acoustic signals effectively detect faults. However, high noise levels can distort ordinal pattern probability distributions, potentially impacting detection performance. Despite this, the proposed methods outperform classical signal processing techniques and offer valuable insights for noise-aware diagnostics in industrial settings.

Chaos has been widely combined with cryptography in the field of information security, especially, a considerable amount of studies of generating pseudo-random numbers based on chaotic systems have been proposed in recent decades. However, many of them are easy to be attacked via utilizing the nonlinear prediction method based on phase space reconstruction and other analysis. Furthermore, under the finite precision environment of computer simulation, there does not exist a random sequence which is truly non-periodic. Unfortunately, few researches had made a related analysis on the above two discussions. This paper is devoted to designing a pseudo-random number generator based on coupled map lattice with time-varying delay, analyzing the random properties of the generated pseudo-random numbers and discussing the dynamical degradation of the system under finite precision of computer simulation. The proposed scheme merely depends on the determining equation; thus, the algorithm itself is not complex, which does not impose high demand on computer hardware and its efficiency is excellent. In order to meet the requirements of using the proposed pseudo-random number generator in cryptography and other practical engineering applications, the proposed pseudo-random number generator is subjected to statistical tests utilizing the well-known test suites, such as NIST SP800-22 and TestU01. Moreover, other related properties, such as permutation entropy, invariant distribution, degradation of dynamical characteristics and parameter test, are also investigated. All results illustrate that the new pseudo-random number generator can generate a high percentage of available pseudo-random numbers for scientific computer simulation and practical applications in the field of information security.

The present manuscript is intended to review few applications of tensor decomposition model in array signal processing. Tensor decomposition models like HOSVD, SVD and PARAFAC are useful in signal processing. In this paper we shall use higher order tensor decomposition in signal processing. Also, a novel orthogonal non-iterative tensor decomposition technique (SUSVD), which is scalable to arbitrary high dimensional tensor, has been applied in MIMO channel estimation. The SUSVD provides a tensor model with hierarchical tree structure between the factors in different dimensions. We shall use a new model known as PARATREE, which is related to PARAFAC tensor models. The PARAFAC and PARATREE both describe a tensor as a sum of rank-1 tensors, but PARATREE has several advantages over PARAFAC, when it is applied as a lower rank approximation technique. PARATREE is orthogonal, fast and reliable to compute, and the order of the decomposition can be adaptively adjusted. The low rank PARATREE approximation has been applied to measure noise suppression for tensor valued MIMO channel sounding measurements.

The widespread use of multi-sensor technology and the emergence of big datasets has highlighted the limitations of standard flat-view matrix models and the necessity to move towards more versatile data analysis tools. We show that higher-order tensors (i.e., multiway arrays) enable such a fundamental paradigm shift towards models that are essentially polynomial and whose uniqueness, unlike the matrix methods, is guaranteed under verymild and natural conditions. Benefiting fromthe power ofmultilinear algebra as theirmathematical backbone, data analysis techniques using tensor decompositions are shown to have great flexibility in the choice of constraints that match data properties, and to find more general latent components in the data than matrix-based methods. A comprehensive introduction to tensor decompositions is provided from a signal processing perspective, starting from the algebraic foundations, via basic Canonical Polyadic and Tucker models, through to advanced cause-effect and multi-view data analysis schemes. We show that tensor decompositions enable natural generalizations of some commonly used signal processing paradigms, such as canonical correlation and subspace techniques, signal separation, linear regression, feature extraction and classification. We also cover computational aspects, and point out how ideas from compressed sensing and scientific computing may be used for addressing the otherwise unmanageable storage and manipulation problems associated with big datasets. The concepts are supported by illustrative real world case studies illuminating the benefits of the tensor framework, as efficient and promising tools for modern signal processing, data analysis and machine learning applications; these benefits also extend to vector/matrix data through tensorization. Keywords: ICA, NMF, CPD, Tucker decomposition, HOSVD, tensor networks, Tensor Train.

The vibration signals of diesel include excess noise that must be eliminated before extraction of characteristic parameters. Firstly, the effects of vibration-signal de-noising among Fourier transform, wavelet decomposition and wavelet packet decomposition are compared. Secondly, singular value decomposition is applied to de-noising vibration signals. Finally, a new de-noise method integrated with wavelet packet and singular value is presented. In this method, vibration signals are decomposed by wavelet packet, and the wavelet packet coefficient is de-noised by singular value decomposition again. The results indicate that the new de-noising method is the best. The SNR (signal-to-noise ratio) of the vibration signals of a diesel cylinder lid is the highest. The diesel vibration waveforms of combustion and valve become clear and the extracted characteristic parameters become more precise.