Real-Time Polyp Detection, Localization and Segmentation in Colonoscopy
Using Deep Learning
- URL: http://arxiv.org/abs/2011.07631v2
- Date: Wed, 31 Mar 2021 20:21:06 GMT
- Title: Real-Time Polyp Detection, Localization and Segmentation in Colonoscopy
Using Deep Learning
- Authors: Debesh Jha, Sharib Ali, Nikhil Kumar Tomar, H{\aa}vard D. Johansen,
Dag D. Johansen, Jens Rittscher, Michael A. Riegler, and P{\aa}l Halvorsen
- Abstract summary: We benchmark several recent state-of-the-art methods using Kvasir-SEG, an open-access dataset of colonoscopy images.
We show that the proposed ColonSegNet achieved a better trade-off between an average precision of 0.8000 and mean IoU of 0.8100, and the fastest speed of 180 frames per second for the detection and localisation task.
- Score: 1.331701345310088
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Computer-aided detection, localisation, and segmentation methods can help
improve colonoscopy procedures. Even though many methods have been built to
tackle automatic detection and segmentation of polyps, benchmarking of
state-of-the-art methods still remains an open problem. This is due to the
increasing number of researched computer vision methods that can be applied to
polyp datasets. Benchmarking of novel methods can provide a direction to the
development of automated polyp detection and segmentation tasks. Furthermore,
it ensures that the produced results in the community are reproducible and
provide a fair comparison of developed methods. In this paper, we benchmark
several recent state-of-the-art methods using Kvasir-SEG, an open-access
dataset of colonoscopy images for polyp detection, localisation, and
segmentation evaluating both method accuracy and speed. Whilst, most methods in
literature have competitive performance over accuracy, we show that the
proposed ColonSegNet achieved a better trade-off between an average precision
of 0.8000 and mean IoU of 0.8100, and the fastest speed of 180 frames per
second for the detection and localisation task. Likewise, the proposed
ColonSegNet achieved a competitive dice coefficient of 0.8206 and the best
average speed of 182.38 frames per second for the segmentation task. Our
comprehensive comparison with various state-of-the-art methods reveals the
importance of benchmarking the deep learning methods for automated real-time
polyp identification and delineations that can potentially transform current
clinical practices and minimise miss-detection rates.
Related papers
- CRIS: Collaborative Refinement Integrated with Segmentation for Polyp Segmentation [0.0]
We propose an approach that integrates mask refinement and binary semantic segmentation.
We demonstrate the superiority of our approach through comprehensive evaluation on established benchmark datasets.
arXiv Detail & Related papers (2024-05-30T03:56:01Z) - Validating polyp and instrument segmentation methods in colonoscopy through Medico 2020 and MedAI 2021 Challenges [58.32937972322058]
"Medico automatic polyp segmentation (Medico 2020)" and "MedAI: Transparency in Medical Image (MedAI 2021)" competitions.
We present a comprehensive summary and analyze each contribution, highlight the strength of the best-performing methods, and discuss the possibility of clinical translations of such methods into the clinic.
arXiv Detail & Related papers (2023-07-30T16:08:45Z) - TransNetR: Transformer-based Residual Network for Polyp Segmentation
with Multi-Center Out-of-Distribution Testing [2.3293678240472517]
We propose a novel real-time deep learning based architecture, Transformer based Residual network (TransNetR) for colon polyp segmentation.
TransNetR is an encoder-decoder network that consists of a pre-trained ResNet50 as the encoder, three decoder blocks, and an upsampling layer at the end of the network.
It obtains a high dice coefficient of 0.8706 and a mean Intersection over union of 0.8016 and retains a real-time processing speed of 54.60 on the Kvasir-SEG dataset.
arXiv Detail & Related papers (2023-03-13T19:11:17Z) - Predicted Embedding Power Regression for Large-Scale Out-of-Distribution
Detection [77.1596426383046]
We develop a novel approach that calculates the probability of the predicted class label based on label distributions learned during the training process.
Our method performs better than current state-of-the-art methods with only a negligible increase in compute cost.
arXiv Detail & Related papers (2023-03-07T18:28:39Z) - RUPNet: Residual upsampling network for real-time polyp segmentation [2.6179759969345002]
We propose a novel architecture, Residual Upsampling Network (RUPNet) for colon polyp segmentation.
With an image size of $512 times 512$, the proposed method achieves an excellent real-time operation speed of 152.60 frames per second.
arXiv Detail & Related papers (2023-01-06T20:21:37Z) - Delving into Sequential Patches for Deepfake Detection [64.19468088546743]
Recent advances in face forgery techniques produce nearly untraceable deepfake videos, which could be leveraged with malicious intentions.
Previous studies has identified the importance of local low-level cues and temporal information in pursuit to generalize well across deepfake methods.
We propose the Local- & Temporal-aware Transformer-based Deepfake Detection framework, which adopts a local-to-global learning protocol.
arXiv Detail & Related papers (2022-07-06T16:46:30Z) - On the Limits of Pseudo Ground Truth in Visual Camera Re-localisation [83.29404673257328]
Re-localisation benchmarks measure how well each method replicates the results of a reference algorithm.
This begs the question whether the choice of the reference algorithm favours a certain family of re-localisation methods.
This paper analyzes two widely used re-localisation datasets and shows that evaluation outcomes indeed vary with the choice of the reference algorithm.
arXiv Detail & Related papers (2021-09-01T12:01:08Z) - AG-CUResNeSt: A Novel Method for Colon Polyp Segmentation [0.0]
This paper proposes a novel neural network architecture called AG-CUResNeSt, which enhances Coupled UNets using the robust ResNeSt backbone and attention gates.
We show that our proposed method achieves state-of-the-art accuracy compared to existing methods.
arXiv Detail & Related papers (2021-05-02T06:36:36Z) - DDANet: Dual Decoder Attention Network for Automatic Polyp Segmentation [0.3734402152170273]
We propose a novel architecture called DDANet'' based on a dual decoder attention network.
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.
arXiv Detail & Related papers (2020-12-30T17:52:35Z) - Collaborative Training between Region Proposal Localization and
Classification for Domain Adaptive Object Detection [121.28769542994664]
Domain adaptation for object detection tries to adapt the detector from labeled datasets to unlabeled ones for better performance.
In this paper, we are the first to reveal that the region proposal network (RPN) and region proposal classifier(RPC) demonstrate significantly different transferability when facing large domain gap.
arXiv Detail & Related papers (2020-09-17T07:39:52Z) - Change Point Detection in Time Series Data using Autoencoders with a
Time-Invariant Representation [69.34035527763916]
Change point detection (CPD) aims to locate abrupt property changes in time series data.
Recent CPD methods demonstrated the potential of using deep learning techniques, but often lack the ability to identify more subtle changes in the autocorrelation statistics of the signal.
We employ an autoencoder-based methodology with a novel loss function, through which the used autoencoders learn a partially time-invariant representation that is tailored for CPD.
arXiv Detail & Related papers (2020-08-21T15:03:21Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.