Researcher profile

Xiao Hu

Xiao Hu contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
11works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

11 published item(s)

preprint2026arXiv

PG-LRF: Physiology-Guided Latent Rectified Flow for Electro-Hemodynamic PPG-to-ECG Generation

Electrocardiography (ECG) is the clinical standard for cardiac assessment but requires dedicated hardware that does not scale to daily-life monitoring. Photoplethysmography (PPG) is ubiquitous in wearables but lacks ECG-specific diagnostic morphology and is corrupted by motion and sensor noise. PPG-to-ECG generation aims to bridge this gap by recovering electrical morphology and timing from peripheral pulse signals. However, existing methods largely rely on statistical alignment and data-driven generation. They fail to explicitly structure the latent space around physiology-aware electro-hemodynamic factors and lack constraints from forward physiological dynamics. To address these challenges, we propose PG-LRF, a physiology-guided latent rectified flow framework. PG-LRF introduces an electro-hemodynamic simulator that co-models ECG and PPG through shared cardiac phase dynamics. Guided by this simulator, a Physiology-Aware AutoEncoder learns a structured electro-hemodynamic latent space. Then we integrate this simulator guidance into a PPG-conditioned latent rectified flow, enforcing ECG-side morphology consistency and ECG-to-PPG forward hemodynamic consistency during generative transport. Experiments on the large-scale MC-MED dataset demonstrate that PG-LRF significantly improves PPG-to-ECG generation and downstream cardiovascular disease classification, proving its ability to generate ECGs that are both signal-faithful and physiologically plausible under the ECG-to-PPG hemodynamic pathway

preprint2025arXiv

Magneto-optical Skyrmion for manipulation of arbitrary light polarization

Dynamic manipulation of arbitrary light polarization is of fundamental importance for versatile optical functionalities, yet realizing such full-Poincaré-sphere control within compact nanophotonic architectures remains a formidable challenge. Here, we theoretically propose and numerically demonstrate a magneto-optical skyrmion platform enabling full polarization control of cavity eigenmodes. We reveal the correspondence between the near-field wavefunctions of degenerate dipoles and far-field polarization. By applying multidirectional magnetic fields to magneto-optical photonic crystals, we achieve any complex superposition of orthogonal eigenmodes, thereby realizing arbitrary far-field polarization. This mapping manifests as a skyrmion with a topological charge of 2, guaranteeing coverage of the entire Poincaré sphere. Our theoretical model shows excellent agreement with full-wave simulations. Furthermore, we realize bound states in the continuum (BICs) with dynamically tunable polarization textures and demonstrate high-performance polarization-selective emission and transmission. This work establishes a topological paradigm for precise polarization shaping, offering new avenues for advanced optical communication and sensing.

preprint2022arXiv

Formation of Dust Rings and Gaps in Non-ideal MHD Disks Through Meridional Gas Flows

Rings and gaps are commonly observed in the dust continuum emission of young stellar disks. Previous studies have shown that substructures naturally develop in the weakly ionized gas of magnetized, non-ideal MHD disks. The gas rings are expected to trap large mm/cm-sized grains through pressure gradient-induced radial dust-gas drift. Using 2D (axisymmetric) MHD simulations that include ambipolar diffusion and dust grains of three representative sizes (1~mm, 3.3~mm, and 1~cm), we show that the grains indeed tend to drift radially relative to the gas towards the centers of the gas rings, at speeds much higher than in a smooth disk because of steeper pressure gradients. However, their spatial distribution is primarily controlled by meridional gas motions, which are typically much faster than the dust-gas drift. In particular, the grains that have settled near the midplane are carried rapidly inwards by a fast accretion stream to the inner edges of the gas rings, where they are lifted up by the gas flows diverted away from the midplane by a strong poloidal magnetic field. The flow pattern in our simulation provides an attractive explanation for the meridional flows recently inferred in HD 163296 and other disks, including both "collapsing" regions where the gas near the disk surface converges towards the midplane and a disk wind. Our study highlights the prevalence of the potentially observable meridional flows associated with the gas substructure formation in non-ideal MHD disks and their crucial role in generating rings and gaps in dust.

preprint2022arXiv

Higgs-Leggett mechanism for the elusive 6e superconductivity observed in Kagome vanadium-based superconductors

