The Community for Technology Leaders
Circuits, Communications and Systems, Pacific-Asia Conference on (2009)
Chengdu, China
May 16, 2009 to May 17, 2009
ISBN: 978-0-7695-3614-9
pp: 730-734
ABSTRACT
Swarm optimization has been proved suitable to solve various combinatorial optimization problems. Markov random field (MRF) based MRF-based early vision problem has higher dimensions, more complicate structure of solution space, and dynamic constrain conditions. Based on a dynamic multi-colony ant scheme, this paper proposes a dynamic cooperative swarm optimization model to estimate the labels fields and minimize the MAP estimation in MRF-based early vision problem. Firstly, MRF-based early vision problems are divided into several sub-problems according to divide-and-conquer principle, and each colony optimizes one sub-problem independently. Then, a set of information exchange strategies are proposed for adaptive dynamic cooperation between neighboring colonies to implement the global optimization. Lastly, the proposed swarm optimization model is applied to solve stereo correspondence problem, and it can also solve the image segmentation problem. Experiments show this method can achieve good results.
INDEX TERMS
swarm optimization; Markov random field; early vison; multi-colony ant; cooperation
CITATION
Wenhui Zhou, Lili Lin, "A Dynamic Cooperative Swarm Optimization Model for MRF-Based Early Vision Problem", Circuits, Communications and Systems, Pacific-Asia Conference on, vol. 00, no. , pp. 730-734, 2009, doi:10.1109/PACCS.2009.183
93 ms
(Ver 3.3 (11022016))