Arrow Research search

Author name cluster

Xiaobo Zhou

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

17 papers
2 author rows

Possible papers

17

AAAI Conference 2026 Conference Paper

CometNet: Contextual Motif-guided Long-term Time Series Forecasting

  • Weixu Wang
  • Xiaobo Zhou
  • Xin Qiao
  • Lei Wang
  • Tie Qiu

Long-term Time Series Forecasting is crucial across numerous critical domains, yet its accuracy remains fundamentally constrained by the receptive field bottleneck in existing models. Mainstream Transformer- and Multi-layer Perceptron (MLP)-based methods mainly rely on finite look-back windows, limiting their ability to model long-term dependencies and hurting forecasting performance. Naively extending the look-back window proves ineffective, as it not only introduces prohibitive computational complexity, but also drowns vital long-term dependencies in historical noise. To address these challenges, we propose CometNet, a novel Contextual Motif-guided Long-term Time Series Forecasting framework. CometNet first introduces a Contextual Motif Extraction module that identifies recurrent, dominant contextual motifs from complex historical sequences, providing extensive temporal dependencies far exceeding limited look-back windows; Subsequently, a Motif-guided Forecasting module is proposed, which integrates the extracted dominant motifs into forecasting. By dynamically mapping the look-back window to its relevant motifs, CometNet effectively harnesses their contextual information to strengthen long-term forecasting capability. Extensive experimental results on eight real-world datasets have demonstrated that CometNet significantly outperforms current state-of-the-art (SOTA) methods, particularly on extended forecast horizons.

TAAS Journal 2026 Journal Article

FlePo: GPU Multi-task Scheduling Optimization Framework for Dynamic Scenes

  • Huanghuang Liang
  • Xin Yang
  • Rui Ge
  • Yaqi Xia
  • Chuang Hu
  • Xiaobo Zhou
  • Dazhao Cheng

Deep Neural Networks (DNNs) are widely used in intelligent applications, driving increasing computational demands on GPUs. However, modern GPU multitasking scheduling algorithms fail to effectively balance real-time task performance and resource utilization, especially under dynamic workloads with highly variable DNN computational demands. The complex and workload-dependent execution times of DNN kernels often lead to inefficient resource allocation, degraded system throughput, and missed real-time constraints. To address these challenges, we propose FlePo (Flexible Parallel Orchestrator), a GPU multitasking scheduling framework designed to optimize resource utilization and maintain real-time task performance within acceptable limits for soft real-time systems. FlePo integrates two key techniques: Adaptive Padding Dispatch (APD), which dynamically schedules best-effort tasks while leveraging the predictable execution characteristics of DNN kernels to maintain real-time predictability; and Dynamic Parallel Fusion (DPF), which employs kernel fusion to create computational isolation, reducing interference in parallel job execution. By combining offline profiling with online adaptation, FlePo efficiently responds to workload variations. We evaluate FlePo on two heterogeneous GPU platforms, NVIDIA Tesla V100 and AMD MI50, achieving up to a 50% increase in throughput while keeping real-time overhead below 2%. Our work enhances GPU multitasking in dynamic environments, with potential applications in autonomous driving, smart homes, and intelligent healthcare.

AAAI Conference 2026 Conference Paper

StreamSTGS: Streaming Spatial and Temporal Gaussian Grids for Real-Time Free-Viewpoint Video

  • Zhihui Ke
  • Yvyang Liu
  • Xiaobo Zhou
  • Tie Qiu

Streaming free-viewpoint video (FVV) in real-time still faces significant challenges, particularly in training, rendering, and transmission efficiency. Harnessing superior performance of 3D Gaussian Splatting (3DGS), recent 3DGS-based FVV methods have achieved notable breakthroughs in both training and rendering. However, the storage requirements of these methods can reach up to 10MB per frame, making stream FVV in real-time impossible. To address this problem, we propose a novel FVV representation, dubbed StreamSTGS, designed for real-time streaming. StreamSTGS represents a dynamic scene using canonical 3D Gaussians, temporal features, and a deformation field. For high compression efficiency, we encode canonical Gaussian attributes as 2D images and temporal features as a video. This design not only enables real-time streaming, but also inherently supports adaptive bitrate control based on network condition without any extra training. Moreover, we propose a sliding window scheme to aggregate adjacent temporal features to learn local motions, and then introduce a transformer-guided auxiliary training module to learn global motions. On diverse FVV benchmarks, StreamSTGS demonstrates competitive performance on all metrics compared to state-of-the-art methods. Notably, StreamSTGS increases the PSNR by an average of 1dB while reducing the average frame size to just 170KB.

