From SAM to DINOv2: Towards Distilling Foundation Models to Lightweight Baselines for Generalized Polyp Segmentation
Not on the map. Why?
Abstract (arXiv)
Accurate polyp segmentation during colonoscopy is critical for the early detection of colorectal cancer and still remains challenging due to significant size, shape, and color variations, and the camouflaged nature of polyps. While lightweight baseline models such as U-Net, U-Net++, and PraNet offer advantages in terms of easy deployment and low computational cost, they struggle to deal with the above issues, leading to limited segmentation performance. In contrast, large-scale vision foundation models such as SAM, DINOv2, OneFormer, and Mask2Former have exhibited impressive generalization performance across natural image domains. However, their direct transfer to medical imaging tasks (e.g., colonoscopic polyp segmentation) is not straightforward, primarily due to the scarcity of large-scale datasets and lack of domain-specific knowledge. To bridge this gap, we propose a novel distillation framework, Polyp-DiFoM, that transfers the rich representations of foundation models into lightweight segmentation baselines, allowing efficient and accurate deployment in clinical settings. In particular, we infuse semantic priors from the foundation models into canonical architectures such as U-Net and U-Net++ and further perform frequency domain encoding for enhanced distillation, corroborating their generalization capability. Extensive experiments are performed across five benchmark datasets, such as Kvasir-SEG, CVC-ClinicDB, ETIS, ColonDB, and CVC-300. Notably, Polyp-DiFoM consistently outperforms respective baseline models significantly, as well as the state-of-the-art model, with nearly 9 times reduced computation overhead. The code is available at https://github.com/lostinrepo/PolypDiFoM.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 36 references that are in the map. First posted on arXiv 10 Dec 2025.
Builds on
24 of 36 references.
References · 24
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2023Segment Anythingcited by 8,158
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2021Masked-attention Mask Transformer for Universal Image Segmentationcited by 2,338
- 2021Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutionscited by 1,960
- 2018UNet++: A Nested U-Net Architecture for Medical Image Segmentationcited by 1,518
- 2021Per-Pixel Classification is Not All You Need for Semantic Segmentationcited by 1,148
- 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 982
- 2020A Survey on Visual Transformercited by 653
- 2019Kvasir-SEG: A Segmented Polyp Datasetcited by 588
12 more
- 2017Structure-measure: A New Way to Evaluate Foreground Mapscited by 480
- 2022MaxViT: Multi-Axis Vision Transformercited by 476
- 2020PraNet: Parallel Reverse Attention Network for Polyp Segmentationcited by 460
- 2018Enhanced-alignment Measure for Binary Foreground Map Evaluationcited by 370
- 2022OneFormer: One Transformer to Rule Universal Image Segmentationcited by 327
- 2016A Benchmark for Endoluminal Scene Segmentation of Colonoscopy Imagescited by 220
- 2021Polyp-PVT: Polyp Segmentation with Pyramid Vision Transformerscited by 159
- 2021Shallow Attention Network for Polyp Segmentationcited by 107
- 2021Automatic Polyp Segmentation via Multi-scale Subtraction Networkcited by 77
- 2024EMCAD: Efficient Multi-scale Convolutional Attention Decoding for Medical Image Segmentationcited by 64
- 2023MEGANet: Multi-Scale Edge-Guided Attention Network for Weak Boundary Polyp Segmentationcited by 28
- 2024SAM-Mamba: Mamba Guided SAM Architecture for Generalized Zero-Shot Polyp Segmentationcited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.