Searcharxiv⌕ Search

arXiv subjects

Fei He

Publications and source records attributed to Fei He.

At least 37 records · Page 2Linked to original sources

Retrieving Filter Spectra in CNN for Explainable Sleep Stage Classification

Despite significant advances in deep learning-based sleep stage classification, the clinical adoption of automatic classification models remains slow. One key challenge is the lack of explainability, as many models function as black boxes with millions of parameters. In response, recent work has increasingly focussed on enhancing model explainability. This study contributes to these efforts by introducing an explainability tool for spectral processing of individual EEG channels. Specifically, this tools retrieves the filter spectrum of low-level convolutional feature extraction and compares it with the classification-relevant spectral information in the data. We apply our tool on the EEGNet and MSA-CNN models using the ISRUC-S3 and Sleep-EDF-20 datasets. The tool reveals that spectral processing plays a significant role in the lower frequency bands. In addition, comparing the correlation between filter spectrum and data-derived spectral information with univariate performance indicates that the model naturally prioritises the most informative channels in a multimodal setting. We specify how these insights can be leveraged to enhance model performance. The code for the filter spectrum retrieval and its analysis is available at https://github.com/sgoerttler/MSA-CNN.

eess.SP↗

Complete $k$-partite entanglement measure

The $k$-partite entanglement, which focus on at most how many particles in the global system are entangled but separable from other particles, is complementary to the $k$-entanglement that reflects how many splitted subsystems are entangled under partitions of the systems in characterizing multipartite entanglement. Very recently, the theory of the complete $k$-entanglement measure has been established in [Phys. Rev. A 110, 012405 (2024)]. Here we investigate whether we can define the complete measure of the $k$-partite entanglement. Consequently, with the same spirit as that of the complete $k$-entanglement measure, we present the axiomatic postulates that a complete $k$-partite entanglement measure should require. Furthermore, we present two classes of $k$-partite entanglement measures and show that one is complete while the other one is unified but not complete except for the case of $k=2$.

quant-ph↗

Dimension estimate and existence of holomorphic sections with polynomial growth on gradient Kähler Ricci shrinkers

We prove an upper bound for the dimension of the linear space of holomorphic functions with polynomial growth on gradient Kähler Ricci shrinkers with bounded curvature. The upper bound is given as a power function of the growth rate. Similar results hold for holomorphic $(p, 0)-$forms, and holomorphic sections of the pluri-anticanonical line bundle $K_M^{-q}$. We also prove the existence of holomorphic sections of $K_M^{-q}$ with polynomial growth when the Kähler Ricci shrinker is asymptotically conical, provided $q$ is sufficiently large; as an application, we show that the Kodaira map constructed using such sections is a holomorphic embbedding into a complex projective space.

math.DG↗

Structural Abstraction and Refinement for Probabilistic Programs

In this paper, we present structural abstraction refinement, a novel framework for verifying the threshold problem of probabilistic programs. Our approach represents the structure of a Probabilistic Control-Flow Automaton (PCFA) as a Markov Decision Process (MDP) by abstracting away statement semantics. The maximum reachability of the MDP naturally provides a proper upper bound of the violation probability, termed the structural upper bound. This introduces a fresh ``structural'' characterization of the relationship between PCFA and MDP, contrasting with the traditional ``semantical'' view, where the MDP reflects semantics. The method uniquely features a clean separation of concerns between probability and computational semantics that the abstraction focuses solely on probabilistic computation and the refinement handles only the semantics aspect, where the latter allows non-random program verification techniques to be employed without modification. Building upon this feature, we propose a general counterexample-guided abstraction refinement (CEGAR) framework, capable of leveraging established non-probabilistic techniques for probabilistic verification. We explore its instantiations using trace abstraction. Our method was evaluated on a diverse set of examples against state-of-the-art tools, and the experimental results highlight its versatility and ability to handle more flexible structures swiftly.

cs.FL↗

Understanding Concepts in Graph Signal Processing for Neurophysiological Signal Analysis

Multivariate signals, which are measured simultaneously over time and acquired by sensor networks, are becoming increasingly common. The emerging field of graph signal processing (GSP) promises to analyse spectral characteristics of these multivariate signals, while at the same time taking the spatial structure between the time signals into account. A central idea in GSP is the graph Fourier transform, which projects a multivariate signal onto frequency-ordered graph Fourier modes, and can therefore be regarded as a spatial analog of the temporal Fourier transform. This chapter derives and discusses key concepts in GSP, with a specific focus on how the various concepts relate to one another. The experimental section focuses on the role of graph frequency in data classification, with applications to neuroimaging. To address the limited sample size of neurophysiological datasets, we introduce a minimalist simulation framework that can generate arbitrary amounts of data. Using this artificial data, we find that lower graph frequency signals are less suitable for classifying neurophysiological data as compared to higher graph frequency signals. Finally, we introduce a baseline testing framework for GSP. Employing this framework, our results suggest that GSP applications may attenuate spectral characteristics in the signals, highlighting current limitations of GSP for neuroimaging.