A recent Little-Parks experiment on Kagome-structured superconductor CsV_3Sb_5 demonstrated remarkable resistance oscillations with period \phi0/3=hc/6e. Here, we perform analysis based on a theory involving three 2e superconductivity (SC) order parameters associated with the three reciprocal lattice vectors which connect M points of the hexagonal Brillouin zone. In a ring geometry we unveil that, as a series of metastable states, phase of one SC order parameter winds 2πmore or less than the other two ones around the ring, which yields local free energy minima at integer multiples of \phi0/3. Intriguingly, the ground-state degeneracy associated with a Z_2 chirality is crucial, and the Higgs-Leggett mechanism stabilizes domain walls (DW) between chiral domains. At low temperatures DW are expelled from the system resulting in free energy minima only at integer multiples of ϕ_0. Our theory explains successfully the 6e SC observed in experiments, which opens a door for approaching rich physics of Kagome superconductors.

preprint2022arXiv

Irrelevant Pixels are Everywhere: Find and Exclude Them for More Efficient Computer Vision

Computer vision is often performed using Convolutional Neural Networks (CNNs). CNNs are compute-intensive and challenging to deploy on power-contrained systems such as mobile and Internet-of-Things (IoT) devices. CNNs are compute-intensive because they indiscriminately compute many features on all pixels of the input image. We observe that, given a computer vision task, images often contain pixels that are irrelevant to the task. For example, if the task is looking for cars, pixels in the sky are not very useful. Therefore, we propose that a CNN be modified to only operate on relevant pixels to save computation and energy. We propose a method to study three popular computer vision datasets, finding that 48% of pixels are irrelevant. We also propose the focused convolution to modify a CNN's convolutional layers to reject the pixels that are marked irrelevant. On an embedded device, we observe no loss in accuracy, while inference latency, energy consumption, and multiply-add count are all reduced by about 45%.

preprint2022arXiv

Log-Spectral Matching GAN: PPG-based Atrial Fibrillation Detection can be Enhanced by GAN-based Data Augmentation with Integration of Spectral Loss

Photoplethysmography (PPG) is a ubiquitous physiological measurement that detects beat-to-beat pulsatile blood volume changes and hence has a potential for monitoring cardiovascular conditions, particularly in ambulatory settings. A PPG dataset that is created for a particular use case is often imbalanced, due to a low prevalence of the pathological condition it targets to predict and the paroxysmal nature of the condition as well. To tackle this problem, we propose log-spectral matching GAN (LSM-GAN), a generative model that can be used as a data augmentation technique to alleviate the class imbalance in a PPG dataset to train a classifier. LSM-GAN utilizes a novel generator that generates a synthetic signal without a up-sampling process of input white noises, as well as adds the mismatch between real and synthetic signals in frequency domain to the conventional adversarial loss. In this study, experiments are designed focusing on examining how the influence of LSM-GAN as a data augmentation technique on one specific classification task - atrial fibrillation (AF) detection using PPG. We show that by taking spectral information into consideration, LSM-GAN as a data augmentation solution can generate more realistic PPG signals. The code of LSM-GAN is available at https://github.com/chengding0713/Log-Spectral-matching-GAN.

preprint2022arXiv

Ranked Enumeration of Join Queries with Projections

Join query evaluation with ordering is a fundamental data processing task in relational database management systems. SQL and custom graph query languages such as Cypher offer this functionality by allowing users to specify the order via the ORDER BY clause. In many scenarios, the users also want to see the first $k$ results quickly (expressed by the LIMIT clause), but the value of $k$ is not predetermined as user queries are arriving in an online fashion. Recent work has made considerable progress in identifying optimal algorithms for ranked enumeration of join queries that do not contain any projections. In this paper, we initiate the study of the problem of enumerating results in ranked order for queries with projections. Our main result shows that for any acyclic query, it is possible to obtain a near-linear (in the size of the database) delay algorithm after only a linear time preprocessing step for two important ranking functions: sum and lexicographic ordering. For a practical subset of acyclic queries known as star queries, we show an even stronger result that allows a user to obtain a smooth tradeoff between faster answering time guarantees using more preprocessing time. Our results are also extensible to queries containing cycles and unions. We also perform a comprehensive experimental evaluation to demonstrate that our algorithms, which are simple to implement, improve up to three orders of magnitude in the running time over state-of-the-art algorithms implemented within open-source RDBMS and specialized graph databases.

