203 search results - page 2 / 41 » Random walks on graphs to model saliency in images |
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
TAP
2010
Springer
13 years 3 months ago
2010
Springer
raction, simplification, segmentation, illumination, rendering, and illustration. Even though this technique is inspired by models of low-level human vision, it has not yet been v...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
BMVC
2010
12 years 12 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
ICDM
2006
IEEE
13 years 11 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...