Bearing incipient fault diagnosis based upon maximal spectral kurtosis TQWT and group sparsity total variation denoising approach

Localized faults in rolling bearing tend to result in periodic shocks and thus arouse periodic responses in the vibration signal. In this paper, a novel fault diagnosis method based on maximal spectral kurtosis tunable Q-factor wavelet transformation (TQWT) and group sparsity total variation denoising (GS-TVD) is proposed to address the issue of bearing incipient failure. Firstly, the range of Q-factor was pre-selected according to the spectral distribution of impulse component, and bearing vibration signal was transformed by the TQWT method. Then, the spectral kurtosis of each scale transform coefficients was calculated, and the optimal Q-factor and decomposition scale can be selected according to the kurtosis maximum principle. In order to remove the interference components and high-frequency noise from the reconstructed vibration signal generated by inverse TQWT, the GS-TVD approach is employed, thus the cyclic periodicity characteristic and transient impulses can be detected obviously. The two cases experimental results indicate that the proposed technique is more effective and applicable for bearing incipient fault diagnosis compared with traditional method

Support matrix machine: A review

Support vector machine (SVM) is one of the most studied paradigms in the realm of machine learning for classification and regression problems. It relies on vectorized input data. However, a significant portion of the real-world data exists in matrix format, which is given as input to SVM by reshaping the matrices into vectors. The process of reshaping disrupts the spatial correlations inherent in the matrix data. Also, converting matrices into vectors results in input data with a high dimensionality, which introduces significant computational complexity. To overcome these issues in classifying matrix input data, support matrix machine (SMM) is proposed. It represents one of the emerging methodologies tailored for handling matrix input data. The SMM method preserves the structural information of the matrix data by using the spectral elastic net property which is a combination of the nuclear norm and Frobenius norm. This article provides the first in-depth analysis of the development of the SMM model, which can be used as a thorough summary by both novices and experts. We discuss numerous SMM variants, such as robust, sparse, class imbalance, and multi-class classification models. We also analyze the applications of the SMM model and conclude the article by outlining potential future research avenues and possibilities that may motivate academics to advance the SMM algorithm

Sensor Signal and Information Processing II

In the current age of information explosion, newly invented technological sensors and software are now tightly integrated with our everyday lives. Many sensor processing algorithms have incorporated some forms of computational intelligence as part of their core framework in problem solving. These algorithms have the capacity to generalize and discover knowledge for themselves and learn new information whenever unseen data are captured. The primary aim of sensor processing is to develop techniques to interpret, understand, and act on information contained in the data. The interest of this book is in developing intelligent signal processing in order to pave the way for smart sensors. This involves mathematical advancement of nonlinear signal processing theory and its applications that extend far beyond traditional techniques. It bridges the boundary between theory and application, developing novel theoretically inspired methodologies targeting both longstanding and emergent signal processing applications. The topic ranges from phishing detection to integration of terrestrial laser scanning, and from fault diagnosis to bio-inspiring filtering. The book will appeal to established practitioners, along with researchers and students in the emerging field of smart sensors processing

Symmetry and Complexity

Symmetry and complexity are the focus of a selection of outstanding papers, ranging from pure Mathematics and Physics to Computer Science and Engineering applications. This collection is based around fundamental problems arising from different fields, but all of them have the same task, i.e. breaking the complexity by the symmetry. In particular, in this Issue, there is an interesting paper dealing with circular multilevel systems in the frequency domain, where the analysis in the frequency domain gives a simple view of the system. Searching for symmetry in fractional oscillators or the analysis of symmetrical nanotubes are also some important contributions to this Special Issue. More papers, dealing with intelligent prognostics of degradation trajectories for rotating machinery in engineering applications or the analysis of Laplacian spectra for categorical product networks, show how this subject is interdisciplinary, i.e. ranging from theory to applications. In particular, the papers by Lee, based on the dynamics of trapped solitary waves for special differential equations, demonstrate how theory can help us to handle a practical problem. In this collection of papers, although encompassing various different fields, particular attention has been paid to the common task wherein the complexity is being broken by the search for symmetry

Dynamic operability assessment : a mathematical programming approach based on Q-parametrization