preprint2022arXiv

Why Accuracy Is Not Enough: The Need for Consistency in Object Detection

Object detectors are vital to many modern computer vision applications. However, even state-of-the-art object detectors are not perfect. On two images that look similar to human eyes, the same detector can make different predictions because of small image distortions like camera sensor noise and lighting changes. This problem is called inconsistency. Existing accuracy metrics do not properly account for inconsistency, and similar work in this area only targets improvements on artificial image distortions. Therefore, we propose a method to use non-artificial video frames to measure object detection consistency over time, across frames. Using this method, we show that the consistency of modern object detectors ranges from 83.2% to 97.1% on different video datasets from the Multiple Object Tracking Challenge. We conclude by showing that applying image distortion corrections like .WEBP Image Compression and Unsharp Masking can improve consistency by as much as 5.1%, with no loss in accuracy.

preprint2020arXiv

Fast Join Project Query Evaluation using Matrix Multiplication

In the last few years, much effort has been devoted to developing join algorithms in order to achieve worst-case optimality for join queries over relational databases. Towards this end, the database community has had considerable success in developing succinct algorithms that achieve worst-case optimal runtime for full join queries, i.e the join is over all variables present in the input database. However, not much is known about join evaluation with {\em projections} beyond some simple techniques of pushing down the projection operator in the query execution plan. Such queries have a large number of applications in entity matching, graph analytics and searching over compressed graphs. In this paper, we study how a class of join queries with projections can be evaluated faster using worst-case optimal algorithms together with matrix multiplication. Crucially, our algorithms are parameterized by the output size of the final result, allowing for choice of the best execution strategy. We implement our algorithms as a subroutine and compare the performance with state-of-the-art techniques to show they can be improved upon by as much as 50x. More importantly, our experiments indicate that matrix multiplication is a useful operation that can help speed up join processing owing to highly optimized open source libraries that are also highly parallelizable.

preprint2020arXiv

Observing Responses to the COVID-19 Pandemic using Worldwide Network Cameras

COVID-19 has resulted in a worldwide pandemic, leading to "lockdown" policies and social distancing. The pandemic has profoundly changed the world. Traditional methods for observing these historical events are difficult because sending reporters to areas with many infected people can put the reporters' lives in danger. New technologies are needed for safely observing responses to these policies. This paper reports using thousands of network cameras deployed worldwide for the purpose of witnessing activities in response to the policies. The network cameras can continuously provide real-time visual data (image and video) without human efforts. Thus, network cameras can be utilized to observe activities without risking the lives of reporters. This paper describes a project that uses network cameras to observe responses to governments' policies during the COVID-19 pandemic (March to April in 2020). The project discovers over 30,000 network cameras deployed in 110 countries. A set of computer tools are created to collect visual data from network cameras continuously during the pandemic. This paper describes the methods to discover network cameras on the Internet, the methods to collect and manage data, and preliminary results of data analysis. This project can be the foundation for observing the possible "second wave" in fall 2020. The data may be used for post-pandemic analysis by sociologists, public health experts, and meteorologists.

preprint2020arXiv

Temporally-decoherent and spatially-coherent vibrations in metal halide perovskite

The long carrier lifetime and defect tolerance in metal halide perovskites (MHPs) are major contributors to the superb performance of MHP optoelectronic devices. Large polarons were reported to be responsible for the long carrier lifetime. Yet microscopic mechanisms of the large polaron formation including the so-called phonon melting, are still under debate. Here, time-of-flight (TOF) inelastic neutron scattering (INS) experiments and first-principles density-functional theory (DFT) calculations were employed to investigate the lattice vibrations (or phonon dynamics) in methylammonium lead iodide ($\rm{MAPbI_3}$), a prototypical example of MHPs. Our findings are that optical phonons lose temporal coherence gradually with increasing temperature which vanishes at the orthorhombic-to-tetragonal structural phase transition. Surprisingly, however, we found that the spatial coherence is still retained throughout the decoherence process. We argue that the temporally decoherent and spatially coherent vibrations contribute to the formation of large polarons in this metal halide perovskite.