1996
DOI: 10.1109/91.493905
|View full text |Cite
|
Sign up to set email alerts
|

Validity-guided (re)clustering with applications to image segmentation

Abstract: When clustering algorithms are applied to image segmentation, the goal is to solve a classification problem. However, these algorithms do not directly optimize classification quality. As a result, they are susceptible to two problems: P1) the criterion they optimize may not be a good estimator of "true" classification quality, and P2) they often admit many (suboptha€) solutions. This paper introduces an algorithm that uses cluster validity to mitigate P1 and P2. The validity-guided (re)clustering (VGC) algorit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
163
0
4

Year Published

1999
1999
2014
2014

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 372 publications
(170 citation statements)
references
References 26 publications
(21 reference statements)
0
163
0
4
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%
“…(1) can be rewritten as (5) By applying the log-transform on both sides of Eqn. (1), denoting the log-transformed observed MR image data as y k , and the log-transformed true intensity of underlying tissues as x k , the MR image data can be approximated using the conventional manner as1,31 (6) where The estimation of bias field should be completed for each clustering iteration. Therfore, for efficiency, the choice of basis functions for approximating the bias field is important.…”
Section: A Multi-spectral Adaptive Fcmmentioning
confidence: 99%
See 1 more Smart Citation
“…a gaussian kernel N λ (l, j), taking values in [0,1] such that values within the block more or less contribute.…”
Section: Overlap Of Clustersmentioning
confidence: 99%
“…• The bi-dimensional artificial data set Bensaid [1] characterized by 3 classes of different cardinalities (6, 3 and 40).…”
mentioning
confidence: 99%