A graph-based system to simulate the movements and interactions of multiple random walkers (MRW) is proposed in this work. In the MRW system, multiple agents traverse a single graph simultaneously. To achieve desired interactions among those agents, a restart rule can be designed, which determines the restart distribution of each agent according to the probability distributions of all agents. In particular, we develop the repulsive rule for data clustering. We illustrate that the MRW clustering can segment real images reliably. Furthermore, we propose a novel image cosegmentation algorithm based on the MRW clustering. Specifically, the proposed algorithm consists of two steps: inter-image concurrence computation and intra-image MRW clustering. Experimental results demonstrate that the proposed algorithm provides promising cosegmentation performance.
Chulwoo Lee, Won-Dong Jang, Jae-Young Sim, and Chang-Su Kim, “Multiple random walkers and their application to image cosegmentation,” in Proc. IEEE International Conference on Computer Vision and Pattern Recognition (CVPR), Boston, USA, pp. 123-456, Jun. 2015. [extAbst] [pdf] [supp] [poster-ppt] [poster-pdf]
Download MRWCS_v1_0.zip (2.64 MB)