The reviewed record of science sign in
Pith

arxiv: 2111.00772 · v3 · pith:YYE2NNCW · submitted 2021-11-01 · cs.CV

AdaPool: Exponential Adaptive Pooling for Information-Retaining Downsampling

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:YYE2NNCWrecord.jsonopen to challenge →

classification cs.CV
keywords adapoolpoolingmethodvideoadaptiveadaunpoolcomputationalconvolutional
0
0 comments X
read the original abstract

Pooling layers are essential building blocks of convolutional neural networks (CNNs), to reduce computational overhead and increase the receptive fields of proceeding convolutional operations. Their goal is to produce downsampled volumes that closely resemble the input volume while, ideally, also being computationally and memory efficient. Meeting both these requirements remains a challenge. To this end, we propose an adaptive and exponentially weighted pooling method: adaPool. Our method learns a regional-specific fusion of two sets of pooling kernels that are based on the exponent of the Dice-Sorensen coefficient and the exponential maximum, respectively. AdaPool improves the preservation of detail on a range of tasks including image and video classification and object detection. A key property of adaPool is its bidirectional nature. In contrast to common pooling methods, the learned weights can also be used to upsample activation maps. We term this method adaUnPool. We evaluate adaUnPool on image and video super-resolution and frame interpolation. For benchmarking, we introduce Inter4K, a novel high-quality, high frame-rate video dataset. Our experiments demonstrate that adaPool systematically achieves better results across tasks and backbones, while introducing a minor additional computational and memory overhead.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.