51 search results - page 2 / 11 » Learning CRFs Using Graph Cuts |
119
Voted
ECCV
2008
Springer
16 years 2 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
136
click to vote
WIDM
2004
ACM
15 years 6 months ago
2004
ACM
A Focused crawler must use information gleaned from previously crawled page sequences to estimate the relevance of a newly seen URL. Therefore, good performance depends on powerfu...
121
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
108
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
127
Voted
BMVC
2010
14 years 7 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...