Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
International Journal of Computer Vision - Special issue on statistical and computational theories of vision: modeling, learning, sampling and computing, Part I
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Multi-camera Scene Reconstruction via Graph Cuts
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Stereo Matching Using Belief Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Efficient graph-based energy minimization methods in computer vision
Efficient graph-based energy minimization methods in computer vision
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Symmetric Stereo Matching for Occlusion Handling
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
High-accuracy stereo depth maps using structured light
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
A comparative study of energy minimization methods for markov random fields
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
MAP estimation via agreement on trees: message-passing and linear programming
IEEE Transactions on Information Theory
Exact optimization for Markov random fields with convex priors
IEEE Transactions on Pattern Analysis and Machine Intelligence
Surfaces with occlusions from layered stereo
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Linear Programming Approach to Max-Sum Problem: A Review
IEEE Transactions on Pattern Analysis and Machine Intelligence
MAP-Inference for Highly-Connected Graphs with DC-Programming
Proceedings of the 30th DAGM symposium on Pattern Recognition
Multi-label Moves for MRFs with Truncated Convex Priors
EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Coarse-to-fine stereo vision with accurate 3D boundaries
Image and Vision Computing
A Study of Parts-Based Object Class Detection Using Complete Graphs
International Journal of Computer Vision
Temporal priors for novel video synthesis
ACCV'07 Proceedings of the 8th Asian conference on Computer vision - Volume Part II
Interested sample point pre-selection based dense terrain reconstruction for autonomous navigation
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
DAS '10 Proceedings of the 9th IAPR International Workshop on Document Analysis Systems
Graph cut based inference with co-occurrence statistics
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Proceedings of the 32nd DAGM conference on Pattern recognition
A fast solver for truncated-convex priors: quantized-convex split moves
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
A comparative study of energy minimization methods for markov random fields
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Multi-label Moves for MRFs with Truncated Convex Priors
International Journal of Computer Vision
Inference Methods for CRFs with Co-occurrence Statistics
International Journal of Computer Vision
A robust cost function for stereo matching of road scenes
Pattern Recognition Letters
Hi-index | 0.00 |
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-reweighted message passing (TRW). So far, the standard benchmark for their comparison has been a 4-connected grid-graph arising in pixel-labelling stereo. This minimization problem, however, has been largely solved: recent work shows that for many scenes TRW finds the global optimum. Furthermore, it is known that a 4-connected grid-graph is a poor stereo model since it does not take occlusions into account. We propose the problem of stereo with occlusions as a new test bed for minimization algorithms. This is a more challenging graph since it has much larger connectivity, and it also serves as a better stereo model. An attractive feature of this problem is that increased connectivity does not result in increased complexity of message passing algorithms. Indeed, one contribution of this paper is to show that sophisticated implementations of BP and TRW have the same time and memory complexity as that of 4-connected grid-graph stereo. The main conclusion of our experimental study is that for our problem graph cut outperforms both TRW and BP considerably. TRW achieves consistently a lower energy than BP. However, as connectivity increases the speed of convergence of TRW becomes slower. Unlike 4-connected grids, the difference between the energy of the best optimization method and the lower bound of TRW appears significant. This shows the hardness of the problem and motivates future research.