Searcharxiv⌕ Search

arXiv subjects

Zhe Xu

Publications and source records attributed to Zhe Xu.

At least 127 records · Page 7Linked to original sources

Do You Guys Want to Dance: Zero-Shot Compositional Human Dance Generation with Multiple Persons

Human dance generation (HDG) aims to synthesize realistic videos from images and sequences of driving poses. Despite great success, existing methods are limited to generating videos of a single person with specific backgrounds, while the generalizability for real-world scenarios with multiple persons and complex backgrounds remains unclear. To systematically measure the generalizability of HDG models, we introduce a new task, dataset, and evaluation protocol of compositional human dance generation (cHDG). Evaluating the state-of-the-art methods on cHDG, we empirically find that they fail to generalize to real-world scenarios. To tackle the issue, we propose a novel zero-shot framework, dubbed MultiDance-Zero, that can synthesize videos consistent with arbitrary multiple persons and background while precisely following the driving poses. Specifically, in contrast to straightforward DDIM or null-text inversion, we first present a pose-aware inversion method to obtain the noisy latent code and initialization text embeddings, which can accurately reconstruct the composed reference image. Since directly generating videos from them will lead to severe appearance inconsistency, we propose a compositional augmentation strategy to generate augmented images and utilize them to optimize a set of generalizable text embeddings. In addition, consistency-guided sampling is elaborated to encourage the background and keypoints of the estimated clean image at each reverse step to be close to those of the reference image, further improving the temporal consistency of generated videos. Extensive qualitative and quantitative results demonstrate the effectiveness and superiority of our approach.

cs.CV↗

The Decay Process of an α-configuration Sunspot

The decay of sunspot plays a key role in magnetic flux transportation in solar active regions (ARs). To better understand the physical mechanism of the entire decay process of a sunspot, an α-configuration sunspot in AR NOAA 12411 was studied. Based on the continuum intensity images and vector magnetic field data with stray light correction from Solar Dynamics Observatory/Helioseismic and Magnetic Imager, the area, vector magnetic field and magnetic flux in the umbra and penumbra are calculated with time, respectively. Our main results are as follows: (1) The decay curves of the sunspot area in its umbra, penumbra, and whole sunspot take the appearance of Gaussian profiles. The area decay rates of the umbra, penumbra and whole sunspot are -1.56 MSH/day, -12.61 MSH/day and -14.04 MSH/day, respectively; (2) With the decay of the sunspot, the total magnetic field strength and the vertical component of the penumbra increase, and the magnetic field of the penumbra becomes more vertical. Meanwhile, the total magnetic field strength and vertical magnetic field strength for the umbra decrease, and the inclination angle changes slightly with an average value of about 20°; (3) The magnetic flux decay curves of the sunspot in its umbra, penumbra, and whole sunspot exhibit quadratic patterns, their magnetic flux decay rates of the umbra, penumbra and whole sunspot are -9.84 * 10^19 Mx/day, -1.59 * 10^20 Mx/day and -2.60 * 10^20 Mx/day , respectively. The observation suggests that the penumbra may be transformed into the umbra, resulting in the increase of the average vertical magnetic field strength and the reduction of the inclination angle in the penumbra during the decay of the sunspot.

astro-ph.SR↗

The Decay of Two Adjacent Sunspots Associated with Moving Magnetic Features

The relationship between the decay of sunspots and moving magnetic features (MMFs) plays an important role in understanding the evolution of active regions. We present observations of two adjacent sunspots, the gap between them, and a lot of MMFs propagating from the gap and the sunspots' outer edges in NOAA Active Region 13023. The MMFs are divided into two types based on their magnetic field inclination angle: vertical (0°<γ<45°) and horizontal (45°<γ<90°) MMFs (V-MMFs and H-MMFs, respectively). The main results are as follows: (1) the mean magnetic flux decay rates of the two sunspots are -1.7*10^20 and -1.4*10^20 Mx/day; (2) the magnetic flux generation rate of all MMFs is calculated to be -1.9 *10^21 Mx/day, which is on average 5.6 times higher than the total magnetic flux loss rate of the sunspots; (3) the magnetic flux of V-MMFs (including a pore separated from the sunspots) is 1.4 times larger than the total lost magnetic flux of the two sunspots, and in a later stage when the pore has passed through the reference ellipse, the magnetic flux generation rate of the V-MMFs is almost the same as the magnetic flux loss rate of the sunspots; and (4) within the gap, the magnetic flux of V-MMFs is one third of the total magnetic flux. Few V-MMFs stream out from the sunspots at the nongap region. All observations suggest that MMFs with vertical magnetic fields are closely related to the disintegration of the sunspot, and most of the MMFs from the gap may originate directly from the sunspot umbra.

