FLIC: Fast linear iterative clustering with active search

• DOI: 10.1007/s41095-018-0123-y
• Publication Date: 2018-10-27T03:58:38Z
• Authors: Jiaxing Zhao; Ren Bo; Qibin Hou; Ming-Ming Cheng; Paul Rosin
• Keywords: neighbor continuity; back-and-forth traversal; FOS: Computer and information sciences; SLIC; Electronic computers. Computer science; Computer Vision and Pattern Recognition (cs.CV); Computer Science - Computer Vision and Pattern Recognition; QA75.5-76.95; image over-segmentation

In this paper, we reconsider the clustering problem for image over-segmentation from a new perspective. We propose a novel search algorithm named “active search” which explicitly considers neighboring continuity. Based on this search method, we design a back-and-forth traversal strategy and a "joint" assignment and update step to speed up the algorithm. Compared to earlier works, such as Simple Linear Iterative Clustering (SLIC) and its follow-ups, who use fixed search regions and perform the assignment and the update step separately, our novel scheme reduces the iteration number before convergence, as well as improves boundary sensitivity of the over-segmentation results. Extensive evaluations on the Berkeley segmentation benchmark verify that our method outperforms competing methods under various evaluation metrics. In particular, lowest time cost is reported among existing methods (approximately 30 fps for a 481321 image on a single CPU core). To facilitate the development of over-segmentation, the code will be publicly available.