TENCON 2009 - 2009 IEEE Region 10 Conference 2009
DOI: 10.1109/tencon.2009.5396049
|View full text |Cite
|
Sign up to set email alerts
|

Harmony search-based cluster initialization for fuzzy c-means segmentation of MR images

Abstract: Abstract-We propose a new approach to tackle the well known fuzzy c-means (FCM) initialization problem. Our approach uses a metaheuristic search method called Harmony Search (HS) algorithm to produce near-optimal initial cluster centers for the FCM algorithm. We then demonstrate the effectiveness of our approach in a MRI segmentation problem. In order to dramatically reduce the computation time to find nearoptimal cluster centers, we use an alternate representation of the search space. Our experiments indicate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 27 publications
(33 reference statements)
0
21
0
Order By: Relevance
“…It mimics the process of the musicians playing their instruments and attempting to create a well-balanced harmony. It has a soft computing technique that is similar to the genetic algorithm [3] and it has the capacity to exploit our proposed solution vector (harmony vector) with the synchronization of the search space where intensification and diversification environmental optimization are parallel [4].…”
Section: Harmony Search Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…It mimics the process of the musicians playing their instruments and attempting to create a well-balanced harmony. It has a soft computing technique that is similar to the genetic algorithm [3] and it has the capacity to exploit our proposed solution vector (harmony vector) with the synchronization of the search space where intensification and diversification environmental optimization are parallel [4].…”
Section: Harmony Search Algorithmmentioning
confidence: 99%
“…The solution procedure of the HS algorithm is controlled using three parameters [4,21]: HMS, HMCR, and PAR. These parameters are defined in the following section.…”
Section: Harmony Search Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…It has a soft computing technique that is similar to the genetic algorithm [12] and it has capacity to exploit the new solution proposed (harmony) with the synchronization of the search space at a time with intensification and diversification environmental optimization parallel [10].…”
Section: Harmony Search Algorithmmentioning
confidence: 99%
“…Select a value totally random from range possible of values: defined as "randomization". These three rules of HS algorithm are directed by using the three parameters [7,10], which are as follows: Harmony Memory Size (HMS), Harmony Memory Considering Rate (HMCR) and Pitch Adjusting Rate (PAR).…”
Section: Journal Of Computer Sciences and Applicationsmentioning
confidence: 99%