2020
DOI: 10.1016/j.procs.2020.03.333
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Segmentation Algorithms for the Detection of Breast Cancer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0
2

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 22 publications
0
7
0
2
Order By: Relevance
“…For this study, they achieved the best result with the highest accuracy in real-time. The study of [26] Three machine learning algorithms, such as the kmeans clustering, active contour model (ACM), and fuzzy c-means clustering algorithm, should be used for comparison. To demonstrate the efficiency of these three segmentation algorithms, the experimental assessment uses different quantitative tests to classify images into benign and malignant classifier with the highest accuracy.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…For this study, they achieved the best result with the highest accuracy in real-time. The study of [26] Three machine learning algorithms, such as the kmeans clustering, active contour model (ACM), and fuzzy c-means clustering algorithm, should be used for comparison. To demonstrate the efficiency of these three segmentation algorithms, the experimental assessment uses different quantitative tests to classify images into benign and malignant classifier with the highest accuracy.…”
Section: Discussionmentioning
confidence: 99%
“…The essential purpose of pre-processing is to enhance the consistency of the image. It prepares the images to be ready for further the cells structures normal and abnormal cells [26]…”
Section: Pre-processingmentioning
confidence: 99%
See 2 more Smart Citations
“…The iteration number with the cluster centroid is affected by the first randomly set cluster centroid (Lin and Ji, 2020). Therefore, it can be fixed to achieve higher performance by identifying the cluster centroid at high baseline data points (Aswathy and Jagannath, 2020). Since K-means clustering is usually applied, the data point { ,{ , ..., x n } is grouped into k clusters.…”
Section: K -Means Clusteringmentioning
confidence: 99%