An Optimized Image Segmentation Approach Based on Boltzmann Machine

ABSTRACT Image segmentation with complex background is a tedious task. In our study, a convex spline is constructed based on Good Features to Track (GF2T) method’s region-based salient feature (i.e., corner) set. For an optimized edge-based segmentation, an ellipse shape prior based on this convex spline is useful in edge regularization procedure with region-based features. This kind of optimization is achieved by Boltzmann machine (BM) to automatically form an elliptical foreground mask of the GrabCut method. We demonstrated our approach’s usability through traveling salesman problem (TSP), thus, we consider that the TSP’s valid tour’s path solved by BM can be taken as an optimized convex spline for edge-based segmentation. In our experiments, proposed BM-based approach has the performance improvement of segmentation to stand-alone GF2T as 29.79% improvement based on bounding boxes evaluation and as 38.67% improvement based on the overlapping pixel regions for a quantitative evaluation via objective metrics.

[1]  Pedro F. Felzenszwalb Learning models for object recognition , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[2]  Katja Markert,et al.  Learning Models for Object Recognition from Natural Language Descriptions , 2009, BMVC.

[3]  Muhammad Iqbal Hasan Chowdhury,et al.  An optimized image segmentation algorithm , 2013, 2013 International Conference on Informatics, Electronics and Vision (ICIEV).

[4]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[5]  Carlo Tomasi,et al.  Good features to track , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Zhuowen Tu,et al.  MILCut: A Sweeping Line Multiple Instance Learning Paradigm for Interactive Image Segmentation , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[7]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[8]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Andrew Blake,et al.  Geodesic star convexity for interactive image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[10]  Pramod K. Varshney,et al.  On performance limits of image segmentation algorithms , 2015, Comput. Vis. Image Underst..

[11]  Gregory G. Slabaugh,et al.  Graph cuts segmentation using an elliptical shape prior , 2005, IEEE International Conference on Image Processing 2005.

[12]  Serdar Korukoglu,et al.  A simulated annealing-based optimal threshold determining method in edge-based segmentation of grayscale images , 2011, Appl. Soft Comput..

[13]  Robert Laganiere,et al.  OpenCV 2 Computer Vision Application Programming Cookbook , 2011 .

[14]  Bahadir Karasulu,et al.  An approach based on simulated annealing to optimize the performance of extraction of the flower region using mean-shift segmentation , 2013, Appl. Soft Comput..

[15]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[16]  Olga Veksler,et al.  Star Shape Prior for Graph-Cut Image Segmentation , 2008, ECCV.

[17]  B. B. Tesar,et al.  A Boltzmann machine solution of the traveling salesperson problem: a study for parallel implementation , 1989, Fourth IEEE Region 10 International Conference TENCON.