Sciweavers

203 search results - page 26 / 41
» Random walks on graphs to model saliency in images
Sort
View
SIGIR
2009
ACM
15 years 7 months ago
On social networks and collaborative recommendation
Social network systems, like last.fm, play a significant role in Web 2.0, containing large amounts of multimedia-enriched data that are enhanced both by explicit user-provided an...
Ioannis Konstas, Vassilios Stathopoulos, Joemon M....
WWW
2002
ACM
16 years 1 months ago
The structure of broad topics on the web
The Web graph is a giant social network whose properties have been measured and modeled extensively in recent years. Most such studies concentrate on the graph structure alone, an...
Soumen Chakrabarti, Mukul Joshi, Kunal Punera, Dav...
113
Voted
CVPR
2011
IEEE
14 years 4 months ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
151
Voted
ICIP
2008
IEEE
15 years 6 months ago
Generalized ELL for detecting and tracking through illumination model changes
In previous work, we developed the Illum-PF-MT, which is the PFMT idea applied to the problem of tracking temporally and spatially varying illumination change. In many practical p...
Amit Kale, Namrata Vaswani
ECCV
2006
Springer
16 years 2 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...