Remote sensing image segmentation based on game theory

According to the characteristics of the remote sensing image, the problem of segmentation can be converted to the problem of symbolizing, and finally converted to the solution of Maximum A Posterior (MAP). The global optimum can be found by the algorithm of Simulated Annealing (SA), but it requires a large amount of computations. So sub-optimal algorithm is often used. In this paper we provide a decisive algorithm which is based on 'Game Theory' and prove that it can converge to a local optimum. Because the image we got has too many fragments, we use a grid-algorithm to improve the segmented image and the good result has been got in the experiment.

[1]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[2]  Glenn Healey,et al.  Markov Random Field Models for Unsupervised Segmentation of Textured Color Images , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Anil K. Jain,et al.  Markov Random Field Texture Models , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Haluk Derin,et al.  Modeling and Segmentation of Noisy and Textured Images Using Gibbs Random Fields , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.