Handbook of Medical Imaging 2000
DOI: 10.1016/b978-012077790-7/50010-2
|View full text |Cite
|
Sign up to set email alerts
|

Image Segmentation by Fuzzy Clustering: Methods and Issues

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0
2

Year Published

2002
2002
2011
2011

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 19 publications
(33 citation statements)
references
References 35 publications
0
31
0
2
Order By: Relevance
“…In addition, more complicated methods such as those described in 27,11 would be helpful in increasing the computational efficiency. Further performance improvement could be obtained by considering the grand mean and cluster scatter matrices within and between clusters in the unsupervised clustering 45,19,8,9,12,5,6,28,29,39,52.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…In addition, more complicated methods such as those described in 27,11 would be helpful in increasing the computational efficiency. Further performance improvement could be obtained by considering the grand mean and cluster scatter matrices within and between clusters in the unsupervised clustering 45,19,8,9,12,5,6,28,29,39,52.…”
Section: Resultsmentioning
confidence: 99%
“…The fundamentals of fuzzy clustering in medical image segmentation have been reviewed by Sutton et al 45. The main formalism presented in this paper is based on the grouped coordinate descent method (also called alternating optimization (AO)) 45.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The partition of the feature space (e.g., scatter plot) is through a crisp membership function, i.e., 0 or 1. The fuzzy clustering is a more sophisticated approach [7], which groups the pixels according to the degree of similarity between 0 and 1. This way of partition is more realistic in labeling the regions of foreground spots from the background as well as from possible artifacts.…”
Section: Clustering Based Approachesmentioning
confidence: 99%
“…Euclidian distance is another metric that is mostly used and expressed as (4) In this case, the minimization of objective function (2) leads to the k-means clustering. It is also called the hard c-means (HCM) clustering [7], where the membership element u ji is 1 if the jth data point x j belongs to class Ω i , and 0 otherwise, i.e., (5) The feature space is then partitioned by a membership matrix (U) of dimension n × c with the above element of u ji and each pixel is labeled by the element u ji .…”
Section: Fuzzy Clustering Modelsmentioning
confidence: 99%