3008 search results - page 492 / 602 » Independence in connected graphs |
219
click to vote
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
212
Voted
CVPR
2005
IEEE
16 years 9 months ago
2005
IEEE
Geometric active contours are formulated in a manner which is parametrization independent. As such, they are amenable to representation as the zero level set of the graph of a hig...
163
Voted
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
168
Voted
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
189
click to vote
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Learning typical motion patterns or activities from videos of crowded scenes is an important visual surveillance problem. To detect typical motion patterns in crowded scenarios, w...