Evolutionary optimization with Markov random field prior

Authors:
Xiao Wang;Han Wang
Affiliations:
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2004

Citing 0
Cited 4

An MRF model-based approach to the detection of rectangular shape objects in color images

Signal Processing
Image based reconstruction using hybrid optimization of simulated annealing and genetic algorithm

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A markov random field based hybrid algorithm with simulated annealing and genetic algorithm for image segmentation

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
A review on probabilistic graphical models in evolutionary computation

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work discusses an evolutionary algorithm in which the constituent variables of a solution are modeled by a Markov random field (MRF). We maintain a population of potential solutions at every generation and for each solution a fitness value is calculated. The evolution, however, is not achieved through genetic recombination. Instead, each variable in a solution will be updated by sampling from its probability distribution. According to the MRF prior, local exploitation is encoded in the conditional probabilities. For evolutionary exploration, we estimate the probabilities as fitness-weighted statistics. These two kinds of search are combined smoothly in our algorithm. We compare it with two representative algorithms [iterated conditional modes (ICM) and simulated annealing (SA)] on noisy and textured image segmentation. Remarkable performance is observed.