High precision image segmentation algorithm using SLIC and neighborhood rough set
A high precision image segmentation algorithm using SLIC and neighborhood rough set is proposed. The algorithm mainly includes two stages: the stage of superpixel generation and the mergence stage based on neighborhood rough set. In superpixel generation stage, based on L-channel color histogram and its peak, the scheme of initial superpixel number generation is proposed according to the complexity of the image itself. For inaccuracy segmentation edge of SLIC caused by isolated pixels, the compactness factor is appropriately increased before they are generated. After that, the scheme of reclassifying each isolated pixel is proposed just relying on the color space. In superpixel mergence stage based on neighborhood rough set, the texture information using the gray level co-occurrence matrix is introduced into the feature representation of superpixel. It can reduce the dependence of color feature and improve the accuracy of the mergence. By constructing the information table, the neighborhood granule of each superpixel is acquired under the neighborhood threshold. Finally, the superpixels within the neighborhood granule are merged on the basis of the spatial adjacency between superpixels. In Berkeley segmentation data set, compared with the SLIC algorithm, the schemes of initial superpixel number generation and the isolated pixels processing are proved to be effective. Furthermore, the experiments demonstrate that the proposed algorithm can produce high-quality and high-precision image segmentation results in comparison with the SLIC-based image segmentation algorithms on three standard metrics.
KeywordsImage segmentation SLIC Neighborhood rough set Superpixel Neighborhood granule
This work was supported by the National Natural Science Foundation of China (61503271) and the Shanxi Scholarship Council of China (2016–044).
- 1.Achanta R, Süsstrunk S (2017) Superpixels and polygons using simple non-iterative clustering. Proc IEEE Conf Comput Vis Pattern Recognit: 4895–4904Google Scholar
- 4.Ates H F, Sunetci S, Ak K E (2016) Kernel likelihood estimation for superpixel image parsing. Proc Int Conf Image Anal Recogn: 234–242Google Scholar
- 6.Bergh M V, Boix X, Roig G, Capitani B D (2012) Seeds: Superpixels extracted via energy-driven sampling. Proc IEEE Conf Eur Conf Comput Vision: 13–26Google Scholar
- 10.Hsu C Y, Ding J J (2013) Efficient image segmentation algorithm using SLIC superpixels and boundary-focused region merging. Proceedings of the IEEE 9th international conference on information, communications and Signal Process: 1–5Google Scholar
- 13.Li Z, Chen J (2015) Superpixel segmentation using linear spectral clustering. Proc IEEE Conf Comput Vis Pattern Recognit: 1356–1363Google Scholar
- 15.Liu M Y, Tuzel O, Ramalingam S, Chellappa R (2011) Entropy rate superpixel segmentation. Proc IEEE Conf Comput Vis Pattern Recognit: 2097–2104Google Scholar
- 19.Lucchi A, Li Y, Smith K, Fua P (2012) Structured image segmentation using kernelized features. Proc IEEE Conf Eur Conf Comput Vision: 400–413Google Scholar
- 21.Rantalankila P, Kannala J, Rahtu E (2014) Generating object segmentation proposals using global and local search. Proc IEEE Conf Comput Vis Pattern Recognit:2417–2424Google Scholar
- 22.Ren X, Malik J (2003) Learning a classification model for segmentation. Proc IEEE Int Conf Comput Vision: 10–17Google Scholar
- 26.Tighe J, Lazebnik S (2010) Superparsing: scalable nonparametric image parsing with superpixels. Proc IEEE Conf Eur Conf Comput Vision: 352–365Google Scholar
- 27.Wang S, Lu H, Yang F, Yang M H (2011) Superpixel tracking. Proc IEEE Conf Int Conf Comput Vision: 1323–1330Google Scholar
- 32.Zhang Y, Li X, Gao X et al (2017) A simple algorithm of superpixel segmentation with boundary constraint. IEEE transactions on circuits and systems for video. Technology 27(7):1502–1514Google Scholar