Sciweavers

203 search results - page 3 / 41
» Random walks on graphs to model saliency in images
Sort
View
CVPR
2012
IEEE
11 years 8 months ago
Mode-seeking on graphs via random walks
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
Minsu Cho, Kyoung Mu Lee
PAMI
2006
440views more  PAMI 2006»
13 years 5 months ago
Random Walks for Image Segmentation
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
Leo Grady
CIVR
2010
Springer
299views Image Analysis» more  CIVR 2010»
13 years 8 months ago
Co-reranking by mutual reinforcement for image search
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
Ting Yao, Tao Mei, Chong-Wah Ngo
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
13 years 4 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
ENDM
2006
70views more  ENDM 2006»
13 years 5 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich