Sciweavers

840 search results - page 31 / 168
» A New Discriminative Kernel From Probabilistic Models
Sort
View
ACCV
2009
Springer
15 years 4 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
RECOMB
2005
Springer
15 years 10 months ago
Learning Interpretable SVMs for Biological Sequence Classification
Background: Support Vector Machines (SVMs) ? using a variety of string kernels ? have been successfully applied to biological sequence classification problems. While SVMs achieve ...
Christin Schäfer, Gunnar Rätsch, Sö...
CVPR
2011
IEEE
14 years 6 months ago
On Deep Generative Models with Applications to Recognition
The most popular way to use probabilistic models in vision is first to extract some descriptors of small image patches or object parts using well-engineered features, and then to...
Marc', Aurelio Ranzato, Joshua Susskind, Volodymyr...
IJCAI
2003
14 years 11 months ago
Semi-Supervised Learning with Explicit Misclassification Modeling
This paper investigates a new approach for training discriminant classifiers when only a small set of labeled data is available together with a large set of unlabeled data. This a...
Massih-Reza Amini, Patrick Gallinari
IJCV
2006
161views more  IJCV 2006»
14 years 9 months ago
Discriminative Random Fields
In this research we address the problem of classification and labeling of regions given a single static natural image. Natural images exhibit strong spatial dependencies, and mode...
Sanjiv Kumar, Martial Hebert