AAAI Conference 2025 Conference Paper

FlexiTex: Enhancing Texture Generation via Visual Guidance

  • Dadong Jiang
  • Xianghui Yang
  • Zibo Zhao
  • Sheng Zhang
  • Jiaao Yu
  • Zeqiang Lai
  • Shaoxiong Yang
  • Chunchao Guo

Recent texture generation methods achieve impressive results due to the powerful generative prior they leverage from large-scale text-to-image diffusion models. However, abstract textual prompts are limited in providing global textural or shape information, which results in the texture generation methods producing blurry or inconsistent patterns. To tackle this, we present FlexiTex, embedding rich information via visual guidance to generate a high-quality texture. The core of FlexiTex is the Visual Guidance Enhancement module, which incorporates more specific information from visual guidance to reduce ambiguity in the text prompt and preserve high-frequency details. To further enhance the visual guidance, we introduce a Direction-Aware Adaptation module that automatically designs direction prompts based on different camera poses, avoiding the Janus problem and maintaining semantically global consistency. Benefiting from the visual guidance, FlexiTex produces quantitatively and qualitatively sound results, demonstrating its potential to advance texture generation for real-world applications.

IJCAI Conference 2025 Conference Paper

Zero-shot Federated Unlearning via Transforming from Data-Dependent to Personalized Model-Centric

  • Wenhan Wu
  • Huanghuang Liang
  • Jingling Yuan
  • Jiawei Jiang
  • Kanye Ye Wang
  • Chuang Hu
  • Xiaobo Zhou
  • Dazhao Cheng

Federated Unlearning (FU) addresses the "right to be forgotten" in federated learning by removing specific client data's contribution without retraining from scratch. Existing FUs are data-dependent, which make the assumption that systems can access original training data or stored historical parameter updates during unlearning. However, the assumption cannot always hold in practice, as users usually request the deletion of client data and historical parameter updates due to privacy concerns or storage limitations. Therefore, it is crucial to develop a zero-shot FU method without such data access. The key challenge is how to distinguish and remove the impact of target clients without data-level information. Motivated by the idea that if we can learn client-specific personalized information from the model instead of data, FU can be model-centric and data-free, we present the first zero-shot FU framework ZeroFU. By embedding client contributions into the model during learning via condition computation, ZeroFU enables the model to possess personalized features for unlearning. The unlearning is achieved using a proposed GAN-based distillation framework that obfuscates the personalized feature of the target client. Evaluations demonstrate its effectiveness in unlearning under non-IID settings.

AAAI Conference 2019 Conference Paper

Scalable Distributed DL Training: Batching Communication and Computation

  • Shaoqi Wang
  • Aidi Pi
  • Xiaobo Zhou

Scalability of distributed deep learning (DL) training with parameter server architecture is often communication constrained in large clusters. There are recent efforts that use a layer by layer strategy to overlap gradient communication with backward computation so as to reduce the impact of communication constraint on the scalability. However, the approaches cannot be effectively applied to the overlap between parameter communication and forward computation. In this paper, we propose and design iBatch, a novel communication approach that batches parameter communication and forward computation to overlap them with each other. We formulate the batching decision as an optimization problem and solve it based on greedy algorithm to derive communication and computation batches. We implement iBatch in the open-source DL framework BigDL and perform evaluations with various DL workloads. Experimental results show that iBatch improves the scalability of a cluster of 72 nodes by up to 73% over the default PS and 41% over the layer by layer strategy.

JBHI Journal 2017 Journal Article

