203 search results - page 14 / 41 » Random walks on graphs to model saliency in images |
86
Voted
BMVC
2001
15 years 2 months ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
131
click to vote
ADHOCNOW
2004
Springer
15 years 5 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
ICCV
1999
IEEE
16 years 2 months ago
1999
IEEE
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
100
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
126
click to vote
PAMI
2007
14 years 12 months ago
2007
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation a...