Computational geometry in C
Occlusions and binocular stereo
International Journal of Computer Vision
A maximum likelihood stereo algorithm
Computer Vision and Image Understanding
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Experimental study of minimum cut algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Photorealistic Scene Reconstruction by Voxel Coloring
International Journal of Computer Vision
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Algorithms
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Depth from edge and intensity based stereo
Depth from edge and intensity based stereo
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Simple silhouettes for complex surfaces
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Robust acquisition of 3D informations from short image sequences
Graphical Models - Special issue on Pacific graphics 2002
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Surface Reconstruction Method Using Global Graph Cut Optimization
International Journal of Computer Vision
Accurate and Scalable Surface Representation and Reconstruction from Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Oriented visibility for multiview reconstruction
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
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
SCoBeP: Dense image registration using sparse coding and belief propagation
Journal of Visual Communication and Image Representation
| Hi-index | 0.00 |
Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brought to bear on stereo global minimization problems. This problem can then be reduced to a single min-cut problem. We use this approach to solve a new global minimization problem that naturally arises when solving for three-camera (trinocular) stereo. Our formulation treats the three cameras symmetrically, while imposing a natural occlusion cost and uniqueness constraint.