Papers › PraNet: Parallel Reverse Attention Network for Polyp Segmentation

PraNet: Parallel Reverse Attention Network for Polyp Segmentation

13 Jun 2020arXiv:2006.11392archive 2025-07-28

Deng-Ping Fan, Ge-Peng Ji, Tao Zhou, Geng Chen, Huazhu Fu, Jianbing Shen, Ling Shao

Colonoscopy is an effective technique for detecting colorectal polyps, which are highly related to colorectal cancer. In clinical practice, segmenting polyps from colonoscopy images is of great importance since it provides valuable information for diagnosis and surgery. However, accurate polyp segmentation is a challenging task, for two major reasons: (i) the same type of polyps has a diversity of size, color and texture; and (ii) the boundary between a polyp and its surrounding mucosa is not sharp. To address these challenges, we propose a parallel reverse attention network (PraNet) for accurate polyp segmentation in colonoscopy images. Specifically, we first aggregate the features in high-level layers using a parallel partial decoder (PPD). Based on the combined feature, we then generate a global map as the initial guidance area for the following components. In addition, we mine the boundary cues using a reverse attention (RA) module, which is able to establish the relationship between areas and boundary cues. Thanks to the recurrent cooperation mechanism between areas and boundaries, our PraNet is capable of calibrating any misaligned predictions, improving the segmentation accuracy. Quantitative and qualitative evaluations on five challenging datasets across six metrics show that our PraNet improves the segmentation accuracy significantly, and presents a number of advantages in terms of generalizability, and real-time segmentation efficiency.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2006.11392")

Code

Syntology Ran 0 of 9 code samples harvested from 1 repository linked to this paper; 9 have no recorded run.

By repository: community (archive-listed): 9 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

DengPingFan/PraNet officialmentioned in paperpytorch report
GewelsJI/PNS-Net mentioned on GitHubpytorchApache-2.0 report
yuwenlo/hardnet-dfus mentioned on GitHubpytorch report

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

9 samples harvested; 0 ran; 0 honoured the contract we drafted; 9 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

9unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from Thehunk1206/PRANet-Polyps-Segmentation. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

MAE Thehunk1206/PRANet-Polyps-Segmentation/utils/segmentation_metric.py community (archive-listed) unverified MIT (permissive) · 5f19cb59109dcf70 · report
dice_coef Thehunk1206/PRANet-Polyps-Segmentation/utils/segmentation_metric.py community (archive-listed) unverified MIT (permissive) · 9552f127ab03fa34 · report
get_model Thehunk1206/PRANet-Polyps-Segmentation/polyps_seg_image.py community (archive-listed) unverified MIT (permissive) · bc51eaabbba19a1c · report
get_weights Thehunk1206/PRANet-Polyps-Segmentation/utils/visualize_bce_iou_loss_weigth.py community (archive-listed) unverified MIT (permissive) · 4c598561b0fdb5cf · report
iou_metric Thehunk1206/PRANet-Polyps-Segmentation/utils/segmentation_metric.py community (archive-listed) unverified MIT (permissive) · 653839c46c4ad30d · report
preprocess_input Thehunk1206/PRANet-Polyps-Segmentation/polyps_seg_video.py community (archive-listed) unverified MIT (permissive) · 77cacc9801b27be9 · report
process_output Thehunk1206/PRANet-Polyps-Segmentation/train_pranet.py community (archive-listed) unverified MIT (permissive) · ed2b923957eea909 · report
read_image Thehunk1206/PRANet-Polyps-Segmentation/polyps_seg_image.py community (archive-listed) unverified MIT (permissive) · cc515a5c9eee8242 · report
read_mask Thehunk1206/PRANet-Polyps-Segmentation/utils/visualize_bce_iou_loss_weigth.py community (archive-listed) unverified MIT (permissive) · c328287dda0da3e4 · report

Tasks

Camouflage SegmentationCamouflaged Object SegmentationDecoderMedical Image SegmentationSegmentationVideo Polyp Segmentation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Camouflaged Object Segmentation CAMO PraNet MAE 0.094 #10 of 14 Archive leaderboard report
Camouflaged Object Segmentation CAMO PraNet S-Measure 0.769 #10 of 14 Archive leaderboard report
Camouflaged Object Segmentation CAMO PraNet Weighted F-Measure 0.663 #10 of 14 Archive leaderboard report
Camouflaged Object Segmentation PCOD_1200 PraNet S-Measure 0.904 #3 of 16 Archive leaderboard report
Medical Image Segmentation CVC-ClinicDB PraNet mean Dice 0.8990 #44 of 48 Archive leaderboard report
Medical Image Segmentation CVC-ColonDB PraNet Average MAE 0.045 #25 of 25 Archive leaderboard report
Medical Image Segmentation CVC-ColonDB PraNet S-Measure 0.819 #25 of 25 Archive leaderboard report
Medical Image Segmentation CVC-ColonDB PraNet mIoU 0.649 #25 of 25 Archive leaderboard report
Medical Image Segmentation CVC-ColonDB PraNet max E-Measure 0.869 #25 of 25 Archive leaderboard report
Medical Image Segmentation CVC-ColonDB PraNet mean Dice 0.709 #25 of 25 Archive leaderboard report
Medical Image Segmentation ETIS-LARIBPOLYPDB PraNet Average MAE 0.031 #24 of 25 Archive leaderboard report
Medical Image Segmentation ETIS-LARIBPOLYPDB PraNet S-Measure 0.794 #24 of 25 Archive leaderboard report
Medical Image Segmentation ETIS-LARIBPOLYPDB PraNet mIoU 0.5670 #24 of 25 Archive leaderboard report
Medical Image Segmentation ETIS-LARIBPOLYPDB PraNet max E-Measure 0.841 #24 of 25 Archive leaderboard report
Medical Image Segmentation ETIS-LARIBPOLYPDB PraNet mean Dice 0.6280 #24 of 25 Archive leaderboard report
Medical Image Segmentation Kvasir-SEG PraNet Average MAE 0.030 #44 of 58 Archive leaderboard report
Medical Image Segmentation Kvasir-SEG PraNet S-Measure 0.915 #44 of 58 Archive leaderboard report
Medical Image Segmentation Kvasir-SEG PraNet mIoU 0.849 #44 of 58 Archive leaderboard report
Medical Image Segmentation Kvasir-SEG PraNet max E-Measure 0.948 #44 of 58 Archive leaderboard report
Medical Image Segmentation Kvasir-SEG PraNet mean Dice 0.898 #44 of 58 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet Dice 0.621 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet S measure 0.733 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet Sensitivity 0.524 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet mean E-measure 0.753 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet mean F-measure 0.632 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Easy (Unseen) PraNet weighted F-measure 0.572 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet Dice 0.598 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet S-Measure 0.717 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet Sensitivity 0.512 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet mean E-measure 0.735 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet mean F-measure 0.607 #12 of 18 Archive leaderboard report
Video Polyp Segmentation SUN-SEG-Hard (Unseen) PraNet weighted F-measure 0.544 #12 of 18 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