981 search results - page 190 / 197 » Segmentation of Shapes |
159
click to vote
PAMI
2010
15 years 3 months ago
2010
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
158
click to vote
ECCV
2008
Springer
16 years 7 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
138
click to vote
ICCV
2003
IEEE
16 years 7 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
142
click to vote
RECOMB
2004
Springer
16 years 5 months ago
2004
Springer
The distribution of the lengths of genomic segments inverte during the evolutionary divergence of two species cannot be inferred d rectly from the output of genome rearrangement al...
184
click to vote
CVPR
2009
IEEE
15 years 12 months ago
2009
IEEE
Illuminant estimation from shadows typically relies on accurate segmentation of the shadows and knowledge of exact 3D geometry, while shadow estimation is difficult in the presen...