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

Dongli Tan

dblp:330/1360 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
—ORCID · conflict

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

Artificial intelligence and machine learning · 5 · 3 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 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.

Artificial intelligence
3 papers
3D vision · 84% Video understanding and tracking · 16%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
feature tracking
0.912025
ReTracker: Exploring Image Matching for Robust Online Any Point Tracking · ICCV 2025
Computer vision › 3D vision › feature matching › dense feature matching
detector-free matching
0.812024
Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed · CVPR 2024
Computer vision › 3D vision › feature matching › local feature matching
efficient feature matching
0.812024
Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed · CVPR 2024
Computer vision › 3D vision › feature matching
local feature matching
0.812024
Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed · CVPR 2024
Computer vision › 3D vision › feature matching
semi-dense feature matching
0.812024
Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed · CVPR 2024
Computer vision › 3D vision
coarse-to-fine refinement
0.612022
ECO-TR: Efficient Correspondences Finding via Coarse-to-Fine Refinement · ECCV (10) 2022
Computer vision › 3D vision
correspondence estimation
0.612022
ECO-TR: Efficient Correspondences Finding via Coarse-to-Fine Refinement · ECCV (10) 2022
Computer vision › 3D vision
feature matching
0.312025
ReTracker: Exploring Image Matching for Robust Online Any Point Tracking · ICCV 2025

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

two-stage correlation · 0.8aggregated attention · 0.8adaptive token selection · 0.8
YearPublicationVenuePosition
2026 Enhancing fairness and privacy in federated graph neural networks via macro-level restructuring
Dongli Tan, Zuobin Ying, Zijie Pan, Yu-an Tan 0001, Tianqing Zhu, Wanlei Zhou 0001
Knowl. Based Syst.1
2025 ReTracker: Exploring Image Matching for Robust Online Any Point Tracking
Dongli Tan, Sida Peng, Yiqing Gong, Jiaming Sun 0002, Ruizhen Hu, Yujun Shen, Hujun Bao, Xiaowei Zhou 0001
ICCV1
2025 Resource Optimization for FPGA-Based SM9 Digital Signature Algorithm
Dezhi An, Guifeng Han, Dongli Tan, Yujie Shao, Shengcai Zhang
KSEM (2)3
2024 Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speed
abstract
We present a novel method for efficiently producing semi-dense matches across images. Previous detector-free matcher LoFTR has shown remarkable matching capability in handling large-viewpoint change and texture-poor scenarios but suffers from low efficiency. We revisit its design choices and derive multiple improvements for both efficiency and accuracy. One key observation is that performing the transformer over the entire feature map is redundant due to shared local information, therefore we propose an aggregated attention mechanism with adaptive token selection for efficiency. Furthermore, we find spatial variance exists in LoFTR's fine correlation module, which is adverse to matching accuracy. A novel two-stage correlation layer is proposed to achieve accurate subpixel correspon-dences for accuracy improvement. Our efficiency optimized model is ~ 2.5 x faster than LoFTR which can even surpass state-of-the-art efficient sparse matching pipeline Super-Point + LightGlue. Moreover, extensive experiments show that our method can achieve higher accuracy compared with competitive semi-dense matchers, with considerable efficiency benefits. This opens up exciting prospects for large-scale or latency-sensitive applications such as image retrieval and 3D reconstruction. Project page: https://zju3dv.github.io/efficientloftr/.
Yifan Wang 0026, Sida Peng, Dongli Tan, Xiaowei Zhou 0001
CVPR4
2022 ECO-TR: Efficient Correspondences Finding via Coarse-to-Fine Refinement
Dongli Tan, Jiang-Jiang Liu 0001, Chao Chen 0026, Yunhang Shen, Shouhong Ding, Rongrong Ji
ECCV (10)1