arrow
Return

A Method for Polyp Segmentation Through U-Net Network

delete2025-02-26
delete0
delete
OA
AI
A
Antonella Santone
M
Mario Cesarelli
F
Francesco Mercaldo *
DOI:10.3390/bioengineering12030236delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Early detection of colorectal polyps through endoscopic colonoscopy is crucial in reducing colorectal cancer mortality. While automated polyp segmentation has been explored to enhance detection accuracy and efficiency, challenges remain in achieving precise boundary delineation, particularly for small or flat polyps. In this work, we propose a novel U-Net-based segmentation framework specifically optimized for real-world endoscopic colonoscopy data. Unlike conventional approaches, our method leverages high-resolution frames with pixel-level ground-truth annotations to achieve superior segmentation performance. The U-Net architecture, with its symmetric encoder-decoder design and skip connections, is further adapted to enhance both high-level contextual understanding and fine-grained detail preservation. Our model has been rigorously evaluated on a real-world dataset, demonstrating state-of-the-art accuracy in polyp boundary segmentation, even in challenging cases. By improving detection consistency and reducing observer variability, our approach provides a robust tool to support gastroenterologists in clinical decision-making. Beyond real-time clinical applications, this work contributes to advancing automated and standardized polyp detection, paving the way for more reliable AI-assisted endoscopic analysis.
Keywords:
colon
deep learning
segmentation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

B
Bioengineering
IF:
3.7
Papers:
5.9K
Citations:
1.3W

Organization

University of Sannio cover
University of Sannio
Scholars:
2.3K
Papers: 2.2K
Citations: 2.3K
U
University of Molise
Scholars:
2.6K
Papers: 2.6K
Citations: 2.8K