Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Smooth minimization of non-smooth functions
Mathematical Programming: Series A and B
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Object Detection with Discriminatively Trained Part-Based Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image segmentation with patch-pair density priors
Proceedings of the international conference on Multimedia
What, where and how many? combining object detectors and CRFs
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part IV
Active mask hierarchies for object detection
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Graph cut based inference with co-occurrence statistics
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Recovering human body configurations: combining segmentation and recognition
CVPR'04 Proceedings of the 2004 IEEE computer society 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
Ensemble of exemplar-SVMs for object detection and beyond
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Probabilistic Joint Image Segmentation and Labeling by Figure-Ground Composition
International Journal of Computer Vision
Hi-index | 0.00 |
Motivated by the rising performances of object detection algorithms, we investigate how to further precisely segment out objects within the output bounding boxes. The task is formulated as a unified optimization problem, pursuing a unique latent object mask in non-parametric manner. For a given test image, the objects are first detected by detectors. Then for each detected bounding box, the objects of the same category along with their object masks are extracted from the training set. The latent mask of the object within the bounding box is inferred based on three objectives: 1) the latent mask should be coherent, subject to sparse errors caused by within-category diversities, with the global bounding-box-level mask inferred by sparse representation over the bounding boxes of the same category within the training set; 2) the latent mask should be coherent with local patch-level mask inferred by sparse representation of the individual patch over all spatially nearby (handling local deformations) patches of the same category in the training set; and 3) mask property within each sufficiently small super-pixel should be consistent. All these three objectives are integrated into a unified optimization problem, and finally the sparse representation coefficients and the latent mask are alternately optimized based on Lasso optimization and smooth approximation followed by Accelerated Proximal Gradient method, respectively. Extensive experiments on the Pascal VOC object segmentation datasets, VOC2007 and VOC2010, show that our proposed algorithm achieves competitive results with the state-of-the-art learning based algorithms, and is superior over other detection based object segmentation algorithms.