Markov random field modeling in computer vision
Markov random field modeling in computer vision
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image Segmentation by Data-Driven Markov Chain Monte Carlo
IEEE Transactions on Pattern Analysis and Machine Intelligence
Contour and Texture Analysis for Image Segmentation
International Journal of Computer Vision
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Graph-Based Image Segmentation
International Journal of Computer Vision
Spectral Segmentation with Multiscale Graph Decomposition
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Isoperimetric Graph Partitioning for Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Self-Validated and Spatially Coherent Clustering with Net-Structured MRF and Graph Cuts
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 04
Audio-visual human recognition using semi-supervised spectral learning and hidden Markov models
Journal of Visual Languages and Computing
Region-Level Image Authentication Using Bayesian Structural Content Abstraction
IEEE Transactions on Image Processing
Hi-index | 0.00 |
We propose a general framework to encode various grouping cues for natural image segmentation. We extend the classical Gibbs energy of an MRF to three terms: likelihood energy, coherence energy and separating energy. We encode generative cues in the likelihood and coherence energy to ensure the goodness and feasibility of segmentation, and embed discriminative cues in the separating energy to encourage assigning two pixels with strong separability with different labels. We use a self-validated process to iteratively minimize the global Gibbs energy. Our approach is able to automatically determine the number of segments, and produce a natural hierarchy of coarse-to-fine segmentation. Experiments show that our approach works well for various segmentation problems, and outperforms existing methods in terms of robustness to noise and preservation of soft edges.