Reconstruction-Based Digital Dental Occlusion of the Partially Edentulous Dentition

  • Jian Zhang
  • James J. Xia
  • Jianfu Li
  • Xiaobo Zhou

Partially edentulous dentition presents a challenging problem for the surgical planning of digital dental occlusion in the field of craniomaxillofacial surgery because of the incorrect maxillomandibular distance caused by missing teeth. We propose an innovative approach called Dental Reconstruction with Symmetrical Teeth (DRST) to achieve accurate dental occlusion for the partially edentulous cases. In this DRST approach, the rigid transformation between two symmetrical teeth existing on the left and right dental model is estimated through probabilistic point registration by matching the two shapes. With the estimated transformation, the partially edentulous space can be virtually filled with the teeth in its symmetrical position. Dental alignment is performed by digital dental occlusion reestablishment algorithm with the reconstructed complete dental model. Satisfactory reconstruction and occlusion results are demonstrated with the synthetic and real partially edentulous models.

TAAS Journal 2016 Journal Article

Online Adaptive Anomaly Detection for Augmented Network Flows

  • Dennis Ippoliti
  • Changjun Jiang
  • Zhijun Ding
  • Xiaobo Zhou

Traditional network anomaly detection involves developing models that rely on packet inspection. However, increasing network speeds and use of encrypted protocols make per-packet inspection unsuited for today’s networks. One method of overcoming this obstacle is aggregating packet header information and performing flow-based analysis where data flow patterns are examined rather than deep packet inspection. Many existing approaches are special purpose limited to detecting specific behavior. Also, the data reduction inherent in identifying anomalous flows hinders alert correlation. In this article, we propose and develop a dynamic anomaly detection approach for augmented network flows. We sketch network state during flow creation, enabling general-purpose threat detection. We describe an efficient flow augmentation approach based on the count-min sketch that provides per-flow-, per-node-, and per-network-level statistics parallel to flow record generation. We design and develop a support vector machine-based adaptive anomaly detection and correlation mechanism, which is capable of aggregating alerts without a priori alert classification and evolving models online. We further develop a lightweight evolving alert aggregation method and combine it with a confidence forwarding mechanism identifying a small percentage predictions for additional processing. We show effectiveness of our methods on both enterprise and backbone traces. Experimental results demonstrate its ability to maintain high accuracy without the need for offline training.

TAAS Journal 2015 Journal Article

Self-Tuning Batching with DVFS for Performance Improvement and Energy Efficiency in Internet Servers

  • Dazhao Cheng
  • Yanfei Guo
  • Changjun Jiang
  • Xiaobo Zhou

Performance improvement and energy efficiency are two important goals in provisioning Internet services in datacenter servers. In this article, we propose and develop a self-tuning request batching mechanism to simultaneously achieve the two correlated goals. The batching mechanism increases the cache hit rate at the front-tier Web server, which provides the opportunity to improve an application’s performance and the energy efficiency of the server system. The core of the batching mechanism is a novel and practical two-layer control system that adaptively adjusts the batching interval and frequency states of CPUs according to the service level agreement and the workload characteristics. The batching control adopts a self-tuning fuzzy model predictive control approach for application performance improvement. The power control dynamically adjusts the frequency of Central Processing Units (CPUs) with Dynamic Voltage and Frequency Scaling (DVFS) in response to workload fluctuations for energy efficiency. A coordinator between the two control loops achieves the desired performance and energy efficiency. We further extend the self-tuning batching with DVFS approach from a single-server system to a multiserver system. It relies on a MIMO expert fuzzy control to adjust the CPU frequencies of multiple servers and coordinate the frequency states of CPUs at different tiers. We implement the mechanism in a test bed. Experimental results demonstrate that the new approach significantly improves the application performance in terms of the system throughput and average response time. At the same time, the results also illustrate the mechanism can reduce the energy consumption of a single-server system by 13% and a multiserver system by 11%, respectively.

JBHI Journal 2014 Journal Article

