Arrow Research search

Author name cluster

Xiang Xu

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.

4 papers
2 author rows

Possible papers

4

NeurIPS Conference 2025 Conference Paper

Salient Concept-Aware Generative Data Augmentation

  • Tianchen Zhao
  • Xuanbai Chen
  • Zhihua Li
  • Jun Fang
  • Dongsheng An
  • Xiang Xu
  • Zhuowen Tu
  • Yifan Xing

Recent generative data augmentation methods conditioned on both image and text prompts struggle to balance between fidelity and diversity, as it is challenging to preserve essential image details while aligning with varied text prompts. This challenge arises because representations in the synthesis process often become entangled with non-essential input image attributes such as environmental contexts, creating conflicts with text prompts intended to modify these elements. To address this, we propose a personalized image generation framework that uses a salient concept-aware image embedding model to reduce the influence of irrelevant visual details during the synthesis process, thereby maintaining intuitive alignment between image and text inputs. By generating images that better preserve class-discriminative features with additional controlled variations, our framework effectively enhances the diversity of training datasets and thereby improves the robustness of downstream models. Our approach demonstrates superior performance across eight fine-grained vision datasets, outperforming state-of-the-art augmentation methods with averaged classification accuracy improvements by 0. 73\% and 6. 5\% under conventional and long-tail settings, respectively.

YNIMG Journal 2023 Journal Article

In vivo labeling and quantitative imaging of neuronal populations using MRI

  • Shana Li
  • Xiang Xu
  • Canjun Li
  • Ziyan Xu
  • Ke Wu
  • Qiong Ye
  • Yan Zhang
  • Xiaohua Jiang

The study of neural circuits, which underlies perception, cognition, emotion, and behavior, is essential for understanding the mammalian brain, a complex organ consisting of billions of neurons. To study the structure and function of the brain, in vivo neuronal labeling and imaging techniques are crucial as they provide true physiological information that ex vivo methods cannot offer. In this paper, we present a new strategy for in vivo neuronal labeling and quantification using MRI. We demonstrate the efficacy of this method by delivering the oatp1a1 gene to the target neurons using rAAV2-retro virus. OATP1A1 protein expression on the neuronal membrane increased the uptake of a specific MRI contrast agent (Gd-EOB-DTPA), leading to hyperintense signals on T1W images of labeled neuronal populations. We also used dynamic contrast enhancement-based methods to obtain quantitative information on labeled neuronal populations in vivo.

TCS Journal 2017 Journal Article

The g-good-neighbor diagnosability of (n,k)-star graphs

  • Xiang Xu
  • Xiaowang Li
  • Shuming Zhou
  • Rong-Xia Hao
  • Mei-Mei Gu

Many large-scale multiprocessor or multi-computer systems take interconnection networks as underlying topologies. Fault diagnosis is especially important to identify fault tolerability of such systems. The g-good-neighbor (conditional) diagnosability such that every fault-free node has at least g fault-free neighbors is a novel measure of diagnosability. In this paper, we show that the g-good-neighbor diagnosability of the ( n, k ) -star graph S n, k under the PMC model ( 2 ≤ k ≤ n − 1 and 1 ≤ g ≤ n − k ) and the comparison model ( 2 ≤ k ≤ n − 1 and 2 ≤ g ≤ n − k ) is n + g ( k − 1 ) − 1, respectively. In addition, we derive that 1-good-neighbor diagnosability of S n, k under the comparison model is n + k − 2 for 3 ≤ k ≤ n − 1 and n ≥ 4. As a supplement, we also derive that the g-good-neighbor diagnosability of the ( n, 1 ) -star graph S n, 1 ( 1 ≤ g ≤ ⌊ n / 2 ⌋ − 1 and n ≥ 4 ) under the PMC model and the comparison model is ⌈ n / 2 ⌉ − 1, respectively.

ICRA Conference 2004 Conference Paper

Efficient Algorithms for Load Shuffling in Split-platform AS/RS

  • Yahong Hu
  • Wen-Jing Hsu
  • Xiang Xu

We address the issue of shuffling loads in automated storage/retrieval system (AS/RS). To minimize the response time of retrievals, we pre-sort the loads into any specified locations. 1D, 2D and 3D AS/RS racks have been designed to achieve the shuffling efficiently. The corresponding shuffling algorithms are described in detail. The response time of retrieval, the lower and upper bounds of energy consumption are also derived. Results of the analysis and numerical experiments show that the shuffling algorithms are quite efficient indeed.

v2026.09.13