Graph cut based inference with co-occurrence statistics
Markov and Conditional random fields (crfs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In this paper we consider a class of global potentials defined over all variables in the crf. We show how they can be readily optimised...
Main Authors: | Ladicky, L, Russell, C, Kohli, P, Torr, PHS |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado em: |
Springer
2010
|
Registos relacionados
-
Inference methods for CRFs with co-occurrence statistics
Por: Ladický, Ľ, et al.
Publicado em: (2012) -
Exact and approximate inference in associative hierarchical networks using graph cuts
Por: Russell, C, et al.
Publicado em: (2010) -
Dynamic graph cuts for efficient inference in Markov random fields
Por: Kohli, P, et al.
Publicado em: (2007) -
Measuring uncertainty in graph cut solutions
Por: Kohli, P, et al.
Publicado em: (2008) -
Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts
Por: Kohli, P, et al.
Publicado em: (2006)