Searcharxiv⌕ Search

arXiv subjects

Xiao He

Publications and source records attributed to Xiao He.

At least 91 records · Page 5Linked to original sources
arXiv2024

Multi-mode Fault Diagnosis Datasets of Gearbox Under Variable Working Conditions

The gearbox is a critical component of electromechanical systems. The occurrence of multiple faults can significantly impact system accuracy and service life. The vibration signal of the gearbox is an effective indicator of its operational status and fault information. However, gearboxes in real industrial settings often operate under variable working conditions, such as varying speeds and loads. It is a significant and challenging research area to complete the gearbox fault diagnosis procedure under varying operating conditions using vibration signals. This data article presents vibration datasets collected from a gearbox exhibiting various fault degrees of severity and fault types, operating under diverse speed and load conditions. These faults are manually implanted into the gears or bearings through precise machining processes, which include health, missing teeth, wear, pitting, root cracks, and broken teeth. Several kinds of actual compound faults are also encompassed. The development of these datasets facilitates testing the effectiveness and reliability of newly developed fault diagnosis methods.

eess.SY↗
arXiv2023

Diff-Privacy: Diffusion-based Face Privacy Protection

Privacy protection has become a top priority as the proliferation of AI techniques has led to widespread collection and misuse of personal data. Anonymization and visual identity information hiding are two important facial privacy protection tasks that aim to remove identification characteristics from facial images at the human perception level. However, they have a significant difference in that the former aims to prevent the machine from recognizing correctly, while the latter needs to ensure the accuracy of machine recognition. Therefore, it is difficult to train a model to complete these two tasks simultaneously. In this paper, we unify the task of anonymization and visual identity information hiding and propose a novel face privacy protection method based on diffusion models, dubbed Diff-Privacy. Specifically, we train our proposed multi-scale image inversion module (MSI) to obtain a set of SDM format conditional embeddings of the original image. Based on the conditional embeddings, we design corresponding embedding scheduling strategies and construct different energy functions during the denoising process to achieve anonymization and visual identity information hiding. Extensive experiments have been conducted to validate the effectiveness of our proposed framework in protecting facial privacy.

cs.CV↗
arXiv2023

Object Detection in Hyperspectral Image via Unified Spectral-Spatial Feature Aggregation

Deep learning-based hyperspectral image (HSI) classification and object detection techniques have gained significant attention due to their vital role in image content analysis, interpretation, and wider HSI applications. However, current hyperspectral object detection approaches predominantly emphasize either spectral or spatial information, overlooking the valuable complementary relationship between these two aspects. In this study, we present a novel \textbf{S}pectral-\textbf{S}patial \textbf{A}ggregation (S2ADet) object detector that effectively harnesses the rich spectral and spatial complementary information inherent in hyperspectral images. S2ADet comprises a hyperspectral information decoupling (HID) module, a two-stream feature extraction network, and a one-stage detection head. The HID module processes hyperspectral images by aggregating spectral and spatial information via band selection and principal components analysis, consequently reducing redundancy. Based on the acquired spatial and spectral aggregation information, we propose a feature aggregation two-stream network for interacting spectral-spatial features. Furthermore, to address the limitations of existing databases, we annotate an extensive dataset, designated as HOD3K, containing 3,242 hyperspectral images captured across diverse real-world scenes and encompassing three object classes. These images possess a resolution of 512x256 pixels and cover 16 bands ranging from 470 nm to 620 nm. Comprehensive experiments on two datasets demonstrate that S2ADet surpasses existing state-of-the-art methods, achieving robust and reliable results. The demo code and dataset of this work are publicly available at \url{https://github.com/hexiao-cs/S2ADet}.

cs.CV↗
arXiv2023

Real-time Safety Assessment of Dynamic Systems in Non-stationary Environments: A Review of Methods and Techniques

Real-time safety assessment (RTSA) of dynamic systems is a critical task that has significant implications for various fields such as industrial and transportation applications, especially in non-stationary environments. However, the absence of a comprehensive review of real-time safety assessment methods in non-stationary environments impedes the progress and refinement of related methods. In this paper, a review of methods and techniques for RTSA tasks in non-stationary environments is provided. Specifically, the background and significance of RTSA approaches in non-stationary environments are firstly highlighted. We then present a problem description that covers the definition, classification, and main challenges. We review recent developments in related technologies such as online active learning, online semi-supervised learning, online transfer learning, and online anomaly detection. Finally, we discuss future outlooks and potential directions for further research. Our review aims to provide a comprehensive and up-to-date overview of real-time safety assessment methods in non-stationary environments, which can serve as a valuable resource for researchers and practitioners in this field.

eess.SY↗
arXiv2023

An Evidential Real-Time Multi-Mode Fault Diagnosis Approach Based on Broad Learning System

Fault diagnosis is a crucial area of research in industry. Industrial processes exhibit diverse operating conditions, where data often have non-Gaussian, multi-mode, and center-drift characteristics. Data-driven approaches are currently the main focus in the field, but continuous fault classification and parameter updates of fault classifiers pose challenges for multiple operating modes and real-time settings. Thus, a pressing issue is to achieve real-time multi-mode fault diagnosis in industrial systems. In this paper, a novel approach to achieve real-time multi-mode fault diagnosis is proposed for industrial applications, which addresses this critical research problem. Our approach uses an extended evidence reasoning (ER) algorithm to fuse information and merge outputs from different base classifiers. These base classifiers based on broad learning system (BLS) are trained to ensure maximum fault diagnosis accuracy. Furthermore, pseudo-label learning is used to update model parameters in real-time. The effectiveness of the proposed approach is demonstrated on the multi-mode Tennessee Eastman process dataset.

cs.LG↗
arXiv2023

All-to-key Attention for Arbitrary Style Transfer

Attention-based arbitrary style transfer studies have shown promising performance in synthesizing vivid local style details. They typically use the all-to-all attention mechanism -- each position of content features is fully matched to all positions of style features. However, all-to-all attention tends to generate distorted style patterns and has quadratic complexity, limiting the effectiveness and efficiency of arbitrary style transfer. In this paper, we propose a novel all-to-key attention mechanism -- each position of content features is matched to stable key positions of style features -- that is more in line with the characteristics of style transfer. Specifically, it integrates two newly proposed attention forms: distributed and progressive attention. Distributed attention assigns attention to key style representations that depict the style distribution of local regions; Progressive attention pays attention from coarse-grained regions to fine-grained key positions. The resultant module, dubbed StyA2K, shows extraordinary performance in preserving the semantic structure and rendering consistent style patterns. Qualitative and quantitative comparisons with state-of-the-art methods demonstrate the superior performance of our approach.

cs.CV↗
arXiv2023

OneShotSTL: One-Shot Seasonal-Trend Decomposition For Online Time Series Anomaly Detection And Forecasting

Seasonal-trend decomposition is one of the most fundamental concepts in time series analysis that supports various downstream tasks, including time series anomaly detection and forecasting. However, existing decomposition methods rely on batch processing with a time complexity of O(W), where W is the number of data points within a time window. Therefore, they cannot always efficiently support real-time analysis that demands low processing delay. To address this challenge, we propose OneShotSTL, an efficient and accurate algorithm that can decompose time series online with an update time complexity of O(1). OneShotSTL is more than $1,000$ times faster than the batch methods, with accuracy comparable to the best counterparts. Extensive experiments on real-world benchmark datasets for downstream time series anomaly detection and forecasting tasks demonstrate that OneShotSTL is from 10 to over 1,000 times faster than the state-of-the-art methods, while still providing comparable or even better accuracy.

cs.LG↗
arXiv2023

CADM: Confusion Model-based Detection Method for Real-drift in Chunk Data Stream

Concept drift detection has attracted considerable attention due to its importance in many real-world applications such as health monitoring and fault diagnosis. Conventionally, most advanced approaches will be of poor performance when the evaluation criteria of the environment has changed (i.e. concept drift), either can only detect and adapt to virtual drift. In this paper, we propose a new approach to detect real-drift in the chunk data stream with limited annotations based on concept confusion. When a new data chunk arrives, we use both real labels and pseudo labels to update the model after prediction and drift detection. In this context, the model will be confused and yields prediction difference once drift occurs. We then adopt cosine similarity to measure the difference. And an adaptive threshold method is proposed to find the abnormal value. Experiments show that our method has a low false alarm rate and false negative rate with the utilization of different classifiers.

cs.LG↗
arXiv2023

Few-shot Font Generation by Learning Style Difference and Similarity

Few-shot font generation (FFG) aims to preserve the underlying global structure of the original character while generating target fonts by referring to a few samples. It has been applied to font library creation, a personalized signature, and other scenarios. Existing FFG methods explicitly disentangle content and style of reference glyphs universally or component-wisely. However, they ignore the difference between glyphs in different styles and the similarity of glyphs in the same style, which results in artifacts such as local distortions and style inconsistency. To address this issue, we propose a novel font generation approach by learning the Difference between different styles and the Similarity of the same style (DS-Font). We introduce contrastive learning to consider the positive and negative relationship between styles. Specifically, we propose a multi-layer style projector for style encoding and realize a distinctive style representation via our proposed Cluster-level Contrastive Style (CCS) loss. In addition, we design a multi-task patch discriminator, which comprehensively considers different areas of the image and ensures that each style can be distinguished independently. We conduct qualitative and quantitative evaluations comprehensively to demonstrate that our approach achieves significantly better results than state-of-the-art methods.

cs.CV↗
arXiv2022

Coding Cross Sections of an Electron Charge Transfer Process

The paper presents the algorithm of a code written for computing the cross section for a charge transfer process involving a neutral molecule and a monatomic ion. The entrance and exit potential energy surfaces, driving the collision dynamics, are computed employing the Improved Lennard-Jones function that accounts for the role of non-electrostatic forces, due to size repulsion plus dispersion and induction attraction. In addition, electrostatic components, affecting the entrance channels, are evaluated as sum of Coulomb contributions, determined by the He$^+$ ion interacting with the charge distribution on the molecular frame. The cross section is estimated by employing the Landau-Zener-Stückelberg approach. The code implemented has been employed in systems involving helium cation and a small organic molecule, such as methanol, dimethyl ether and methyl formate.

physics.chem-ph↗
arXiv2022

Panoptic-PHNet: Towards Real-Time and High-Precision LiDAR Panoptic Segmentation via Clustering Pseudo Heatmap

As a rising task, panoptic segmentation is faced with challenges in both semantic segmentation and instance segmentation. However, in terms of speed and accuracy, existing LiDAR methods in the field are still limited. In this paper, we propose a fast and high-performance LiDAR-based framework, referred to as Panoptic-PHNet, with three attractive aspects: 1) We introduce a clustering pseudo heatmap as a new paradigm, which, followed by a center grouping module, yields instance centers for efficient clustering without object-level learning tasks. 2) A knn-transformer module is proposed to model the interaction among foreground points for accurate offset regression. 3) For backbone design, we fuse the fine-grained voxel features and the 2D Bird's Eye View (BEV) features with different receptive fields to utilize both detailed and global information. Extensive experiments on both SemanticKITTI dataset and nuScenes dataset show that our Panoptic-PHNet surpasses state-of-the-art methods by remarkable margins with a real-time speed. We achieve the 1st place on the public leaderboard of SemanticKITTI and leading performance on the recently released leaderboard of nuScenes.

cs.CV↗
arXiv2020

Detection of Intermittent Faults Based on an Optimally Weighted Moving Average T^2 Control Chart with Stationary Observations

The moving average (MA)-type scheme, also known as the smoothing method, has been well established within the multivariate statistical process monitoring (MSPM) framework since the 1990s. However, its theoretical basis is still limited to smoothing independent data, and the optimality of its equally or exponentially weighted scheme remains unproven. This paper aims to weaken the independence assumption in the existing MA method, and then extend it to a broader area of dealing with autocorrelated weakly stationary processes. With the discovery of the non-optimality of the equally and exponentially weighted schemes used for fault detection when data have autocorrelation, the essence that they do not effectively utilize the correlation information of samples is revealed, giving birth to an optimally weighted moving average (OWMA) theory. The OWMA method is combined with the Hotelling's $T^2$ statistic to form an OWMA $T^2$ control chart (OWMA-TCC), in order to detect a more challenging type of fault, i.e., intermittent fault (IF). Different from the MA scheme that puts an equal weight on samples within a time window, OWMA-TCC uses correlation (autocorrelation and cross-correlation) information to find an optimal weight vector (OWV) for the purpose of IF detection (IFD). In order to achieve a best IFD performance, the concept of IF detectability is defined and corresponding detectability conditions are provided, which further serve as selection criteria of the OWV. Then, the OWV is given in the form of a solution to nonlinear equations, whose existence is proven with the aid of the Brouwer fixed-point theory. Moreover, symmetrical structure of the OWV is revealed, and the optimality of the MA scheme for any IF directions when data exhibit no autocorrelation is proven.

cs.IT↗
arXiv2020

Detection and Detectability of Intermittent Faults Based on Moving Average T2 Control Charts with Multiple Window Lengths

