Regularization of inverse visual problems involving discontinuities
IEEE Transactions on Pattern Analysis and Machine Intelligence
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Markov random field modeling in computer vision
Markov random field modeling in computer vision
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
Stereo Matching Using Belief Propagation
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part II
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Global optimization using embedded graphs
Global optimization using embedded graphs
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on 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
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
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
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hi-index | 0.01 |
This paper formulates pixel labelling as a series of two-category classification. Unlike existing techniques, which assign a determinate label to each pixel, we assign a label set to each pixel and shrink the label set step by step. Determinate labelling is achieved within log"2n (n is size of label set) steps. In each step, we bisect the label set into two subsets and discard the one with higher cost of assigning it to the pixel. Simultaneous labelling of an image is carried out by minimizing an energy function that can be minimized via graph cut algorithm. Based on the bisection approach, we propose a bitwise algorithm for pixel labelling, which set one bit of each pixel's label in each step. We apply the proposed algorithm to stereo matching and image restoration. Experimental results demonstrate that both good performance and high efficiency are achieved.