Bibliography: pages 197-208.The ability of a process plant to guarantee high product quality, in terms of low variability, is emerging as a defining feature when distinguishing between alternative suppliers. The extent to which this can be achieved is termed a plant's dynamic operability and is a function of both the plant design and the control system design. In the limit, however, the closedloop performance is determined by the properties inherent in the plant. This realization of the interrelationship between a plant design and its achievable closed-loop performance has motivated research toward systematic techniques for screening inherently inferior designs. Pioneering research in the early 1980's identified right-half-plane transmission zeros, time delays, input constraints and model uncertainty as factors that limit the achievable closedloop performance of a process. Quantifying the performance-limiting effect of combinations of these factors has proven to be a challenging problem, as reflected in the literature. It is the aim of this thesis to develop a systematic procedure for dynamic operability assessment in the presence of combinations of performance-limiting factors. The approach adopted in this thesis is based on the Q-parametrization of stabilizing linear feedback controllers and involves posing dynamic operability assessment as a mathematical programming problet? In the proposed formulation, a convex objective function, reflecting a measure of closed-loop performance, is optimized over all stable Q, subject. to a set of constraints on the closed-loop behavior, which for many specifications of interest is convex. A discrete-time formulation is chosen so as to allow for the convenient hand.ling of time delays and time-domain constraints. An important feature of the approach is that, due to the convexity, global optimality is guaranteed. Furthermore, the fact that Q parametrizes all stabilizing linear feedback controllers implies that the performance at the optimum represents the best possible performance for any such controller. The results are thus not biased by controller type or tuning, apart from the requirement that the controller be linear

Compressed Sensing for Open-ended Waveguide Non-Destructive Testing and Evaluation

Ph. D. ThesisNon-destructive testing and evaluation (NDT&E) systems using open-ended waveguide (OEW) suffer from critical challenges. In the sensing stage, data acquisition is time-consuming by raster scan, which is difficult for on-line detection. Sensing stage also disregards demand for the latter feature extraction process, leading to an excessive amount of data and processing overhead for feature extraction. In the feature extraction stage, efficient and robust defect region segmentation in the obtained image is challenging for a complex image background. Compressed sensing (CS) demonstrates impressive data compression ability in various applications using sparse models. How to develop CS models in OEW NDT&E that jointly consider sensing & processing for fast data acquisition, data compression, efficient and robust feature extraction is remaining challenges. This thesis develops integrated sensing-processing CS models to address the drawbacks in OEW NDT systems and carries out their case studies in low-energy impact damage detection for carbon fibre reinforced plastics (CFRP) materials. The major contributions are: (1) For the challenge of fast data acquisition, an online CS model is developed to offer faster data acquisition and reduce data amount without any hardware modification. The images obtained with OEW are usually smooth which can be sparsely represented with discrete cosine transform (DCT) basis. Based on this information, a customised 0/1 Bernoulli matrix for CS measurement is designed for downsampling. The full data is reconstructed with orthogonal matching pursuit algorithm using the downsampling data, DCT basis, and the customised 0/1 Bernoulli matrix. It is hard to determine the sampling pixel numbers for sparse reconstruction when lacking training data, to address this issue, an accumulated sampling and recovery process is developed in this CS model. The defect region can be extracted with the proposed histogram threshold edge detection (HTED) algorithm after each recovery, which forms an online process. A case study in impact damage detection on CFRP materials is carried out for validation. The results show that the data acquisition time is reduced by one order of magnitude while maintaining equivalent image quality and defect region as raster scan. (2) For the challenge of efficient data compression that considers the later feature extraction, a feature-supervised CS data acquisition method is proposed and evaluated. It reserves interested features while reducing the data amount. The frequencies which reveal the feature only occupy a small part of the frequency band, this method finds these sparse frequency range firstly to supervise the later sampling process. Subsequently, based on joint sparsity of neighbour frame and the extracted frequency band, an aligned spatial-spectrum sampling scheme is proposed. The scheme only samples interested frequency range for required features by using a customised 0/1 Bernoulli measurement matrix. The interested spectral-spatial data are reconstructed jointly, which has much faster speed than frame-by-frame methods. The proposed feature-supervised CS data acquisition is implemented and compared with raster scan and the traditional CS reconstruction in impact damage detection on CFRP materials. The results show that the data amount is reduced greatly without compromising feature quality, and the gain in reconstruction speed is improved linearly with the number of measurements. (3) Based on the above CS-based data acquisition methods, CS models are developed to directly detect defect from CS data rather than using the reconstructed full spatial data. This method is robust to texture background and more time-efficient that HTED algorithm. Firstly, based on the histogram is invariant to down-sampling using the customised 0/1 Bernoulli measurement matrix, a qualitative method which only gives binary judgement of defect is developed. High probability of detection and accuracy is achieved compared to other methods. Secondly, a new greedy algorithm of sparse orthogonal matching pursuit (spOMP)-based defect region segmentation method is developed to quantitatively extract the defect region, because the conventional sparse reconstruction algorithms cannot properly use the sparse character of correlation between the measurement matrix and CS data. The proposed algorithms are faster and more robust to interference than other algorithms.China Scholarship Counci