Measuring Uncertainty in Graph Cut Solutions – Efficiently Computing Min-marginal Energies Using Dynamic Graph Cuts
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 30-43
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- PoseCut: Simultaneous Segmentation and 3D Pose Estimation of Humans Using Dynamic Graph-Cuts2006
- Efficiently solving dynamic Markov random fields using graph cuts2005
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Exact optimization for markov random fields with convex priorsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2003
- Markov random fields with efficient approximations2002
- Interactive graph cuts for optimal boundary & region segmentation of objects in N-D images2002
- What Energy Functions Can Be Minimized via Graph Cuts?2002
- On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphsIEEE Transactions on Information Theory, 2001
- An efficient algorithm for finding the M most probable configurationsin probabilistic expert systemsStatistics and Computing, 1998
- Applications of a general propagation algorithm for probabilistic expert systemsStatistics and Computing, 1992