2021
DOI: 10.1155/2021/4553832
|View full text |Cite
|
Sign up to set email alerts
|

An Optimized Approach for Prostate Image Segmentation Using K‐Means Clustering Algorithm with Elbow Method

Abstract: Prostate cancer disease is one of the common types that cause men’s prostate damage all over the world. Prostate-specific membrane antigen (PSMA) expressed by type-II is an extremely attractive style for imaging-based diagnosis of prostate cancer. Clinically, photodynamic therapy (PDT) is used as noninvasive therapy in treatment of several cancers and some other diseases. This paper aims to segment or cluster and analyze pixels of histological and near-infrared (NIR) prostate cancer images acquired by PSMA-tar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0
1

Year Published

2022
2022
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 57 publications
(23 citation statements)
references
References 28 publications
0
22
0
1
Order By: Relevance
“…In this study, K -means was used to improve the clustering color image segmentation algorithm and obtain relatively accurate initial parameters of the algorithm through the image HSI color space adaptive, which can significantly reduce the requirements on initial input parameters of the image. The method of computing the similarity of each pixel using multidimensional feature vector can greatly reduce the misclassification rate of each pixel in the image, thus reducing the number of iterations during the operation of the algorithm, and improving the image segmentation efficiency while maintaining low time complexity [ 25 , 26 ]. K -means improved clustering color image segmentation algorithm before and after processing abnormal uterine bleeding patient vaginal ultrasound image display.…”
Section: Discussionmentioning
confidence: 99%
“…In this study, K -means was used to improve the clustering color image segmentation algorithm and obtain relatively accurate initial parameters of the algorithm through the image HSI color space adaptive, which can significantly reduce the requirements on initial input parameters of the image. The method of computing the similarity of each pixel using multidimensional feature vector can greatly reduce the misclassification rate of each pixel in the image, thus reducing the number of iterations during the operation of the algorithm, and improving the image segmentation efficiency while maintaining low time complexity [ 25 , 26 ]. K -means improved clustering color image segmentation algorithm before and after processing abnormal uterine bleeding patient vaginal ultrasound image display.…”
Section: Discussionmentioning
confidence: 99%
“…Also, considering both the Calinski-Harabasz index and the silhouette coefficient, k = 2 or 3 might be candidate clustering numbers. Finally, the optimal number (k = 3) of clusters was determined by the elbow method, a heuristic approach for determining the appropriate point for the local optimum (41,42), as shown in Figure 6.…”
Section: Internal Cluster Validationmentioning
confidence: 99%
“…habitats) was determined ( 26 ). This typically requires additional analysis such as the within cluster sum-of-squared or ‘Elbow plot’ method ( 54 ). This method plots the number of clusters (x-axis) against the sum of squared distance between each point and the centroid (y-axis).…”
Section: Habitat Imaging In Glioblastoma: Status and Potentialmentioning
confidence: 99%