203 search results - page 36 / 41 » Random walks on graphs to model saliency in images |
124
click to vote
ICIG
2009
IEEE
14 years 10 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
102
click to vote
TIP
2010
14 years 7 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
114
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
GLOBECOM
2006
IEEE
15 years 6 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
109
click to vote
STOC
2009
ACM
16 years 29 days ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...