Arrow Research search

Author name cluster

Weihua He

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.

3 papers
2 author rows

Possible papers

3

EAAI Journal 2026 Journal Article

Event-based low-power spiking gaze estimation

  • Zhipeng Sui
  • Weihua He
  • Fei Liang
  • Yongxiang Feng
  • Xiaobao Wei
  • Qiushuang Lian
  • Ziyang Zhang
  • Guoqi Li

Event camera has emerged as a powerful alternative to frame-based camera in gaze estimation, which generally has stringent requirements on power consumption in potential Augmented Reality and Virtual Reality application scenarios. However, existing event-based eye tracking relies on either hybrid modality or complex illuminating equipment, leading to high power consumption. Here, we propose a fully event-based algorithm pipeline for gaze estimation to reduce power consumption by minimizing sensor modality and algorithm computational complexity. The pipeline features with five modules, including wake-up, hibernation, eye segmentation, eye-movement tracking, and gaze mapping. In designing these modules, we take advantage of the sparse and dynamic nature of event data to achieve both low computation and error. In particular, the wake-up module determines the eye state through the input event data, and directs the pipeline to one of the three modules of hibernation, eye segmentation, or eye-movement tracking, considering both computational complexity and accuracy. A lightweight spiking neural network instead of deep neural network is adopted for eye segmentation to reduce the computational complexity by an order of magnitude. Furthermore, morphological operations involving sparse event data are used for eye segmentation, requiring extremely low computation enabled by minimal update. We conduct experiments on available event-based gaze dataset proposed by Angelopoulos, and compared to their implementation, our approach shows better accuracy (approximately 50% reduction in average angle error), and lower power consumption (about 68% decrease, at 100-milliwatt level). We believe that our method would facilitate eye tracking applications in power-sensitive scenarios.

ICRA Conference 2025 Conference Paper

E2B: A Single Modality Point-Based Tracker with Event Cameras

  • Hongwei Ren
  • Zhuo Li
  • Aiersi Tuerhong
  • Haobo Liu
  • Fei Liang
  • Yongxiang Feng
  • Wenhui Wang 0001
  • Yaoyuan Wang

High-speed object tracking holds significant relevance across robotic domains, such as drones and autonomous driving. Compared to conventional cameras, event cameras are equipped with the ability to capture object motion information at exceptionally high temporal resolution with relatively low power consumption and remain immune from motion-blurring effects. Regrettably, many existing methods adopt a framebased approach by stacking events into Event Frame, which overlooks the sparsity and high temporal resolution of events. This approach is also reliant on the huge pre-training backbone and reaches a performance plateau but demands unrealistically large networks and high power consumption, rendering it impractical for real-time applications in battery-constrained robotic scenarios. In this paper, we propose an efficient and effective single-modality tracker using Point Cloud representation named E2B (Event to Box). By directly handling the raw output of event cameras without dataformat transformation, E2B leverages events' coordinate guidance to accurately map Event Cloud features to 2D bounding boxes. Moreover, E2B incorporates the pyramid structure into the multi-stage feature extraction architecture to effectively track objects across diverse scales. In the experiments, E2B performs outstandingly on two large-scale and one synthetic event-based tracking datasets, covering both indoor and outdoor environments, as well as rigid and non-rigid objects.

TCS Journal 2017 Journal Article

Snowman is PSPACE-complete

  • Weihua He
  • Ziwen Liu
  • Chao Yang

Sokoban is one of the most studied combinatorial puzzle game in the literature. Its computational complexity was first shown to be PSPACE-complete in 1997. A new proof of this result was obtained by Hearn and Demaine (2005) [8], by introducing the Nondeterministic Constraint Logic (Ncl) problem. Since then, Ncl has been used to prove the PSPACE-completeness of several other puzzles including a few Sokoban variants, by many authors. In this paper, we show that Snowman, a new Sokoban-like puzzle game released in 2015, is PSPACE-complete by reduction from Ncl.

v2026.09.13