loading...
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
New York, NY June 17-June 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2006.912006 IEEE Computer Society Conference ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Carsten Rother, Microsoft Research Cambridge, UK
Tom Minka, Microsoft Research Cambridge, UK
Andrew Blake, Microsoft Research Cambridge, UK
Vladimir Kolmogorov, University College London
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inference in the model leads to minimizing an energy with an MRF term encoding spatial coherency and a global constraint which attempts to match the appearance histograms of the common parts. This energy has not been proposed previously and its optimization is challenging and NP-hard. For this problem a novel optimization scheme which we call trust region graph cuts is presented. We demonstrate that this framework has the potential to improve a wide range of research: Object driven image retrieval, video tracking and segmentation, and interactive image editing. The power of the framework lies in its generality, the common part can be a rigid/non-rigid object (or scene), observed from different viewpoints or even similar objects of the same class.
Citation:
Carsten Rother, Tom Minka, Andrew Blake, Vladimir Kolmogorov, "Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs," cvpr, vol. 1, pp.993-1000, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (CVPR'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.