mlsanityData to 14 Oct 2026

Unifying Feature and Cost Aggregation with Transformers for Semantic and Visual Correspondence

arXiv 2403.11120 ↗First posted 17 Mar 2024cs.CVcited by 14

Not on the map. Why?

Abstract (arXiv)

This paper introduces a Transformer-based integrative feature and cost aggregation network designed for dense matching tasks. In the context of dense matching, many works benefit from one of two forms of aggregation: feature aggregation, which pertains to the alignment of similar features, or cost aggregation, a procedure aimed at instilling coherence in the flow estimates across neighboring pixels. In this work, we first show that feature aggregation and cost aggregation exhibit distinct characteristics and reveal the potential for substantial benefits stemming from the judicious use of both aggregation processes. We then introduce a simple yet effective architecture that harnesses self- and cross-attention mechanisms to show that our approach unifies feature aggregation and cost aggregation and effectively harnesses the strengths of both techniques. Within the proposed attention layers, the features and cost volume both complement each other, and the attention layers are interleaved through a coarse-to-fine design to further promote accurate correspondence estimation. Finally at inference, our network produces multi-scale predictions, computes their confidence scores, and selects the most confident flow for final prediction. Our framework is evaluated on standard benchmarks for semantic matching, and also applied to geometric matching, where we show that our approach achieves significant improvements compared to existing methods.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 66 of its 90 references that are in the map. First posted on arXiv 17 Mar 2024.

Builds on

66 of 90 references.

References · 66

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  6. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  7. 2016Layer Normalizationcited by 5,669
  8. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
  9. 2016The Cityscapes Dataset for Semantic Urban Scene Understandingcited by 4,444
  10. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  11. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
  12. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
38 more
  1. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  2. 2016Semantic Understanding of Scenes through the ADE20K Datasetcited by 1,069
  3. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
  4. 2017PWC-Net: CNNs for Optical Flow Using Pyramid, Warping, and Cost Volumecited by 968
  5. 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 737
  6. 2018Albumentations: fast and flexible image augmentationscited by 560
  7. 2021Deep ViT Features as Dense Visual Descriptorscited by 330
  8. 2021GMFlow: Learning Optical Flow via Global Matchingcited by 327
  9. 2019D2-Net: A Trainable CNN for Joint Detection and Description of Local Featurescited by 326
  10. 2022FlowFormer: A Transformer Architecture for Optical Flowcited by 275
  11. 2022Unifying Flow, Stereo and Depth Estimationcited by 275
  12. 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
  13. 2019R2D2: Repeatable and Reliable Detector and Descriptorcited by 207
  14. 2020Revisiting Stereo Depth Estimation From a Sequence-to-Sequence Perspective with Transformerscited by 190
  15. 2021COTR: Correspondence Transformer for Matching Across Imagescited by 183
  16. 2022DKM: Dense Kernelized Feature Matching for Geometry Estimationcited by 177
  17. 2018Neighbourhood Consensus Networkscited by 174
  18. 2017DSLR-Quality Photos on Mobile Devices with Deep Convolutional Networkscited by 156
  19. 2018LF-Net: Learning Local Features from Imagescited by 151
  20. 2019SPair-71k: A Large-scale Benchmark for Semantic Correspondencecited by 146
  21. 2019GLU-Net: Global-Local Universal Network for Dense Flow and Correspondencescited by 139
  22. 2017Convolutional neural network architecture for geometric matchingcited by 138
  23. 2021SOFT: Softmax-free Transformer with Linear Complexitycited by 128
  24. 2022Cost Aggregation with 4D Convolutional Swin Transformer for Few-Shot Segmentationcited by 114
  25. 2021Learning Accurate Dense Correspondences and When to Trust Themcited by 113
  26. 2020Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutionscited by 93
  27. 2016Learning Dense Correspondence via 3D-guided Cycle Consistencycited by 91
  28. 2021PDC-Net+: Enhanced Probabilistic Dense Correspondence Networkcited by 80
  29. 2021CATs: Cost Aggregation Transformers for Visual Correspondencecited by 77
  30. 2015Unsupervised Object Discovery and Localization in the Wild: Part-based Matching with Bottom-up Region Proposalscited by 69
  31. 2018DGC-Net: Dense Geometric Correspondence Networkcited by 67
  32. 2021GAN-Supervised Dense Visual Alignmentcited by 62
  33. 2021Fastformer: Additive Attention Can Be All You Needcited by 61
  34. 2019SFNet: Learning Object-aware Semantic Correspondencecited by 60
  35. 2015Proposal Flowcited by 57
  36. 2019Hyperpixel Flow: Semantic Correspondence with Multi-layer Neural Featurescited by 56
  37. 2020Learning to Compose Hypercolumns for Visual Correspondencecited by 53
  38. 2020GOCor: Bringing Globally Optimized Correspondence Volumes into Your Neural Networkcited by 53

50 most cited of 66 All 66 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 6; 2026: 5.

14 papers.

Sort:

By area: