Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peijing Jiang

dblp:372/9849 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-9985-9469ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph matching
graph alignment
0.812024
GTCAlign: Global Topology Consistency-Based Graph Alignment · IEEE Trans. Knowl. Data Eng. 2024
Graph algorithms and graph theory
graph matching
0.812024
GTCAlign: Global Topology Consistency-Based Graph Alignment · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Graph learning
graph neural network
0.212024
GTCAlign: Global Topology Consistency-Based Graph Alignment · IEEE Trans. Knowl. Data Eng. 2024
Machine learning › Graph learning
network embedding
0.212024
GTCAlign: Global Topology Consistency-Based Graph Alignment · IEEE Trans. Knowl. Data Eng. 2024

Methods — techniques the papers use, named apart from their topics

iterative refinement · 1.5graph convolutional network · 1.5centrality metric · 1.5
YearPublicationVenuePosition
2026 Enhancing 3D Object Tracking via Dual-Context Propagation and Temporal Context Fusion
abstract
Point cloud-based 3D single object tracking (3D SOT) plays a pivotal role in applications such as autonomous driving and robotic vision. Despite recent progress, most existing approaches rely solely on current-frame features for target localization. This approach overlooks temporal information that is crucial for robust tracking under occlusion, appearance variations, and sparse point clouds. In addition, the effectiveness of 3D SOT largely depends on the quality of feature fusion between the target template and the search region. Traditional fusion strategies often suffer from limited interaction capacity and weak discriminative representation. To address these challenges, we propose DT-Tracker, which performs multi-layer bidirectional feature interaction and temporal cue propagation to improve tracking robustness and feature discrimination capability. Specifically, we introduce a Dual-Context Propagation Network that applies bidirectional cross-attention across multiple layers between the template and search region, enabling deep semantic alignment and progressive feature refinement. Furthermore, we design a Temporal Context Fusion module that adaptively incorporates temporal cues from historical fusion features into the current frame, effectively improving resilience to occlusion and appearance drift. Extensive experiments on the KITTI and nuScenes datasets demonstrate that DT-Tracker achieves competitive results compared to existing representative methods.
Peijing Jiang, Yuanping Zhang, Jinlong Pang, Zhongjun Lin
3DV1
2025 GDMETracker: Multi-Object Tracking Through Grouped Diffusion-Based Nonlinear Motion Prediction
Zhongjun Lin, Yuanping Zhang, Jinlong Pang, Peijing Jiang
PRCV (16)4
2025 RGBT Tracking via Wavelet Transformer and Cross-Modal Adaptive Fusion
Jinlong Pang, Yuanping Zhang, Peijing Jiang, Zhongiun Lin
PRCV (17)3
2024 GTCAlign: Global Topology Consistency-Based Graph Alignment
abstract
Graph alignment aims to find correspondent nodes between two graphs. Most existing algorithms assume that correspondent nodes in different graphs have similar local structures. However, this principle may not apply to some real-world application scenarios when two graphs have different densities. Some correspondent node pairs may have very different local structures in these cases. Nevertheless, correspondent nodes are expected to have similar importance, inspiring us to exploit global topology consistency for graph alignment. This paper presents GTCAlign, an unsupervised graph alignment framework based on global topology consistency. An indicating matrix is calculated to show node pairs with consistent global topology based on a comprehensive centrality metric. A graph convolutional network (GCN) encodes local structural and attributive information into low-dimensional node embeddings. Then, node similarities are computed based on the obtained node embeddings under the guidance of the indicating matrix. Moreover, a pair of nodes are more likely to be aligned if most of their neighbors are aligned, motivating us to develop an iterative algorithm to refine the alignment results recursively. We conduct extensive experiments on real-world and synthetic datasets to evaluate the effectiveness of GTCAlign. The experimental results show that GTCAlign outperforms state-of-the-art graph alignment approaches.
Chenxu Wang 0001, Peijing Jiang, Xiangliang Zhang 0001, Pinghui Wang, Tao Qin 0002, Xiaohong Guan
IEEE Trans. Knowl. Data Eng.2