%0 Journal Article %A XIE Jian-chun %A XIA Yong %A ZHAO Rong-chun %T Parallel segmentation of textured images by using Markov random field %D 2008 %R %J Computer Engineering and Applications %P 181-183 %V 44 %N 14 %X This paper presents a parallel segmentation algorithm for textured images on a computer cluster.Adopting the Message Passing Interface(MPI)and the message passing programming model,this algorithm splits an image into a set of rectangular regions and sends each region to a computer,so that the Markov Random Field(MRF)can be estimated as the texture feature of each pixel on all computers simultaneously.As a result,the time cost of segmentation is greatly reduced.The parallel algorithm has been applied to the segmentation of remote sensing images.The comparative experiments show that,on a four-computer cluster,the parallel algorithm is 3.13 times faster than the serial one.The satisfying results demonstrate that proposed algorithm can provide not only faster segmentation but some inspiration for parallel implementation of computational intensive image processing algorithms. %U http://cea.ceaj.org/EN/abstract/article_17049.shtml