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

Shuxian Luo

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

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

Graphics, 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 · 67% Deep learning architectures and training · 33%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › feature matching › local feature matching
efficient feature matching
0.812024
AMatFormer: Efficient Feature Matching via Anchor Matching Transformer · IEEE Trans. Multim. 2024
Computer vision › 3D vision
feature matching
0.812024
AMatFormer: Efficient Feature Matching via Anchor Matching Transformer · IEEE Trans. Multim. 2024
Machine learning › Deep learning architectures and training
transformer
0.812024
AMatFormer: Efficient Feature Matching via Anchor Matching Transformer · IEEE Trans. Multim. 2024

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

self-attention · 0.8feed-forward network · 0.8cross-attention · 0.8
YearPublicationVenuePosition
2024 AMatFormer: Efficient Feature Matching via Anchor Matching Transformer
abstract
Learning based feature matching methods have been commonly studied in recent years. The core issue for learning feature matching is to how to learn (1) discriminative representations for feature points (or regions) within each intra-image and (2) consensus representations for feature points across inter-images. Recently, self- and cross-attention models have been exploited to address this issue. However, in many scenes, features are coming with large-scale, redundant and outliers contaminated. Previous self-/cross-attention models generally conduct message passing on all primal features which thus lead to redundant learning and high computational cost. To mitigate limitations, inspired by recent seed matching methods, in this article, we propose a novel efficient Anchor Matching Transformer (AMatFormer) for the feature matching problem. AMatFormer has two main aspects: First, it mainly conducts self-/cross-attention on some anchor features and leverages these anchor features as message bottleneck to learn the representations for all primal features. Thus, it can be implemented efficiently and compactly. Second, AMatFormer adopts a shared FFN module to further embed the features of two images into the common domain and thus learn the consensus feature representations for the matching problem. Experiments on several benchmarks demonstrate the effectiveness and efficiency of the proposed AMatFormer matching approach.
Bo Jiang 0002, Shuxian Luo, Xiao Wang 0014, Chuanfu Li, Jin Tang 0001
IEEE Trans. Multim.2