Regularization of inverse visual problems involving discontinuities
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Analysis Using Multigrid Relaxation Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
Visual reconstruction
One-Dimensional Regularization with Discontinuities
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparison of the Efficiency of Deterministic and Stochastic Algorithms for Visual Reconstruction
IEEE Transactions on Pattern Analysis and Machine Intelligence
The theory and practice of Bayesian image labeling
International Journal of Computer Vision
Bayesian modeling of uncertainty in low-level vision
International Journal of Computer Vision
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Energy Minimization with Discontinuities
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Segmentation by Grouping Junctions
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
A New Algorithm for Energy Minimization with Discontinuities
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
A Discrete/Continuous Minimization Method in Interferometric Image Processing
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Some links between extremum spanning forests, watersheds and min-cuts
Image and Vision Computing
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Surfaces with occlusions from layered stereo
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Accurate banded graph cut segmentation of thin structures using laplacian pyramids
MICCAI'06 Proceedings of the 9th international conference on Medical Image Computing and Computer-Assisted Intervention - Volume Part II
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
| Hi-index | 0.00 |
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. These tasks can be formulated as energy minimization problems. In this paper, we consider a natural class of energy functions that permits discontinuities. Computingthe exact minimum is NP-hard. We have developed a new approximation algorithm based on graph cuts. The solution it generates is guaranteed to be within a factor of 2 of the energy function's global minimum. Our method produces a local minimum with respect to a certain move space. In this move space, a single move is allowed to switch an arbitrary subset of pixels to one common label. If this common label is a then such a move expands the domain of a in the image. At each iteration our algorithm efficiently chooses the expansion move that gives the largest decrease in the energy. We apply our method to the stereo matching problem, and obtain promisingex perimental results. Empirically, the new technique outperforms our previous algorithm [6] both in terms of runningti me and output quality.