paper-with-me

Papers

Multiple Random Walkers and Their Application to Image Cosegmentation

2015-06-01 · CVPR 2015 6 · Chulwoo Lee, Won-Dong Jang, Jae-Young Sim, Chang-Su Kim

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.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Stochastic compartment model with mortality and its application to epidemic spreading in complex networks

2024-03-18 · Teo Granger, Thomas M. Michelitsch, Michael Bestehorn, Alejandro P. Riascos 외

We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on Bara…

Selection of Random Walkers that Optimizes the Global Mean First-Passage Time for Search in Complex Networks

2018-12-12 · Mucong Ding, Kwok Yip Szeto

We design a method to optimize the global mean first-passage time (GMFPT) of multiple random walkers searching in complex networks for a general target, without specifying the property of the target node. According to th…

Spiking Neural Algorithms for Markov Process Random Walk

2018-05-01 · William Severa, Rich Lehoucq, Ojas Parekh, James B. Aimone

The random walk is a fundamental stochastic process that underlies many numerical tasks in scientific computing applications. We consider here two neural algorithms that can be used to efficiently implement random walks …

From random walks to epidemic spreading: Compartment model with mortality for vector transmitted diseases

2025-02-12 · Téo Granger, Thomas M. Michelitsch, Bernard A. Collet, Michael Bestehorn 외

We propose a compartmental model for vector-transmitted diseases, such as Malaria and Dengue, spreading over complex networks. Individuals are represented by independent random walkers and vectors by infected nodes. Both…

Compartment model with retarded transition rates

2023-08-28 · Teo Granger, Thomas Michelitsch, Bernard Collet, Michael Bestehorn 외

Our study is devoted to a four-compartment epidemic model of a constant population of independent random walkers. Each walker is in one of four compartments (S-susceptible, C-infected but not infectious (period of incuba…

modelNavigate