eess.SP↗

EEG-GMACN: Interpretable EEG Graph Mutual Attention Convolutional Network

Electroencephalogram (EEG) is a valuable technique to record brain electrical activity through electrodes placed on the scalp. Analyzing EEG signals contributes to the understanding of neurological conditions and developing brain-computer interface. Graph Signal Processing (GSP) has emerged as a promising method for EEG spatial-temporal analysis, by further considering the topological relationships between electrodes. However, existing GSP studies lack interpretability of electrode importance and the credibility of prediction confidence. This work proposes an EEG Graph Mutual Attention Convolutional Network (EEG-GMACN), by introducing an 'Inverse Graph Weight Module' to output interpretable electrode graph weights, enhancing the clinical credibility and interpretability of EEG classification results. Additionally, we incorporate a mutual attention mechanism module into the model to improve its capability to distinguish critical electrodes and introduce credibility calibration to assess the uncertainty of prediction results. This study enhances the transparency and effectiveness of EEG analysis, paving the way for its widespread use in clinical and neuroscience research.

eess.SP↗

NonSysId: A nonlinear system identification package with improved model term selection for NARMAX models

System identification involves constructing mathematical models of dynamic systems using input-output data, enabling analysis and prediction of system behaviour in both time and frequency domains. This approach can model the entire system or capture specific dynamics within it. For meaningful analysis, it is essential for the model to accurately reflect the underlying system's behaviour. This paper introduces NonSysId, an open-sourced MATLAB software package designed for nonlinear system identification, specifically focusing on NARMAX models. The software incorporates an advanced term selection methodology that prioritises on simulation (free-run) accuracy while preserving model parsimony. A key feature is the integration of iterative Orthogonal Forward Regression (iOFR) with Predicted Residual Sum of Squares (PRESS) statistic-based term selection, facilitating robust model generalisation without the need for a separate validation dataset. Furthermore, techniques for reducing computational overheads are implemented. These features make NonSysId particularly suitable for real-time applications such as structural health monitoring, fault diagnosis, and biomedical signal processing, where it is a challenge to capture the signals under consistent conditions, resulting in limited or no validation data.

eess.SY↗

Upper bound of the counting function of Steklov eigenvalues

We study the counting function of Steklov eigenvalues on compact manifolds with boundary and obtain its upper bound involving the leading term of Weyl's law. Our estimate can be viewed as a weakened version of Pólya's Conjecture in the Steklov case on general manifolds. As a byproduct, we also obtain a description about the decay behavior of Steklov eigenfunctions near the boundary.

math.SP↗

The cloud cover and meteorological parameters at the Lenghu site on the Tibetan Plateau

The cloud cover and meteorological parameters serve as fundamental criteria for the qualification of an astronomical observatory working in optical and infrared wavelengths. In this paper, we present a systematic assessment of key meteorological parameters at the Lenghu site. The datasets adopted in this study includes the meteorological parameters collected at the local weather stations at the site and in the Lenghu Town, the sky brightness at the local zenith acquired by the Sky Quality Meters and night sky all-sky images from a digital camera, the ERA5 reanalysis database and global climate monitoring data. From 2019 to 2023, the fractional observable time of photometric condition is 69.70%, 74.97%, 70.26%, 74.27% and 65.12%, respectively. The fractional observing time is inversely correlated with surface air temperature, relative humidity, precipitable water vapor, and dew temperature, demonstrating that the observing conditions are influenced by these meteorological parameters. Large-scale air-sea interactions affect the climate at Lenghu site, which in fact delivers a clue to understand the irregularity of 2023. Specifically, precipitable water vapor at Lenghu site is correlated to both the westerly wind index and the summer North Atlantic Oscillation index, the yearly average temperature of Lenghu site is observed to increase significantly during the occurrence of a strong El Niño event and the relative humidity anomaly at Lenghu site is correlated to the Pacific Decadal Oscillation index. The decrease of fractional observing time in 2023 was due to the ongoing strong El Niño event and relevant global climate change. We underscore the substantial role of global climate change in regulating astronomical observing conditions and the necessity for long-term continuous monitoring of the astronomical meteorological parameters at Lenghu site.

astro-ph.IM↗

Existence and applications of Ricci flows via pseudolocality

