Chapter

Parallel Processing and Applied Mathematics

Volume 7203 of the series Lecture Notes in Computer Science pp 276-285

Parallel Version of Image Segmentation Algorithm Using Polygonal Markov Fields

  • Rafał KluszczyńskiAffiliated withInterdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw
  • , Piotr BałaAffiliated withInterdisciplinary Centre for Mathematical and Computational Modelling, University of WarsawDepartment of Mathematics and Computer Science, Nicolaus Copernicus University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Keywords

Image segmentation Polygonal Markov field Parallel simulated annealing