BAM: Bottleneck Attention Module
Jongchan Park, Sanghyun Woo, Joon-Young Lee, and In So Kweon

TL;DR
The paper introduces BAM, a simple attention module that enhances neural network performance by inferring hierarchical channel and spatial attention at bottlenecks, improving accuracy across multiple benchmarks.
Contribution
It proposes a novel, trainable attention module that can be integrated into any CNN, improving performance without significant complexity.
Findings
Consistent performance improvements on CIFAR-100, ImageNet-1K, VOC 2007, and MS COCO.
Effective integration with various CNN architectures.
Enhancement in both classification and detection tasks.
Abstract
Recent advances in deep neural networks have been developed via architecture search for stronger representational power. In this work, we focus on the effect of attention in general deep neural networks. We propose a simple and effective attention module, named Bottleneck Attention Module (BAM), that can be integrated with any feed-forward convolutional neural networks. Our module infers an attention map along two separate pathways, channel and spatial. We place our module at each bottleneck of models where the downsampling of feature maps occurs. Our module constructs a hierarchical attention at bottlenecks with a number of parameters and it is trainable in an end-to-end manner jointly with any feed-forward models. We validate our BAM through extensive experiments on CIFAR-100, ImageNet-1K, VOC 2007 and MS COCO benchmarks. Our experiments show consistent improvement in classification…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · COVID-19 diagnosis using AI
MethodsBottleneck Attention Module
