Open AccessSuperpixel segmentation algorithm based on local network modularity increment
Author(s) -
Liu Tianli,
Dai Fang,
Guo Wenyan,
Zhao Fengqun,
Wang Junfeng,
Wang Xiaoxia
Publication year - 2022
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/ipr2.12448
Subject(s) - segmentation , segmentation based object categorization , scale space segmentation , image segmentation , computer science , artificial intelligence , pattern recognition (psychology) , cluster analysis , minimum spanning tree based segmentation , adjacency list , preprocessor , modularity (biology) , region growing , pixel , algorithm , computer vision , biology , genetics
Superpixel segmentation is a kind of image preprocessing technology and a popular research direction in image processing. The purpose of superpixel segmentation is to reduce the complexity of image processing. The most widely applied Simple Linear Iterative Clustering (SLIC) superpixel segmentation algorithm has high operating efficiency. However, under‐segmentation is prone to occur when the number of given superpixel regions is too small. In order to improve the segmentation accuracy, the superpixel segmentation algorithm based on local network modularity increment (LocalNet) from the perspective of network community detection is proposed here. The adjacency network is constructed according to the colour similarity of image pixels, the local community centre is found by the degree of network nodes, and the local network structure of the community is constructed. The modularity increment is employed as the boundary constraint to improve the segmentation accuracy of superpixel segmentation. Through the experimental comparison with the SLIC algorithm, its improved algorithm, and the algorithm proposed in recent years, the results show that our LocalNet algorithm significantly improves in segmentation accuracy Furthermore, the segmentation effect has obvious advantages under the premise that the segmentation speed is not much different from that of the other five algorithms.