Arrow Research search

Author name cluster

Jingyu 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.

2 papers
1 author row

Possible papers

2

YNIMG Journal 2026 Journal Article

The Erlangen Program in lateral occipital cortex: Hierarchical encoding of emergent features

  • Junjun Zhang
  • Shi Zeng
  • Baochen Wang
  • Jingyu He
  • Zhenlan Jin
  • Ling Li

Emergent features are fundamental concepts in Gestalt psychology, yet the neural encoding of these features, particularly a quantitative understanding of their relative superiority, remains elusive. This study bridges this gap by conceptualizing emergent features through geometric transformations within the Erlangen Program, which provides a principled framework to quantify their hierarchical relationships. We propose that the lateral occipital cortex (LOC) encodes these emergent features in accordance with the geometric hierarchies defined by this program. Using fMRI and multivariate pattern analysis, we demonstrate that LOC reliably discriminates between distinct geometric transformations (Euclidean, affine, projective, and topology). Critically, representational similarity analysis reveals that neural dissimilarities in LOC align with the relative stability of geometries predicted by the Erlangen Program. However, the LOC exhibits similar representational structures for lower-order transformations like Euclidean and affine geometries, suggesting a potential collapse of these distinctions in the region's global geometric hierarchy. Furthermore, transfer learning confirms hierarchical nesting relationships among the geometries: classifiers trained on specific geometric distinctions generalize to others in a manner consistent with the Erlangen hierarchy. These findings establish LOC as the neural substrate where emergent features are organized hierarchically by geometric stability, revealing how the visual system prioritizes invariant global structures to optimize perceptual efficiency.

TCS Journal 2025 Journal Article

Algorithms for Shortest Path Tour Problem

  • Yucen Gao
  • Zhuoran Li
  • Jingyu He
  • Jun Fang
  • Hui Gao
  • Xiaofeng Gao
  • Guihai Chen

Carpooling route planning becomes an important problem with the growth of low-carbon traffic systems. When each passenger has multiple potential pick-up/drop-off locations, the problem will be more challenging. In the paper, we discussed a simplified carpooling route planning problem, namely the Shortest Path Tour Problem (SPTP), whose aim is to find a single-origin single-destination shortest path through an ordered sequence of disjoint node subsets. We propose Stage Dijkstra and Global Dijkstra algorithms to find the optimal shortest path, with the time complexity of O ( l ( n + m ) log ⁡ n ) and O ( l ( n + m ) log ⁡ ( l n ) ) respectively, where l represents the number of node subsets. To the best of our knowledge, O ( l ( n + m ) log ⁡ n ) is the best time complexity of the exact algorithms for SPTP. Besides, the Stage Dijkstra and Global Dijkstra algorithms both have the linear space complexity, which is highly suitable for resource-constrained environments. Experiments conducted on large-scale road networks and synthetic datasets demonstrate the effectiveness and efficiency of our proposed algorithms in terms of running time and memory consumption.

v2026.09.13