ParaFormer: Parallel Attention Transformer for Efficient Feature Matching

Xiaoyong Lu, Yaping Yan, Bin Kang, Songlin Du
3/2/2023
cs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Heavy computation is a bottleneck limiting deep-learningbased feature matching algorithms to be applied in many realtime applications. However, existing lightweight networks optimized for Euclidean data cannot address classical feature matching tasks, since sparse keypoint based descriptors are expected to be matched. This paper tackles this problem and proposes two concepts: 1) a novel parallel attention model entitled ParaFormer and 2) a graph based U-Net architecture with attentional pooling. First, ParaFormer fuses features and keypoint positions through the concept of amplitude and phase, and integrates self- and cross-attention in a parallel manner which achieves a win-win performance in terms of accuracy and efficiency. Second, with U-Net architecture and proposed attentional pooling, the ParaFormer-U variant significantly reduces computational complexity, and minimize performance loss caused by downsampling. Sufficient experiments on various applications, including homography estimation, pose estimation, and image matching, demonstrate that ParaFormer achieves state-of-the-art performance while maintaining high efficiency. The efficient ParaFormer-U variant achieves comparable performance with less than 50% FLOPs of the existing attention-based models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lu2023paraformer,
  title  = {ParaFormer: Parallel Attention Transformer for Efficient Feature Matching},
  author = {Xiaoyong Lu and Yaping Yan and Bin Kang and Songlin Du},
  year   = {2023},
  eprint = {2303.00941},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.00941v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.00941.svg)](https://codeofpaper.com/paper/2303.00941)

Discussion