Piecing Together the Segmentation Jigsaw using Context

We present an approach to jointly solve the segmentation and recognition problem using a multiple segmentation framework. We formulate the problem as segment selection from a pool of segments, assigning each selected segment a class label. Previous multiple segmentation approaches used local appearance matching to select segments in a greedy manner. In contrast, our approach formulates a cost function based on contextual information in conjunction with appearance matching. This relaxed cost function formulation is minimized using an efficient quadratic programming solver and an approximate solution is obtained by discretizing the relaxed solution. Our approach improves labeling performance compared to other segmentation based recognition approaches.

• Type: Journal
• Year: 2011
• Where: CVPR
• Authors: Xi Chen, Arpit Jain, Abhinav Gupta, Larry Davis
• Keywords: Computer Vision, Cost Function, CVPR 2011, Multiple Segmentation, Multiple Segmentation Framework