Parallel Version of Image Segmentation Algorithm Using Polygonal Markov Fields

  • Rafał Kluszczyński
  • Piotr Bała
Conference paper

DOI: 10.1007/978-3-642-31464-3_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7203)
Cite this paper as:
Kluszczyński R., Bała P. (2012) Parallel Version of Image Segmentation Algorithm Using Polygonal Markov Fields. In: Wyrzykowski R., Dongarra J., Karczewski K., Waśniewski J. (eds) Parallel Processing and Applied Mathematics. PPAM 2011. Lecture Notes in Computer Science, vol 7203. Springer, Berlin, Heidelberg


In this paper we present an application of parallel simulated annealing method to a segmentation algorithm using polygonal Markov fields. After a brief presentation of the algorithm and a general scheme of parallelization methods using simulated annealing technique, there is presented parallel approach to the segmentation algorithm with different synchronization scenarios.

Authors also present results of the parallelization of the segmentation algorithm. There is discussed comparison between simulations with different synchronization scenarios applied to the multiple-trial approach of simulated annealing technique. Some simulations based on the number of threads are presented as well.


Image segmentation Polygonal Markov field Parallel simulated annealing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rafał Kluszczyński
    • 1
  • Piotr Bała
    • 1
    • 2
  1. 1.Interdisciplinary Centre for Mathematical and Computational ModellingUniversity of WarsawWarsawPoland
  2. 2.Department of Mathematics and Computer ScienceNicolaus Copernicus UniversityToruńPoland

Personalised recommendations