Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2015 |
| Publisher | IEEE Computer Society |
| Pages | 3837-3845 |
| Number of pages | 9 |
| ISBN (Electronic) | 9781467369640 |
| DOIs | |
| Publication status | Published - 2015 Oct 14 |
| Event | IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2015 - Boston, United States Duration: 2015 Jun 7 → 2015 Jun 12 |
Publication series
| Name | Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition |
|---|---|
| Volume | 07-12-June-2015 |
| ISSN (Print) | 1063-6919 |
Other
| Other | IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2015 |
|---|---|
| Country/Territory | United States |
| City | Boston |
| Period | 15/6/7 → 15/6/12 |
Bibliographical note
Publisher Copyright:© 2015 IEEE.
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition