6005 search results - page 412 / 1201 » Graph-Theoretical Methods in Computer Vision |
193
Voted
ICCV
2009
IEEE
17 years 12 days ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
223
Voted
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
Active contour models are among the most popular PDE-based tools in computer vision. In this paper we present a new algorithm for the fast evolution of geodesic active contours an...
192
click to vote
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
193
Voted
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
The choice of a color space is of great importance for many computer vision algorithms (e.g. edge detection and object recognition). It induces the equivalence classes to the actu...
159
Voted
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
Taking a sequence of photographs using multiple illumination sources or settings is central to many computer vision and graphics problems. A growing number of recent methods use m...