182 search results - page 19 / 37 » Hidden Conditional Random Fields for Meeting Segmentation |
109
click to vote
DAGM
2010
Springer
15 years 1 months ago
2010
Springer
A multi-class traffic scene segmentation approach based on scene flow data is presented. Opposed to many other approaches using color or texture features, our approach is purely ba...
142
Voted
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, we propose a unified graphical-model framework to interpret a scene composed of multiple objects in monocular video sequences. Using a single pairwise Markov random...
118
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
108
Voted
PAMI
2008
15 years 12 days ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
UAI
2004
15 years 1 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...