DC-Net: Divide-and-Conquer for Salient Object Detection

Jiayi Zhu, Xuebin Qin, Abdulmotaleb Elsaddik
5/24/2023
cs.CV

Official code: PiggyJerry/DC-Net (22 stars, MIT, last commit 2024-08-30).

Abstract

In this paper, we introduce Divide-and-Conquer into the salient object detection (SOD) task to enable the model to learn prior knowledge that is for predicting the saliency map. We design a novel network, Divide-and-Conquer Network (DC-Net) which uses two encoders to solve different subtasks that are conducive to predicting the final saliency map, here is to predict the edge maps with width 4 and location maps of salient objects and then aggregate the feature maps with different semantic information into the decoder to predict the final saliency map. The decoder of DC-Net consists of our newly designed two-level Residual nested-ASPP (ResASPP$^{2}$) modules, which have the ability to capture a large number of different scale features with a small number of convolution operations and have the advantages of maintaining high resolution all the time and being able to obtain a large and compact effective receptive field (ERF). Based on the advantage of Divide-and-Conquer's parallel computing, we use Parallel Acceleration to speed up DC-Net, allowing it to achieve competitive performance on six LR-SOD and five HR-SOD datasets under high efficiency (60 FPS and 55 FPS). Codes and results are available: https://github.com/PiggyJerry/DC-Net.

View on arXivView PDF

Code Implementations(1)

PiggyJerry/DC-NetOfficial100%
MIT

The code for paper: "DC-Net: Divide-and-Conquer for Salient Object Detection"

221PythonMar 17, 20232 years agoMIT

Similar Papers

Cite this paper

@article{zhu2023dcnet,
  title  = {DC-Net: Divide-and-Conquer for Salient Object Detection},
  author = {Jiayi Zhu and Xuebin Qin and Abdulmotaleb Elsaddik},
  year   = {2023},
  eprint = {2305.14955},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.14955v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.14955.svg)](https://codeofpaper.com/paper/2305.14955)

Discussion