TL;DR
This paper introduces Squeeze Reasoning, a lightweight and efficient graph reasoning framework that enhances scene understanding tasks by reducing computational costs through feature squeezing and semantic graph modeling.
Contribution
It proposes a novel channel-wise feature squeezing method for graph reasoning, enabling efficient and effective scene understanding in high-resolution images.
Findings
Significant performance improvements on semantic segmentation datasets.
Effective across multiple scene understanding tasks like object detection and instance segmentation.
Lightweight design with modular integration into existing networks.
Abstract
Graph-based convolutional model such as non-local block has shown to be effective for strengthening the context modeling ability in convolutional neural networks (CNNs). However, its pixel-wise computational overhead is prohibitive which renders it unsuitable for high resolution imagery. In this paper, we explore the efficiency of context graph reasoning and propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector and perform reasoning within the single vector where the computation cost can be significantly reduced. Specifically, we build the node graph in the vector where each node represents an abstract semantic concept. The refined feature within the same semantic category results to be consistent, which is thus beneficial for downstream tasks. We show that…
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
Methods1x1 Convolution · Residual Connection · Non-Local Operation · Non-Local Block