astro-ph.SR↗

Simultaneous observations of a breakout current sheet and a flare current sheet in a coronal jet event

Previous studies have revealed that solar coronal jets triggered by the eruption of mini-filaments (MFs) conform to the famous magnetic-breakout mechanism. In such scenario, a breakout current sheet (BCS) and a flare current sheet (FCS) should be observed during the jets. With high spatial and temporal resolution data from the SDO, the NVST, the RHESSI, the Wind, and the GOES, we present observational evidence of a BCS and a FCS formation during coronal jets driven by a MF eruption occurring in the active region NOAA 11726 on 2013 April 21. Magnetic field extrapolation show that the MF was enclosed by a fan-spine magnetic structure. The MF was activated by flux cancellation under it, and then slowly rose. A BCS formed when the magnetic fields wrapping the MF squeezed to antidirectional external open fields. Simultaneously, one thin bright jet and two bidirectional jet-like structures were observed. As the MF erupted as a blowout jet, a FCS was formed when the two distended legs inside the MF field came together. One end of the FCS connected the post-flare loops. The peak temperature of BCS was calculated to be 2.5 MK. The length, width and peak temperature of FCS was calculated to be 4.35-4.93 Mm, 1.31-1.45 Mm, and 2.5 MK, respectively. The magnetic reconnection rate associated with the FCS was estimated to be from 0.266 to 0.333. This event also related to a type III radio burst, indicating its influence on interplanetary space. These observations support the scenario of the breakout model as the trigger mechanism of coronal jets, and flux cancellation was the driver of this event.

astro-ph.SR↗

Onset mechanism of an inverted U-shaped solar filament eruption revealed by NVST, SDO, and STEREO-A observations

Utilizing observations from the New Vacuum Solar Telescope (NVST), Solar Dynamics Observatory (SDO), and Solar Terrestrial Relations Observatory-Ahead (STEREO-A), we investigate the event from two distinct observational perspectives: on the solar disk using NVST and SDO, and on the solar limb using STEREO-A. We employ both a non-linear force-free field model and a potential field model to reconstruct the coronal magnetic field, aiming to understand its magnetic properties. Two precursor jet-like activities were observed before the eruption, displaying an untwisted rotation. The second activity released an estimated twist of over two turns. During these two jet-like activities, Y-shaped brightenings, newly emerging magnetic flux accompanied by magnetic cancellation, and the formation of newly moving fibrils were identified. Combining these observational features, it can be inferred that these two precursor jet-like activities released the magnetic field constraining the filament and were triggered by newly emerging magnetic flux. Before the filament eruption, it was observed that some moving flows had been ejected from the site as the onset of two jet-like activities, indicating the same physical process as two jet-like activities. Extrapolations revealed that the filament laid under the height of the decay index of 1.0 and had strong magnetic field (540 Gauss) and a high twisted number (2.4 turns) before the eruption. An apparent rotational motion was observed during the filament eruption. We deduce that the solar filament, exhibiting an inverted U-shape, is a significantly twisted flux rope. The eruption of the filament was initiated by the release of constraining magnetic fields through continuous magnetic reconnection. This reconnection process was triggered by the emergence of newly magnetic flux.

astro-ph.SR↗

Semi-supervised Semantic Segmentation Meets Masked Modeling:Fine-grained Locality Learning Matters in Consistency Regularization

Semi-supervised semantic segmentation aims to utilize limited labeled images and abundant unlabeled images to achieve label-efficient learning, wherein the weak-to-strong consistency regularization framework, popularized by FixMatch, is widely used as a benchmark scheme. Despite its effectiveness, we observe that such scheme struggles with satisfactory segmentation for the local regions. This can be because it originally stems from the image classification task and lacks specialized mechanisms to capture fine-grained local semantics that prioritizes in dense prediction. To address this issue, we propose a novel framework called \texttt{MaskMatch}, which enables fine-grained locality learning to achieve better dense segmentation. On top of the original teacher-student framework, we design a masked modeling proxy task that encourages the student model to predict the segmentation given the unmasked image patches (even with 30\% only) and enforces the predictions to be consistent with pseudo-labels generated by the teacher model using the complete image. Such design is motivated by the intuition that if the predictions are more consistent given insufficient neighboring information, stronger fine-grained locality perception is achieved. Besides, recognizing the importance of reliable pseudo-labels in the above locality learning and the original consistency learning scheme, we design a multi-scale ensembling strategy that considers context at different levels of abstraction for pseudo-label generation. Extensive experiments on benchmark datasets demonstrate the superiority of our method against previous approaches and its plug-and-play flexibility.

cs.CV↗

Solving Two-Player General-Sum Games Between Swarms

Hamilton-Jacobi-Isaacs (HJI) PDEs are the governing equations for the two-player general-sum games. Unlike Reinforcement Learning (RL) methods, which are data-intensive methods for learning value function, learning HJ PDEs provide a guaranteed convergence to the Nash Equilibrium value of the game when it exists. However, a caveat is that solving HJ PDEs becomes intractable when the state dimension increases. To circumvent the curse of dimensionality (CoD), physics-informed machine learning methods with supervision can be used and have been shown to be effective in generating equilibrial policies in two-player general-sum games. In this work, we extend the existing work on agent-level two-player games to a two-player swarm-level game, where two sub-swarms play a general-sum game. We consider the \textit{Kolmogorov forward equation} as the dynamic model for the evolution of the densities of the swarms. Results show that policies generated from the physics-informed neural network (PINN) result in a higher payoff than a Nash Double Deep Q-Network (Nash DDQN) agent and have comparable performance with numerical solvers.

cs.MA↗

Optimal Propagation for Graph Neural Networks

Graph Neural Networks (GNNs) have achieved tremendous success in a variety of real-world applications by relying on the fixed graph data as input. However, the initial input graph might not be optimal in terms of specific downstream tasks, because of information scarcity, noise, adversarial attacks, or discrepancies between the distribution in graph topology, features, and groundtruth labels. In this paper, we propose a bi-level optimization approach for learning the optimal graph structure via directly learning the Personalized PageRank propagation matrix as well as the downstream semi-supervised node classification simultaneously. We also explore a low-rank approximation model for further reducing the time complexity. Empirical evaluations show the superior efficacy and robustness of the proposed model over all baseline methods.

cs.LG↗

Reinforcement Learning With Reward Machines in Stochastic Games

We investigate multi-agent reinforcement learning for stochastic games with complex tasks, where the reward functions are non-Markovian. We utilize reward machines to incorporate high-level knowledge of complex tasks. We develop an algorithm called Q-learning with reward machines for stochastic games (QRM-SG), to learn the best-response strategy at Nash equilibrium for each agent. In QRM-SG, we define the Q-function at a Nash equilibrium in augmented state space. The augmented state space integrates the state of the stochastic game and the state of reward machines. Each agent learns the Q-functions of all agents in the system. We prove that Q-functions learned in QRM-SG converge to the Q-functions at a Nash equilibrium if the stage game at each time step during learning has a global optimum point or a saddle point, and the agents update Q-functions based on the best-response strategy at this point. We use the Lemke-Howson method to derive the best-response strategy given current Q-functions. The three case studies show that QRM-SG can learn the best-response strategies effectively. QRM-SG learns the best-response strategies after around 7500 episodes in Case Study I, 1000 episodes in Case Study II, and 1500 episodes in Case Study III, while baseline methods such as Nash Q-learning and MADDPG fail to converge to the Nash equilibrium in all three case studies.

cs.MA↗

Distributed Robust Learning-Based Backstepping Control Aided with Neurodynamics for Consensus Formation Tracking of Underwater Vessels

This paper addresses distributed robust learning-based control for consensus formation tracking of multiple underwater vessels, in which the system parameters of the marine vessels are assumed to be entirely unknown and subject to the modeling mismatch, oceanic disturbances, and noises. Towards this end, graph theory is used to allow us to synthesize the distributed controller with a stability guarantee. Due to the fact that the parameter uncertainties only arise in the vessels' dynamic model, the backstepping control technique is then employed. Subsequently, to overcome the difficulties in handling time-varying and unknown systems, an online learning procedure is developed in the proposed distributed formation control protocol. Moreover, modeling errors, environmental disturbances, and measurement noises are considered and tackled by introducing a neurodynamics model in the controller design to obtain a robust solution. Then, the stability analysis of the overall closed-loop system under the proposed scheme is provided to ensure the robust adaptive performance at the theoretical level. Finally, extensive simulation experiments are conducted to further verify the efficacy of the presented distributed control protocol.

