Parallel version of image segmentation algorithm using polygonal markov fields

Authors:
Rafał Kluszczyński;Piotr Bała
Affiliations:
Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, Warsaw, Poland;Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, Warsaw, Poland, Department of Mathematics and Computer Science, Nicolaus Copernicus University, Toru ...
Venue:
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Year:
2011

Citing 5
Cited 0

Parallel simulated annealing algorithms

Journal of Parallel and Distributed Computing
Parallel simulated annealing by mixing of states

Journal of Computational Physics
Digital Picture Processing

Digital Picture Processing
Algorithms for Reporting and Counting Geometric Intersections

IEEE Transactions on Computers
An algorithm for binary image segmentation using polygonal markov fields

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing

Quantified Score

Hi-index	0.00

Visualization

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.