Image segmentation has many applications which range from machine learning to medical diagnosis. In this study, the authors propose a framework for the segmentation of images based on super‐pixels and algorithms for community identification in graphs. The super‐pixel pre‐segmentation step reduces the number of nodes in the graph, rendering the method the ability to process large images. Moreover, community detection algorithms provide more accurate segmentation than traditional approaches based on spectral graph partition. The authors also compared their method with two algorithms: (i) the graph‐based approach by Felzenszwalb and Huttenlocher and (ii) the contour‐based method by Arbelaez. Results have shown that their method provides more precise segmentation and is faster than both of them.
Image segmentation is still a challenging issue in pattern recognition. Among the various segmentation approaches are those based on graph partitioning, which present some drawbacks, one being high processing times. With the recent developments on complex networks theory, pattern recognition techniques based on graphs have improved considerably. The identification of cluster of vertices can be considered a process of community identification according to complex networks theory. Since data clustering is related with image segmentation, image segmentation can also be approached via complex networks. However, image segmentation based on complex networks poses a fundamental limitation which is the excessive numbers of nodes in the network. This paper presents a complex network approach for large image segmentation that is both accurate and fast. To that, we incorporate the concept of super pixels, to reduce the number of nodes in the network. We evaluate our method for both synthetic and real images. Results show that our method can outperform other graph-based methods both in accuracy and processing times.
This article introduces an automatic approach for the segmentation of coloured natural scene images based on graphs and the propagation of labels originally designed for communities detection in complex networks. Images are initially pre‐segmented with super‐pixels, followed by feature extraction using colour information of each super‐pixels. The resulting graph consists of vertices which represent super‐pixels, whereas the edge weights are a measure of similarity between super‐pixels. The resulting segmentation corresponds to the propagation of labels among the vertices. In this article, three strategies for propagating labels have been formulated: (i) iterative propagation (ILP), (ii) recursive propagation (RLP) and (iii) a weighted recursive propagation (WRLP). The experiments have shown that the proposed methods, when compared to other state‐of‐the‐art methods, produce better results in terms of segmentation quality and processing time.
27 August 2019 in IEEE Transactions on Image Processing
We introduce an interactive method for retina layer segmentation in gray-level and RGB images based on super-pixels, multi-level optimization of modularity, and boundary erosion. Our method produces highly accurate segmentation results and can segment very large images. We have evaluated our method with two datasets of 2D confocal microscopy (CM) images of a mammalian retina. We have obtained average Jaccard index values of 0.948 and 0.942 respectively, confirming the high-quality segmentation performance of our method relative to a known ground truth segmentation. Average processing time was two seconds.