1411 search results - page 277 / 283 » Toward Objective Evaluation of Image Segmentation Algorithms |
109
click to vote
NPAR
2004
ACM
15 years 5 months ago
2004
ACM
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
132
Voted
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
119
click to vote
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are unlabele...
107
click to vote
SMA
2009
ACM
15 years 7 months ago
2009
ACM
We present practical algorithms for accelerating geometric queries on models made of NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized f...
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
Correspondence problems are of great importance in
computer vision. They appear as subtasks in many applications
such as object recognition, merging partial 3D reconstructions
a...