We prove the short-time existence of Ricci flows on complete manifolds with scalar curvature bounded below uniformly, Ricci curvature bounded below by a negative quadratic function, and with almost Euclidean isoperimetric inequality holds locally. In particular, this result applies to manifolds with both Ricci curvature and injectivity radius bounded from below. We also study the short-time behaviour of these solutions which may have unbounded curvature at the initial time, and provide some applications. A key tool is Perelman's pseudolocality theorem.

math.DG↗

Hydrodynamics of an oscillating cylinder inline with steady current

Wake and force characteristics of an oscillating cylinder in inline steady currents are investigated numerically over a wide parameter space of dimensionless oscillation amplitude ($A^* = 0.01 - 0.50$) and wavelength ($λ^* = 0.4 - 25$) at a fixed Reynolds number $Re = 500$. Fundamental issues addressed in this study are the interactions of wakes induced by steady approaching flow and cylinder oscillations and the influences of the governing parameters of $A^$ and $λ^$ on such interactions. Whilst the collinear flow is dominated by wakes induced by cylinder oscillation at $λ^* \leq 1.5$ and steady current at $λ^* \geq 10$, it exhibits characteristics of nonlinear interactions of wakes induced by the cylinder oscillation and steady current at $λ^* = 1.5 - 10$, such as the formation of multiple synchronized modes interleaved with desynchronized modes. The synchronized mode varies with both $λ^$ and $A^$, forming an inclined Arnold's tongue across $λ^-A^$ space. There is a wide variability of the vortex shedding pattern in each synchronized mode. Variations of different hydrodynamic force coefficients with $λ^$ and $A^$ are investigated with physical interpretations based on the wake characteristics. The applicability of the Morison equation in predicting inline force fluctuations is examined. We found that the Morison equation shows reasonable accuracy only for a small range of $λ^* \leq 1.5$. Beyond this range, its performance deteriorates due to the influence of steady current on wake characteristics.

physics.flu-dyn↗

Stochastic Graph Heat Modelling for Diffusion-based Connectivity Retrieval

Heat diffusion describes the process by which heat flows from areas with higher temperatures to ones with lower temperatures. This concept was previously adapted to graph structures, whereby heat flows between nodes of a graph depending on the graph topology. Here, we combine the graph heat equation with the stochastic heat equation, which ultimately yields a model for multivariate time signals on a graph. We show theoretically how the model can be used to directly compute the diffusion-based connectivity structure from multivariate signals. Unlike other connectivity measures, our heat model-based approach is inherently multivariate and yields an absolute scaling factor, namely the graph thermal diffusivity, which captures the extent of heat-like graph propagation in the data. On two datasets, we show how the graph thermal diffusivity can be used to characterise Alzheimer's disease (AD). We find that the graph thermal diffusivity is lower for AD patients than healthy controls and correlates with mini mental state examination (MMSE) scores, suggesting structural impairment in patients in line with previous findings.

eess.SP↗

Balancing Spectral, Temporal and Spatial Information for EEG-based Alzheimer's Disease Classification

The prospect of future treatment warrants the development of cost-effective screening for Alzheimer's disease (AD). A promising candidate in this regard is electroencephalography (EEG), as it is one of the most economic imaging modalities. Recent efforts in EEG analysis have shifted towards leveraging spatial information, employing novel frameworks such as graph signal processing or graph neural networks. Here, we investigate the importance of spatial information relative to spectral or temporal information by varying the proportion of each dimension for AD classification. To do so, we systematically test various dimension resolution configurations on two routine EEG datasets. Our findings show that spatial information is more important than temporal information and equally valuable as spectral information. On the larger second dataset, substituting spectral with spatial information even led to an increase of 1.1% in accuracy, which emphasises the importance of spatial information for EEG-based AD classification. We argue that our resolution-based feature extraction has the potential to improve AD classification specifically, and multivariate signal classification generally.

eess.SP↗

Deep Automated Mechanism Design for Integrating Ad Auction and Allocation in Feed

E-commerce platforms usually present an ordered list, mixed with several organic items and an advertisement, in response to each user's page view request. This list, the outcome of ad auction and allocation processes, directly impacts the platform's ad revenue and gross merchandise volume (GMV). Specifically, the ad auction determines which ad is displayed and the corresponding payment, while the ad allocation decides the display positions of the advertisement and organic items. The prevalent methods of segregating the ad auction and allocation into two distinct stages face two problems: 1) Ad auction does not consider externalities, such as the influence of actual display position and context on ad Click-Through Rate (CTR); 2) The ad allocation, which utilizes the auction-winning ad's payment to determine the display position dynamically, fails to maintain incentive compatibility (IC) for the advertisement. For instance, in the auction stage employing the traditional Generalized Second Price (GSP) , even if the winning ad increases its bid, its payment remains unchanged. This implies that the advertisement cannot secure a better position and thus loses the opportunity to achieve higher utility in the subsequent ad allocation stage. Previous research often focused on one of the two stages, neglecting the two-stage problem, which may result in suboptimal outcomes...

