230 search results - page 20 / 46 » Generalized fast marching method: applications to image segm... |
134
click to vote
ICIP
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper we present some methods for indexing and segmenting colour images. The proposed procedures are based on well-known algorithms, but now we use digital distance functi...
193
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
150
Voted
CIVR
2007
Springer
15 years 12 months ago
2007
Springer
In this paper, we present a real-time algorithm for 3D object detection in images. Our method relies on the Ullman and Basri [13] theory which claims that the same object under di...
207
click to vote
ICDM
2006
IEEE
15 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...
164
click to vote
GBRPR
2009
Springer
15 years 3 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...