70 search results - page 11 / 14 » Learning Diagram Parts with Hidden Random Fields |
86
Voted
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a variational Bayesian framework for performing inference, density estimation and model selection in a special class of graphical models--Hidden Markov Random Fields (H...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
NIPS
1998
14 years 10 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...