cs.GT↗

Single- and multi-layer micro-scale diffractive lens fabrication for fiber imaging probes with versatile depth-of-field

Hair-thin optical fiber endoscopes have opened up new paradigms for advanced imaging applications in vivo. In certain applications, such as optical coherence tomography (OCT), light-shaping structures may be required on fiber facets to generate needle-like Bessel beams with large depth-of-field, while in others shorter depths of field with high lateral resolutions are preferable. In this paper, we demonstrate a novel method to fabricate light-shaping structures on optical fibres, achieved via bonding encapsulated planar diffractive lenses onto fiber facets. Diffractive metallic structures have the advantages of being simple to design, fabricate and transfer, and our encapsulation approach is scalable to multi-layer stacks. As a demonstration, we design and transfer a Fresnel zone plate and a diffractive axicon onto fiber facets, and show that the latter device generates a needle-like Bessel beam with 350 mu m focal depth. We also evaluate the imaging performance of both devices and show that the axicon fiber is able to maintain focussed images of a USAF resolution target over a 150 mu m distance. Finally, we fabricate a two-layer stack of Fresnel zone plates on a fiber and characterise the modified beam profile and demonstrate good imaging performance. We anticipate our fabrication approach could enable multi-functional complex optical structures (e.g. using plasmonics, polarization control) to be integrated onto fibers for ultra-thin advanced imaging and sensing.

physics.optics↗

Graph Neural Network-based EEG Classification: A Survey

Graph neural networks (GNN) are increasingly used to classify EEG for tasks such as emotion recognition, motor imagery and neurological diseases and disorders. A wide range of methods have been proposed to design GNN-based classifiers. Therefore, there is a need for a systematic review and categorisation of these approaches. We exhaustively search the published literature on this topic and derive several categories for comparison. These categories highlight the similarities and differences among the methods. The results suggest a prevalence of spectral graph convolutional layers over spatial. Additionally, we identify standard forms of node features, with the most popular being the raw EEG signal and differential entropy. Our results summarise the emerging trends in GNN-based approaches for EEG classification. Finally, we discuss several promising research directions, such as exploring the potential of transfer learning methods and appropriate modelling of cross-frequency interactions.

q-bio.NC↗

Adapting Segment Anything Model (SAM) through Prompt-based Learning for Enhanced Protein Identification in Cryo-EM Micrographs

Cryo-electron microscopy (cryo-EM) remains pivotal in structural biology, yet the task of protein particle picking, integral for 3D protein structure construction, is laden with manual inefficiencies. While recent AI tools such as Topaz and crYOLO are advancing the field, they do not fully address the challenges of cryo-EM images, including low contrast, complex shapes, and heterogeneous conformations. This study explored prompt-based learning to adapt the state-of-the-art image segmentation foundation model Segment Anything Model (SAM) for cryo-EM. This focus was driven by the desire to optimize model performance with a small number of labeled data without altering pre-trained parameters, aiming for a balance between adaptability and foundational knowledge retention. Through trials with three prompt-based learning strategies, namely head prompt, prefix prompt, and encoder prompt, we observed enhanced performance and reduced computational requirements compared to the fine-tuning approach. This work not only highlights the potential of prompting SAM in protein identification from cryo-EM micrographs but also suggests its broader promise in biomedical image segmentation and object detection.

cs.CV↗

Adaptive Gated Graph Convolutional Network for Explainable Diagnosis of Alzheimer's Disease using EEG Data

Graph neural network (GNN) models are increasingly being used for the classification of electroencephalography (EEG) data. However, GNN-based diagnosis of neurological disorders, such as Alzheimer's disease (AD), remains a relatively unexplored area of research. Previous studies have relied on functional connectivity methods to infer brain graph structures and used simple GNN architectures for the diagnosis of AD. In this work, we propose a novel adaptive gated graph convolutional network (AGGCN) that can provide explainable predictions. AGGCN adaptively learns graph structures by combining convolution-based node feature enhancement with a correlation-based measure of power spectral density similarity. Furthermore, the gated graph convolution can dynamically weigh the contribution of various spatial scales. The proposed model achieves high accuracy in both eyes-closed and eyes-open conditions, indicating the stability of learned representations. Finally, we demonstrate that the proposed AGGCN model generates consistent explanations of its predictions that might be relevant for further study of AD-related alterations of brain networks.

q-bio.NC↗