Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts
<p>In recent years the use of graph-cuts has become quite popular in computer vision. However, researchers have repeatedly asked the question whether it might be possible to compute a measure of uncertainty associated with the graph-cut solutions. In this paper we answer this particular questi...
Main Authors: | Kohli, P, Torr, PHS |
---|---|
Formato: | Conference item |
Idioma: | English |
Publicado em: |
Springer
2006
|
Registos relacionados
-
Measuring uncertainty in graph cut solutions
Por: Kohli, P, et al.
Publicado em: (2008) -
Dynamic graph cuts and their applications in computer vision
Por: Kohli, P, et al.
Publicado em: (2010) -
Dynamic graph cuts for efficient inference in Markov random fields
Por: Kohli, P, et al.
Publicado em: (2007) -
Efficiently solving dynamic Markov random fields using graph cuts
Por: Kohli, P, et al.
Publicado em: (2005) -
Graph cut based inference with co-occurrence statistics
Por: Ladicky, L, et al.
Publicado em: (2010)