cs.RO↗

Distributed Neurodynamics-Based Backstepping Optimal Control for Robust Constrained Consensus of Underactuated Underwater Vehicles Fleet

Robust constrained formation tracking control of underactuated underwater vehicles (UUVs) fleet in three-dimensional space is a challenging but practical problem. To address this problem, this paper develops a novel consensus based optimal coordination protocol and a robust controller, which adopts a hierarchical architecture. On the top layer, the spherical coordinate transform is introduced to tackle the nonholonomic constraint, and then a distributed optimal motion coordination strategy is developed. As a result, the optimal formation tracking of UUVs fleet can be achieved, and the constraints are fulfilled. To realize the generated optimal commands better and, meanwhile, deal with the underactuation, at the lower-level control loop a neurodynamics based robust backstepping controller is designed, and in particular, the issue of "explosion of terms" appearing in conventional backstepping based controllers is avoided and control activities are improved. The stability of the overall UUVs formation system is established to ensure that all the states of the UUVs are uniformly ultimately bounded in the presence of unknown disturbances. Finally, extensive simulation comparisons are made to illustrate the superiority and effectiveness of the derived optimal formation tracking protocol.

eess.SY↗

Calliope-Net: Automatic Generation of Graph Data Facts via Annotated Node-link Diagrams

Graph or network data are widely studied in both data mining and visualization communities to review the relationship among different entities and groups. The data facts derived from graph visual analysis are important to help understand the social structures of complex data, especially for data journalism. However, it is challenging for data journalists to discover graph data facts and manually organize correlated facts around a meaningful topic due to the complexity of graph data and the difficulty to interpret graph narratives. Therefore, we present an automatic graph facts generation system, Calliope-Net, which consists of a fact discovery module, a fact organization module, and a visualization module. It creates annotated node-link diagrams with facts automatically discovered and organized from network data. A novel layout algorithm is designed to present meaningful and visually appealing annotated graphs. We evaluate the proposed system with two case studies and an in-lab user study. The results show that Calliope-Net can benefit users in discovering and understanding graph data facts with visually pleasing annotated visualizations.

cs.HC↗

Persistent nonequilibrium effects in generalized Langevin dynamics of nonrelativistic and relativistic particles

Persistent nonequilibrium effects such as the memory of the initial state, the ballistic diffusion, and the break of the equipartition theorem and the ergodicity in Brownian motions are investigated by analytically solving the generalized Langevin equation of nonrelativistic Brownian particles with colored noise. These effects can also be observed in the Brownian motion of relativistic particles by numerically solving the generalized Langevin equation for specially chosen memory kernels. Our analyses give rise to think about the possible anomalous motion of heavy quarks in relativistic heavy-ion collisions.

hep-ph↗

You've Got Two Teachers: Co-evolutionary Image and Report Distillation for Semi-supervised Anatomical Abnormality Detection in Chest X-ray

Chest X-ray (CXR) anatomical abnormality detection aims at localizing and characterising cardiopulmonary radiological findings in the radiographs, which can expedite clinical workflow and reduce observational oversights. Most existing methods attempted this task in either fully supervised settings which demanded costly mass per-abnormality annotations, or weakly supervised settings which still lagged badly behind fully supervised methods in performance. In this work, we propose a co-evolutionary image and report distillation (CEIRD) framework, which approaches semi-supervised abnormality detection in CXR by grounding the visual detection results with text-classified abnormalities from paired radiology reports, and vice versa. Concretely, based on the classical teacher-student pseudo label distillation (TSD) paradigm, we additionally introduce an auxiliary report classification model, whose prediction is used for report-guided pseudo detection label refinement (RPDLR) in the primary vision detection task. Inversely, we also use the prediction of the vision detection model for abnormality-guided pseudo classification label refinement (APCLR) in the auxiliary report classification task, and propose a co-evolution strategy where the vision and report models mutually promote each other with RPDLR and APCLR performed alternatively. To this end, we effectively incorporate the weak supervision by reports into the semi-supervised TSD pipeline. Besides the cross-modal pseudo label refinement, we further propose an intra-image-modal self-adaptive non-maximum suppression, where the pseudo detection labels generated by the teacher vision model are dynamically rectified by high-confidence predictions by the student. Experimental results on the public MIMIC-CXR benchmark demonstrate CEIRD's superior performance to several up-to-date weakly and semi-supervised methods.

