TL;DR
This paper introduces a dynamic scale routing method for salient object detection that adaptively selects kernel sizes based on input, improving multi-scale feature representation and achieving state-of-the-art results.
Contribution
It proposes the dynamic pyramid convolution (DPConv) and a self-adaptive bidirectional decoder to enable scale-aware feature extraction in SOD models.
Findings
Enhanced SOD performance with dynamic scale routing
Effective handling of tiny and large salient objects
Achieved state-of-the-art results on benchmark datasets
Abstract
Recent research advances in salient object detection (SOD) could largely be attributed to ever-stronger multi-scale feature representation empowered by the deep learning technologies. The existing SOD deep models extract multi-scale features via the off-the-shelf encoders and combine them smartly via various delicate decoders. However, the kernel sizes in this commonly-used thread are usually "fixed". In our new experiments, we have observed that kernels of small size are preferable in scenarios containing tiny salient objects. In contrast, large kernel sizes could perform better for images with large salient objects. Inspired by this observation, we advocate the "dynamic" scale routing (as a brand-new idea) in this paper. It will result in a generic plug-in that could directly fit the existing feature backbone. This paper's key technical innovations are two-fold. First, instead of…
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
MethodsConvolution
