203 search results - page 16 / 41 » Random walks on graphs to model saliency in images |
116
click to vote
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
HICSS
2006
IEEE
15 years 6 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
111
click to vote
CVIU
2007
15 years 10 days ago
2007
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...