Affiliations 

  • 1 School of Computer Science, Universiti Sains Malaysia, 11800, Penang, Malaysia
Biomed Mater Eng, 2014;24(6):3333-41.
PMID: 25227043 DOI: 10.3233/BME-141156

Abstract

To segment an image using the random walks algorithm; users are often required to initialize the approximate locations of the objects and background in the image. Due to its segmenting model that is mainly reflected by the relationship among the neighborhood pixels and its boundary conditions, random walks algorithm has made itself sensitive to the inputs of the seeds. Instead of considering the relationship between the neighborhood pixels solely, an attempt has been made to modify the weighting function that accounts for the intensity changes between the neighborhood nodes. Local affiliation within the defined neighborhood region of the two nodes is taken into consideration by incorporating an extra penalty term into the weighting function. Besides that, to better segment images, particularly medical images with texture features, GLCM variance is incorporated into the weighting function through kernel density estimation (KDE). The probability density of each pixel belonging to the initialized seeds is estimated and integrated into the weighting function. To test the performance of the proposed weighting model, several medical images that mainly made up of 174-brain tumor images are experimented. These experiments establish that the proposed method produces better segmentation results than the original random walks.

* Title and MeSH Headings from MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine.