You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
6 December 1999Remote 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.
The alert did not successfully save. Please try again later.
Hong Chen, Weiqiang Liu, Deshen Xia, Jun Xie, "Remote sensing image segmentation based on game theory," Proc. SPIE 3759, Infrared Spaceborne Remote Sensing VII, (6 December 1999); https://doi.org/10.1117/12.372687