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

Yanbing Han

dblp:431/8116 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
1 paper
3D vision · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › feature matching
correspondence learning
1.012026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026
Computer vision › 3D vision
feature matching
1.012026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026
Computer vision › 3D vision › low-level vision › feature detection
unsupervised keypoint learning
1.012026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026
Computer vision › 3D vision
camera pose estimation
0.312026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026
Computer vision › 3D vision › camera pose estimation
relative pose estimation
0.312026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026
Computer vision › 3D vision
visual localization
0.312026
Collaborative Feature Matching with Progressive Correspondence Learning · AAAI 2026

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

adaptive sampling · 1.0
YearPublicationVenuePosition
2026 Collaborative Feature Matching with Progressive Correspondence Learning
abstract
Accurate feature matching between image pairs is fundamental for various computer vision applications. In detector-base process, the feature matcher aims to find the optimal feature correspondences, and the match filter is used for further removing mismatches. However, their connection is rarely exploited since they are usually treated as two separate issues in previous method, which may lead to suboptimal results. In this paper, we propose an end-to-end collaborative feature matching (CFM) method, which contains a keypoint learning (KL) module and a correspondence learning (CL) module, to bridge the gap between two types of works. The former improves the discrimination of keypoints, and provides high-quality dynamic matches for CL module. The latter further captures the rich context of matches, and gives effective feedback to KL module. These two modules can reinforce each other in a progressive manner. Besides, we develop an efficient version of CFM, named ECFM, using an adaptive sampling strategy to avoid the negative influence of uninformative keypoints. Experimental results indicate that both methods outperform the state-of-the-art competitors in the tasks of relative pose estimation and visual localization.
Xin Liu 0091, Yanbing Han, Rong Qin 0001, Bing Wang 0013, Jufeng Yang
AAAI2