Proceedings of the 27th annual conference on Computer graphics and interactive techniques
ACM Transactions on Mathematical Software (TOMS)
Image quilting for texture synthesis and transfer
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Filtering, Segmentation, and Depth
Filtering, Segmentation, and Depth
Segmentation with Depth but Without Detecting Junctions
Journal of Mathematical Imaging and Vision
Modeling Visual Patterns by Integrating Descriptive and Generative Methods
International Journal of Computer Vision
Euler Spiral for Shape Completion
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Visual Organization for Figure/Ground Separation
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
Graph Partition by Swendsen-Wang Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
MosaicShape: Stochastic Region Grouping with Shape Prior
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Generalizing Swendsen-Wang to Sampling Arbitrary Posterior Probabilities
IEEE Transactions on Pattern Analysis and Machine Intelligence
Filling-in by joint interpolation of vector fields and gray levels
IEEE Transactions on Image Processing
A stochastic grammar of images
Foundations and Trends® in Computer Graphics and Vision
Semantic video search using natural language queries
MM '09 Proceedings of the 17th ACM international conference on Multimedia
International Journal of Computer Vision
Hi-index | 0.00 |
This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important problem in low-middle level vision with a synthesis of two goals: segmentation and 2.5D sketch, in other words, it is to consider 2D segmentation by incorporating occulision/ depth explicitly to get the partial order of final segmented regions and contour completion in the same layer. The inference is based on Swendsen-Wang Cut (SWC) algorithm [4] where there are two types of nodes, instead of all nodes being the same type in traditional MRF model, in the graph representation: atomic regions and their open bonds desribed by address variables. These makes the problem a mixed random field. Therefore, two kinds of energies should be simultaneously minimized by maximizing a joint posterior probability: one is for region coloring/layering, the other is for the assignments of address variables. Given an image, its primal sketch is computed firstly, then some atomic regions can be obtained by completing some sketches into a closed contour. At the same time, T-junctions are detected and broken into terminators as the open bonds of atomic regions after being assigned the ownership between them and atomic regions. With this graph representation, the presented inference algorithm is performed and satisfactory results are shown in the experiments.