207 search results - page 26 / 42 » Unsupervised Learning for Graph Matching |
196
Voted
ACCV
2010
Springer
14 years 9 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
152
Voted
JMLR
2006
15 years 2 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
152
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
134
click to vote
NIPS
2008
15 years 3 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
126
Voted
CIKM
2010
Springer
15 years 7 days ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...