Multi-label image segmentation via max-sum solver

We formulate single-image multi-label segmentation into regions coherent in texture and color as a MAX-SUM problem for which efficient linear programming based solvers have recently appeared. By handling more than two labels, we go beyond widespread binary segmentation methods, e.g., MIN-CUT or normalized cut based approaches. We show that the MAX-SUM solver is a very powerful tool for obtaining the MAP estimate of a Markov random field (MRF). We build the MRF on superpixels to speed up the segmentation while preserving color and texture. We propose new quality functions for setting the MRF, exploiting priors from small representative image seeds, provided either manually or automatically. We show that the proposed automatic segmentation method outperforms previous techniques in terms of the Global Consistency Error evaluated on the Berkeley segmentation database.

• Type: Conference
• Year: 2007
• Where: CVPR
• Authors: Branislav Micusík, Tomás Pajdla
• Keywords: Automatic Segmentation Method, Berkeley Segmentation Database, Computer Vision, CVPR 2007, Global Consistency Error, Single-image Multi-label Segmentation, Widespread Binary Segmentation