Dynamic graph cuts and their applications in computer vision
Over the last few years energy minimization has emerged as an indispensable tool in computer vision. The primary reason for this rising popularity has been the successes of efficient graph cut based minimization algorithms in solving many low level vision problems such as image segmentation, object...
Main Authors: | Kohli, P, Torr, PHS |
---|---|
Format: | Book section |
Language: | English |
Published: |
Springer
2010
|
Similar Items
-
Measuring uncertainty in graph cut solutions – efficiently computing min-marginal energies using dynamic graph cuts
by: Kohli, P, et al.
Published: (2006) -
Dynamic graph cuts for efficient inference in Markov random fields
by: Kohli, P, et al.
Published: (2007) -
Efficiently solving dynamic Markov random fields using graph cuts
by: Kohli, P, et al.
Published: (2005) -
Measuring uncertainty in graph cut solutions
by: Kohli, P, et al.
Published: (2008) -
Simultaneous segmentation and pose estimation of humans using dynamic graph cuts
by: Kohli, P, et al.
Published: (2008)