Measuring uncertainty in graph cut solutions
Authors:
- 1 October 2008
- journal article
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 112 (1) , 30-38
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optical flow estimation with uncertainties through dynamic MRFs2008
- Dynamic Graph Cuts for Efficient Inference in Markov Random FieldsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2007
- Measuring Uncertainty in Graph Cut Solutions – Efficiently Computing Min-marginal Energies 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
- Pseudo-Boolean optimizationDiscrete Applied Mathematics, 2002
- Applications of a general propagation algorithm for probabilistic expert systemsStatistics and Computing, 1992
- Dynamic algorithms in computational geometryProceedings of the IEEE, 1992
- Efficiency of pseudolikelihood estimation for simple Gaussian fieldsBiometrika, 1977