What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
Pictorial Structures for Object Recognition
International Journal of Computer Vision
Large Margin Methods for Structured and Interdependent Output Variables
The Journal of Machine Learning Research
Design and Performance of a Fault-Tolerant Real-Time CORBA Event Service
ECRTS '06 Proceedings of the 18th Euromicro Conference on Real-Time Systems
Multi-Class Segmentation with Relative Location Prior
International Journal of Computer Vision
Object Recognition by Integrating Multiple Image Segmentations
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part III
International Journal of Computer Vision
Object Detection with Discriminatively Trained Part-Based Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
What, where and how many? combining object detectors and CRFs
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Graph cut based inference with co-occurrence statistics
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
Object segmentation by alignment of poselet activations to image contours
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
CPMC: Automatic Object Segmentation Using Constrained Parametric Min-Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Several formulations based on Random Fields (RFs) have been proposed for joint categorization and segmentation (JCaS) of objects in images. The RF's sites correspond to pixels or superpixels of an image and one defines potential functions (typically over local neighborhoods) which define costs for the different possible assignments of labels to several different sites. Since the segmentation is unknown a priori, one cannot define potential functions over arbitrarily large neighborhoods as that may cross object boundaries. Categorization algorithms extract a set of interest points from the entire image and solve the categorization problem by optimizing cost functions that depend on the feature descriptors extracted from these interest points. There is some disconnect between segmentation algorithms which consider local neighborhoods and categorization algorithms which consider non-local neighborhoods. In this work, we propose to bridge this gap by introducing a novel formulation which uses models of objects with deformable parts, classically used for object categorization, to solve the JCaS problem. We use these models to introduce two new classes of potential functions for JCaS; (a) the first class of potential functions encodes the model score for detecting an object as a function of its visible parts only, and (b) the second class of potential functions encodes shape priors for each visible part and is used to bias the segmentation of the pixels in the support region of the part, towards the foreground object label. We show that most existing deformable parts formulations can be used to define these potential functions and that the resulting potential functions can be optimized exactly using min-cut. As a result, these new potential functions can be integrated with most existing RF-based formulations for JCaS.