Guanglei Gou

Guanglei Gou

Auto-generated profile, based on publicly available information

Guanglei Gou

College of Computer Science and Engineering, Chongqing University of Technology, Chongqing 400054, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 May 2018 in Symmetry
Verified
Journal Article
Open access
PDF file
JLJianwu Long
Jianwu Long
XFXin Feng
Xin Feng
XZXiaofei Zhu
Xiaofei Zhu
JZJianxun Zhang
Jianxun Zhang
GGGuanglei Gou
Guanglei Gou
Image segmentation is a challenging task in the field of image processing and computer vision. In order to obtain an accurate segmentation performance, user interaction is always used in practical image-segmentation applications. However, a good segmentation method should not rely on much prior information. In this paper, an efficient superpixel-guided interactive image-segmentation algorithm based on graph theory is proposed. In this algorithm, we first perform the initial segmentation by using the MeanShift algorithm, then a graph is built by taking the pre-segmented regions (superpixels) as nodes, and the maximum flow–minimum cut algorithm is applied to get the superpixel-level segmentation solution. In this process, each superpixel is represented by a color histogram, and the Bhattacharyya coefficient is chosen to calculate the similarity between any two adjacent superpixels. Considering the over-segmentation problem of the MeanShift algorithm, a narrow band is constructed along the contour of objects using a morphology operator. In order to further segment the pixels around edges accurately, a graph is created again for those pixels in the narrow band and, following the maximum flow–minimum cut algorithm, the final pixel-level segmentation is completed. Extensive experimental results show that the presented algorithm obtains much more accurate segmentation results with less user interaction and less running time than the widely used GraphCut algorithm, Lazy Snapping algorithm, GrabCut algorithm and a region merging algorithm based on maximum similarity (MSRM).

1 January 2017 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
GGGuanglei Gou
Guanglei Gou
GWGuoyin Wang
Guoyin Wang