2016 International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT) 2016
DOI: 10.1109/iceeccot.2016.7955181
|View full text |Cite
|
Sign up to set email alerts
|

Segmentation of rectum from CT images using K-means clustering for the EBRT of prostate cancer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Clustering‐based methods extract a set of feature vectors with the goal of identifying groups or clusters of similar objects based on the feature vectors. Proximity measures are used to group data into clusters of similar types Machine learning‐based methods regard prostate as a learning‐based target .…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Clustering‐based methods extract a set of feature vectors with the goal of identifying groups or clusters of similar objects based on the feature vectors. Proximity measures are used to group data into clusters of similar types Machine learning‐based methods regard prostate as a learning‐based target .…”
Section: Introductionmentioning
confidence: 99%
“…Proximity measures are used to group data into clusters of similar types. 13 4. Machine learning-based methods regard prostate as a learning-based target.…”
Section: Introductionmentioning
confidence: 99%
“…The proposed method is nearly correct, easy and efficient. The bounding box representation of ROI will decrease the processing time for volume rendering and hence proves to be efficient over the conventional method for utilizing the whole image [12] Abba Suganda Girsang(2016) et al presents About the algorithm to maintain the best fitness value, this paper presents a model robust algorithm for solving the problem of clustering, namely Robust Adaptive Genetic KMeans, Algorithm, called RAGKA has been shown in this paper. At first solving the problems of clustering using K-Means, but K-Means are often trapped local optimum, then K-Means combined with GA.…”
Section: K-nearest Neighbour (K-nn)mentioning
confidence: 99%