So far, problems of intermittent fault (IF) detection and detectability have not been fully investigated in the multivariate statistics framework. The characteristics of IFs are small magnitudes and short durations, and consequently traditional multivariate statistical methods using only a single observation are no longer effective. Thus in this paper, moving average T^2 control charts (MA-TCCs) with multiple window lengths, which simultaneously employ a bank of MA-TCCs with different window lengths, are proposed to address the IF detection problem. Methods to reduce false/missing alarms and infer the IFs' appearing and disappearing time instances are presented. In order to analyze the detection capability for IFs, definitions of guaranteed detectability are introduced, which is an extension and generalization of the original fault detectability concept focused on permanent faults (PFs). Then, necessary and sufficient conditions are derived for the detectability of IFs, which may appear and disappear several times with different magnitudes and durations. Based on these conditions, some optimal properties of two important window lengths are further discussed. In this way, a theoretical framework for the analysis of IFs' detectability is established as well as extended discussions on how the theoretical results can be adapted to real-world applications. Finally, simulation studies on a numerical example and the continuous stirred tank reactor (CSTR) process are carried out to show the effectiveness of the developed methods.

eess.SY↗
arXiv2020

Learning Discrete Structures for Graph Neural Networks

Graph neural networks (GNNs) are a popular class of machine learning models whose major advantage is their ability to incorporate a sparse and discrete dependency structure between data points. Unfortunately, GNNs can only be used when such a graph-structure is available. In practice, however, real-world graphs are often noisy and incomplete or might not be available at all. With this work, we propose to jointly learn the graph structure and the parameters of graph convolutional networks (GCNs) by approximately solving a bilevel program that learns a discrete probability distribution on the edges of the graph. This allows one to apply GCNs not only in scenarios where the given graph is incomplete or corrupted but also in those where a graph is not available. We conduct a series of experiments that analyze the behavior of the proposed method and demonstrate that it outperforms related methods by a significant margin.

cs.LG↗
arXiv2020

Detection and Isolation of Wheelset Intermittent Over-creeps for Electric Multiple Units Based on a Weighted Moving Average Technique

Wheelset intermittent over-creeps (WIOs), i.e., slips or slides, can decrease the overall traction and braking performance of Electric Multiple Units (EMUs). However, they are difficult to detect and isolate due to their small magnitude and short duration. This paper presents a new index called variable-to-minimum difference (VMD) and a new technique called weighted moving average (WMA). Their combination, i.e., the WMA-VMD index, is used to detect and isolate WIOs in real time. Different from the existing moving average (MA) technique that puts an equal weight on samples within a time window, WMA uses correlation information to find an optimal weight vector (OWV), so as to better improve the index's robustness and sensitivity. The uniqueness of the OWV for the WMA-VMD index is proven, and the properties of the OWV are revealed. The OWV possesses a symmetrical structure, and the equally weighted scheme is optimal when data are independent. This explains the rationale of existing MA-based methods. WIO detectability and isolability conditions of the WMA-VMD index are provided, leading to an analysis of the properties of two nonlinear, discontinuous operators, $\min$ and $\textrm{VMD}_i$. Experimental studies are conducted based on practical running data and a hardware-in-the-loop platform of an EMU to show that the developed methods are effective.

eess.SP↗
arXiv2018

Efficient and Scalable Multi-task Regression on Massive Number of Tasks

Many real-world large-scale regression problems can be formulated as Multi-task Learning (MTL) problems with a massive number of tasks, as in retail and transportation domains. However, existing MTL methods still fail to offer both the generalization performance and the scalability for such problems. Scaling up MTL methods to problems with a tremendous number of tasks is a big challenge. Here, we propose a novel algorithm, named Convex Clustering Multi-Task regression Learning (CCMTL), which integrates with convex clustering on the k-nearest neighbor graph of the prediction models. Further, CCMTL efficiently solves the underlying convex problem with a newly proposed optimization method. CCMTL is accurate, efficient to train, and empirically scales linearly in the number of tasks. On both synthetic and real-world datasets, the proposed CCMTL outperforms seven state-of-the-art (SoA) multi-task learning methods in terms of prediction accuracy as well as computational efficiency. On a real-world retail dataset with 23,812 tasks, CCMTL requires only around 30 seconds to train on a single thread, while the SoA methods need up to hours or even days.

cs.LG↗
arXiv2018

A remark on semi-infinite cohomology

We extend the notion of semi-infinite cohomology of Lie algebras to include cases where the Lie algebra does not admit a semi-infinite structure but satisfies a mild condition. Our construction clarifies the definition of affine W-algebras in general nilpotent elements case given by V. Kac, S. Roan and M. Wakimoto. We will also give a characterization of admissible pairs with respect to a nilpotent element in a semisimple Lie algebra and define affine W-algebras associated to admissible pairs, while finite W-algebras associated to admissible pairs were already introduced before.

math-ph↗