IEEE International Conference on Computer Vision and Pattern Recognition, 2010
CPMC: Constrained Parametric Min-Cuts for Automatic Object Segmentation
Joao Carreira and Cristian Sminchisescu
This is the implementation of CPMC used in our VOC2010 segmentation challenge submissions. It is an extention of the algorithm used in our VOC2009 submission, which is described in Constrained Parametric Min-Cuts for Automatic Object Segmentation, CVPR 2010 . Changes over  are in reducing computation time and the usage of subframes to better segment small objects. The learning code is not yet provided, but the package includes two pretrained ranking models.
The system has been tested on MATLAB 7.9 and 7.10 on Linux 32bits and 64bits machines with 10 Gb of memory.
For details see the README file in the package below.