Papers › DDANet: Dual Decoder Attention Network for Automatic Polyp Segmentation
DDANet: Dual Decoder Attention Network for Automatic Polyp Segmentation
Nikhil Kumar Tomar, Debesh Jha, Sharib Ali, Håvard D. Johansen, Dag Johansen, Michael A. Riegler, Pål Halvorsen
Colonoscopy is the gold standard for examination and detection of colorectal polyps. Localization and delineation of polyps can play a vital role in treatment (e.g., surgical planning) and prognostic decision making. Polyp segmentation can provide detailed boundary information for clinical analysis. Convolutional neural networks have improved the performance in colonoscopy. However, polyps usually possess various challenges, such as intra-and inter-class variation and noise. While manual labeling for polyp assessment requires time from experts and is prone to human error (e.g., missed lesions), an automated, accurate, and fast segmentation can improve the quality of delineated lesion boundaries and reduce missed rate. The Endotect challenge provides an opportunity to benchmark computer vision methods by training on the publicly available Hyperkvasir and testing on a separate unseen dataset. In this paper, we propose a novel architecture called ``DDANet'' based on a dual decoder attention network. Our experiments demonstrate that the model trained on the Kvasir-SEG dataset and tested on an unseen dataset achieves a dice coefficient of 0.7874, mIoU of 0.7010, recall of 0.7987, and a precision of 0.8577, demonstrating the generalization ability of our model.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Medical Image Segmentation | Endotect Polyp Segmentation Challenge Dataset | DDANet | DSC | 0.7870 | #1 of 2 | Archive leaderboard | report |
| Medical Image Segmentation | Endotect Polyp Segmentation Challenge Dataset | DDANet | FPS | 70.23 | #1 of 2 | Archive leaderboard | report |
| Medical Image Segmentation | Endotect Polyp Segmentation Challenge Dataset | DDANet | mIoU | 0.701 | #1 of 2 | Archive leaderboard | report |
| Medical Image Segmentation | Kvasir-SEG | DDANet | FPS | 69.59 | #50 of 58 | Archive leaderboard | report |
| Medical Image Segmentation | Kvasir-SEG | DDANet | mIoU | 0.7800 | #50 of 58 | Archive leaderboard | report |
| Medical Image Segmentation | Kvasir-SEG | DDANet | mean Dice | 0.8576 | #50 of 58 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections