Sciweavers

203 search results - page 23 / 41
» Random walks on graphs to model saliency in images
Sort
View
104
Voted
SIGIR
2009
ACM
15 years 7 months ago
Smoothing clickthrough data for web search ranking
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
Jianfeng Gao, Wei Yuan, Xiao Li, Kefeng Deng, Jian...
WEBI
2005
Springer
15 years 5 months ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
ECCV
2010
Springer
15 years 5 months ago
Graph Cut based Inference with Co-occurrence Statistics
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
81
Voted
WWW
2009
ACM
16 years 1 months ago
Tag ranking
Social media sharing web sites like Flickr allow users to annotate images with free tags, which significantly facilitate Web image search and organization. However, the tags assoc...
Dong Liu, Xian-Sheng Hua, Linjun Yang, Meng Wang, ...
131
Voted
CVPR
2009
IEEE
1148views Computer Vision» more  CVPR 2009»
16 years 7 months ago
Shape Constrained Figure-Ground Segmentation and Tracking
Global shape information is an effective top-down complement to bottom-up figure-ground segmentation as well as a useful constraint to avoid drift during adaptive tracking. We p...
Zhaozheng Yin, Robert T. Collins