2022
DOI: 10.1016/j.patrec.2021.12.014
|View full text |Cite
|
Sign up to set email alerts
|

An unsupervised approach of colonic polyp segmentation using adaptive markov random fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 19 publications
0
9
0
Order By: Relevance
“…Most of the previous work in polyp classification uses supervised learning processes like a Hessian filter and Support vector machine (SVM), Recurrent Convolutional Neural Network (RCNN), etc. These methods have various demerits such as finding the optimal value of the threshold in the case of SVM, and poor segmentation due to irregularly shaped polyps for SA-DOVA [4]. In [4], the authors adopt an adaptive Markov random field (MRF) method which is an unsupervised learning method.…”
Section: B Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Most of the previous work in polyp classification uses supervised learning processes like a Hessian filter and Support vector machine (SVM), Recurrent Convolutional Neural Network (RCNN), etc. These methods have various demerits such as finding the optimal value of the threshold in the case of SVM, and poor segmentation due to irregularly shaped polyps for SA-DOVA [4]. In [4], the authors adopt an adaptive Markov random field (MRF) method which is an unsupervised learning method.…”
Section: B Related Workmentioning
confidence: 99%
“…These methods have various demerits such as finding the optimal value of the threshold in the case of SVM, and poor segmentation due to irregularly shaped polyps for SA-DOVA [4]. In [4], the authors adopt an adaptive Markov random field (MRF) method which is an unsupervised learning method. The method over-segments the image into super pixels which are then refined by Local Binary Pattern (LBP) and color features used in the adaptive MRF.…”
Section: B Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Many image segmentation algorithms have been proposed in the literature, from the traditional techniques, such as thresholding [ 30 , 31 , 32 , 33 ], edge-based segmentation [ 34 , 35 ], histogram-based bundling, region-based segmentation [ 36 , 37 , 38 , 39 ], clustering-based segmentation [ 40 , 41 , 42 , 43 , 44 ], watershed methods [ 45 , 46 , 47 , 48 , 49 ], to more advanced algorithms such as active contours [ 50 , 51 , 52 , 53 ], graph cuts [ 54 , 55 , 56 , 57 ], conditional and Markov random fields [ 58 , 59 , 60 , 61 ], and sparsity-based methods [ 62 , 63 , 64 ].…”
Section: Introductionmentioning
confidence: 99%
“…The performance of the deep learning model for polyp segmentation was compared by Trinh et al [31], the best accuracy network required the high enough performance devices. An adaptive Markov random field was also proposed by Sasmal et al [32] for the polyp segmentation task, this is an unsupervised learning method. The advantage of this approach is the smaller consumption time, however, the network efficiency is not better than the supervised method.…”
Section: Introductionmentioning
confidence: 99%