Modeling Cell–Cell Interactions in Regulating Multiple Myeloma Initiating Cell Fate

  • Tao Peng
  • Huiming Peng
  • Dong Soon Choi
  • Jing Su
  • Chung-Che Chang
  • Xiaobo Zhou

Cancer initiating cells have been documented in multiple myeloma and believed to be a key factor that initiates and drives tumor growth, differentiation, metastasis, and recurrence of the diseases. Although myeloma initiating cells (MICs) are likely to share many properties of normal stem cells, the underlying mechanisms regulating the fate of MICs are largely unknown. Studies designed to explore such communication are urgently needed to enhance our ability to predict the fate decisions of MICs (self-renewal, differentiation, and proliferation). In this study, we developed a novel system to understand the intercellular communication between MICs and their niche by seamlessly integrating experimental data and mathematical model. We first designed dynamic cell culture experiments and collected three types of cells (side population cells, progenitor cells, and mature myeloma cells) under various cultural conditions with flow cytometry. Then we developed a lineage model with ordinary differential equations by considering secreted factors, self-renewal, differentiation, and other biological functions of those cells, to model the cell–cell interactions among the three cell types. Particle swarm optimization was employed to estimate the model parameters by fitting the experimental data to the lineage model. The theoretical results show that the correlation coefficient analysis can reflect the feedback loops among the three cell types, the intercellular feedback signaling can regulate cell population dynamics, and the culture strategies can decide cell growth. This study provides a basic framework of studying cell–cell interactions in regulating MICs fate.

JBHI Journal 2014 Journal Article

Red Blood Cell Tracking Using Optical Flow Methods

  • Dongmin Guo
  • Anne L. van de Ven
  • Xiaobo Zhou

The investigation of microcirculation is an important task in biomedical and physiological research because the microcirculation information, such as flow velocity and vessel density, is critical to monitor human conditions and develop effective therapies of some diseases. As one of the tasks of the microcirculation study, red blood cell (RBC) tracking presents an effective approach to estimate some parameters in microcirculation. The common method for RBC tracking is based on spatiotemporal image analysis, which requires the image to have high qualification and cells should have fixed velocity. Besides, for in vivo cell tracking, cells may disappear in some frames, image series may have spatial and temporal distortions, and vessel distribution can be complex, which increase the difficulties of RBC tracking. In this paper, we propose an optical flow method to track RBCs. It attempts to describe the local motion for each visible point in the frames using a local displacement vector field. We utilize it to calculate the displacement of a cell in two adjacent frames. Additionally, another optical flow-based method, scale invariant feature transform (SIFT) flow, is also presented. The experimental results show that optical flow is quite robust to the case where the velocity of cell is unstable, while SIFT flow works well when there is a large displacement of the cell between two adjacent frames. Our proposed methods outperform other methods when doing in vivo cell tracking, which can be used to estimate the blood flow directly and help to evaluate other parameters in microcirculation.

ICRA Conference 2014 Conference Paper

Stiffness modulation exploiting configuration redundancy in mobile cable robots

  • Xiaobo Zhou
  • Seung-kook Jun
  • Venkat Krovi

In this paper, we investigate the modulation of task space stiffness of mobile cable robots with elastic cables. The elasticity is introduced via springs connected in series with non-extensible cables. The benefit of such series elastic cables include tension control without using force sensors and tension redistribution. However, elasticity also reduces positioning accuracy and makes the system more prone to disturbances. Therefore, careful stiffness modulation is needed for better performance. We exploit the configuration redundancy in mobile cable robots to optimize certain desired task space stiffness criterion. Both simulation and experimental results are presented for validation.

TAAS Journal 2013 Journal Article

Autonomic Provisioning with Self-Adaptive Neural Fuzzy Control for Percentile-Based Delay Guarantee

  • Palden Lama
  • Xiaobo Zhou