cs.CV↗

Data-Driven Model Discrimination of Switched Nonlinear Systems with Temporal Logic Inference

This paper addresses the problem of data-driven model discrimination for unknown switched systems with unknown linear temporal logic (LTL) specifications, representing tasks, that govern their mode sequences, where only sampled data of the unknown dynamics and tasks are available. To tackle this problem, we propose data-driven methods to over-approximate the unknown dynamics and to infer the unknown specifications such that both set-membership models of the unknown dynamics and LTL formulas are guaranteed to include the ground truth model and specification/task. Moreover, we present an optimization-based algorithm for analyzing the distinguishability of a set of learned/inferred model-task pairs as well as a model discrimination algorithm for ruling out model-task pairs from this set that are inconsistent with new observations at run time. Further, we present an approach for reducing the size of inferred specifications to increase the computational efficiency of the model discrimination algorithms.

cs.AI↗

Distributed Leader Follower Formation Control of Mobile Robots based on Bioinspired Neural Dynamics and Adaptive Sliding Innovation Filter

This paper investigated the distributed leader follower formation control problem for multiple differentially driven mobile robots. A distributed estimator is first introduced and it only requires the state information from each follower itself and its neighbors. Then, we propose a bioinspired neural dynamic based backstepping and sliding mode control hybrid formation control method with proof of its stability. The proposed control strategy resolves the impractical speed jump issue that exists in the conventional backstepping design. Additionally, considering the system and measurement noises, the proposed control strategy not only removes the chattering issue existing in the conventional sliding mode control but also provides smooth control input with extra robustness. After that, an adaptive sliding innovation filter is integrated with the proposed control to provide accurate state estimates that are robust to modeling uncertainties. Finally, we performed multiple simulations to demonstrate the efficiency and effectiveness of the proposed formation control strategy.

cs.RO↗

Human-machine Interactive Tissue Prototype Learning for Label-efficient Histopathology Image Segmentation

Recently, deep neural networks have greatly advanced histopathology image segmentation but usually require abundant annotated data. However, due to the gigapixel scale of whole slide images and pathologists' heavy daily workload, obtaining pixel-level labels for supervised learning in clinical practice is often infeasible. Alternatively, weakly-supervised segmentation methods have been explored with less laborious image-level labels, but their performance is unsatisfactory due to the lack of dense supervision. Inspired by the recent success of self-supervised learning methods, we present a label-efficient tissue prototype dictionary building pipeline and propose to use the obtained prototypes to guide histopathology image segmentation. Particularly, taking advantage of self-supervised contrastive learning, an encoder is trained to project the unlabeled histopathology image patches into a discriminative embedding space where these patches are clustered to identify the tissue prototypes by efficient pathologists' visual examination. Then, the encoder is used to map the images into the embedding space and generate pixel-level pseudo tissue masks by querying the tissue prototype dictionary. Finally, the pseudo masks are used to train a segmentation network with dense supervision for better performance. Experiments on two public datasets demonstrate that our human-machine interactive tissue prototype learning method can achieve comparable segmentation performance as the fully-supervised baselines with less annotation burden and outperform other weakly-supervised methods. Codes will be available upon publication.

cs.CV↗

Learning Interpretable Temporal Properties from Positive Examples Only

We consider the problem of explaining the temporal behavior of black-box systems using human-interpretable models. To this end, based on recent research trends, we rely on the fundamental yet interpretable models of deterministic finite automata (DFAs) and linear temporal logic (LTL) formulas. In contrast to most existing works for learning DFAs and LTL formulas, we rely on only positive examples. Our motivation is that negative examples are generally difficult to observe, in particular, from black-box systems. To learn meaningful models from positive examples only, we design algorithms that rely on conciseness and language minimality of models as regularizers. To this end, our algorithms adopt two approaches: a symbolic and a counterexample-guided one. While the symbolic approach exploits an efficient encoding of language minimality as a constraint satisfaction problem, the counterexample-guided one relies on generating suitable negative examples to prune the search. Both the approaches provide us with effective algorithms with theoretical guarantees on the learned models. To assess the effectiveness of our algorithms, we evaluate all of them on synthetic data.

cs.LO↗