1575 search results - page 40 / 315 » Unsupervised Learning of Models for Recognition |
153
Voted
PAMI
2010
15 years 1 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
172
Voted
DAGM
2011
Springer
14 years 3 months ago
2011
Springer
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
118
Voted
ACL
2008
2008
Using Adaptor Grammars to Identify Synergies in the Unsupervised Acquisition of Linguistic Structure
15 years 5 months ago
Adaptor grammars (Johnson et al., 2007b) are a non-parametric Bayesian extension of Probabilistic Context-Free Grammars (PCFGs) which in effect learn the probabilities of entire s...
151
Voted
JMLR
2010
14 years 10 months ago
2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
123
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. Humans demonstrate a remarkable ability to parse complicated motion sequences into their constituent structures and motions. We investigate this problem, attempting to le...