Autonomic server provisioning for performance assurance is a critical issue in Internet services. It is challenging to guarantee that requests flowing through a multi-tier system will experience an acceptable distribution of delays. The difficulty is mainly due to highly dynamic workloads, the complexity of underlying computer systems, and the lack of accurate performance models. We propose a novel autonomic server provisioning approach based on a model-independent self-adaptive Neural Fuzzy Control (NFC). Existing model-independent fuzzy controllers are designed manually on a trial-and-error basis, and are often ineffective in the face of highly dynamic workloads. NFC is a hybrid of control-theoretical and machine learning techniques. It is capable of self-constructing its structure and adapting its parameters through fast online learning. We further enhance NFC to compensate for the effect of server switching delays. Extensive simulations demonstrate that, compared to a rule-based fuzzy controller and a Proportional-Integral controller, the NFC-based approach delivers superior performance assurance in the face of highly dynamic workloads. It is robust to variation in workload intensity, characteristics, delay target, and server switching delays. We demonstrate the feasibility and performance of the NFC-based approach with a testbed implementation in virtualized blade servers hosting a multi-tier online auction benchmark.

ICRA Conference 2012 Conference Paper

Analysis framework for cooperating mobile cable robots

  • Xiaobo Zhou
  • Chin Pei Tang
  • Venkat Krovi

Cable robots form a class of parallel architecture robots with significant benefits including simplicity of construction, large workspace, significant payload capacity and end effector stiffness. While conventional cable robots have fixed bases, we seek to explore inclusion of mobility into the bases (in the form of gantries, and/or vehicle bases) which can significantly further enhance the capabilities of cable robots. However, this also introduces redundancy and complexity into the system which needs to be carefully analyzed and resolved. To this end, we propose a generalized modeling framework for systematic design and analysis of cooperative mobile cable robots, building upon knowledge base of multi-fingered grasping, and illustrate it with a case study of four cooperating gantry mounted cable robots transporting a planar payload.

YNIMG Journal 2007 Journal Article

Automated neurite extraction using dynamic programming for high-throughput screening of neuron-based assays

  • Yong Zhang
  • Xiaobo Zhou
  • Alexei Degterev
  • Marta Lipinski
  • Donald Adjeroh
  • Junying Yuan
  • Stephen T.C. Wong

High-throughput screening (HTS) of cell-based assays has recently emerged as an important tool of drug discovery. The analysis and modeling of HTS microscopy neuron images, however, is particularly challenging. In this paper we present a novel algorithm for extraction and quantification of neurite segments from HTS neuron images. The algorithm is designed to be able to detect and link neurites even with complex neuronal structures and of poor imaging quality. Our proposed algorithm automatically detects initial seed points on a set of grid lines and estimates the ending points of the neurite by iteratively tracing the centerline points along the line path representing the neurite segment. The live-wire method is then applied to link the seed points and the corresponding ending points using dynamic programming techniques, thus enabling the extraction of the centerlines of the neurite segments accurately and robustly against noise, discontinuity, and other image artifacts. A fast implementation of our algorithm using dynamic programming is also provided in the paper. Any thin neurite and its segments with low intensity contrast can be well preserved by detecting the starting and ending points of the neurite. All these properties make the proposed algorithm attractive for high-throughput screening of neuron-based assays.

YNIMG Journal 2007 Journal Article

Dendritic spine detection using curvilinear structure detector and LDA classifier

  • Yong Zhang
  • Xiaobo Zhou
  • Rochelle M. Witt
  • Bernardo L. Sabatini
  • Donald Adjeroh
  • Stephen T.C. Wong

Dendritic spines are small, bulbous cellular compartments that carry synapses. Biologists have been studying the biochemical pathways by examining the morphological and statistical changes of the dendritic spines at the intracellular level. In this paper a novel approach is presented for automated detection of dendritic spines in neuron images. The dendritic spines are recognized as small objects of variable shape attached or detached to multiple dendritic backbones in the 2D projection of the image stack along the optical direction. We extend the curvilinear structure detector to extract the boundaries as well as the centerlines for the dendritic backbones and spines. We further build a classifier using Linear Discriminate Analysis (LDA) to classify the attached spines into valid and invalid types to improve the accuracy of the spine detection. We evaluate the proposed approach by comparing with the manual results in terms of backbone length, spine number, spine length, and spine density.

v2026.09.13