This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ensemble Segmentation Using Efficient Integer Linear Programming
Oct. 2012 (vol. 34 no. 10)
pp. 1966-1977
Amir Alush, Bar-Ilan University, Ramt-Gan
Jacob Goldberger, Bar-Ilan University , Ramt-Gan
We present a method for combining several segmentations of an image into a single one that in some sense is the average segmentation in order to achieve a more reliable and accurate segmentation result. The goal is to find a point in the “space of segmentations” which is close to all the individual segmentations. We present an algorithm for segmentation averaging. The image is first oversegmented into superpixels. Next, each segmentation is projected onto the superpixel map. An instance of the EM algorithm combined with integer linear programming is applied on the set of binary merging decisions of neighboring superpixels to obtain the average segmentation. Apart from segmentation averaging, the algorithm also reports the reliability of each segmentation. The performance of the proposed algorithm is demonstrated on manually annotated images from the Berkeley segmentation data set and on the results of automatic segmentation algorithms.
Index Terms:
Image segmentation,Clustering algorithms,Reliability,Correlation,Human factors,Optimization,Approximation algorithms,EM algorithm.,Image segmentation,ensemble segmentation,integer linear programming,correlation clustering
Citation:
Amir Alush, Jacob Goldberger, "Ensemble Segmentation Using Efficient Integer Linear Programming," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 10, pp. 1966-1977, Oct. 2012, doi:10.1109/TPAMI.2011.280
Usage of this product signifies your acceptance of the Terms of Use.