803 search results - page 129 / 161 » Independence in Direct-Product Graphs |
SODA
1992
ACM
13 years 9 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
CVPR
2004
IEEE
14 years 10 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...
CVPR
2005
IEEE
14 years 10 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...
ICCV
1999
IEEE
14 years 10 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...
ECCV
2002
Springer
14 years 10 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...