FLIC: Fast Linear Iterative Clustering with Active Search

 Jiaxing Zhao1 Bo Ren1 Qibin Hou1 Ming-Ming Cheng1  Paul Rosin2

1CCCE, Nankai University      2Cardiff University


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 number of iterations required for convergence and also improves the 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 481 × 321 image on a single CPU core). To facilitate the development of over-segmentation, the code will be publicly available.


  • FLIC: Fast Linear Iterative Clustering with Active Search, Jiaxing Zhao, Bo Ren, Qibin Hou, Ming-Ming Cheng, Paul Rosin, AAAI, 2018. [pdf]  [Project Page] [bib] [source code]

Source Code

You can find our code here. We have uploaded the caffe and CRF packages we used in our paper.

If you find our work is helpful, please cite

 title={FLIC: Fast Linear Iterative Clustering with Active Search},
 author={Zhao, Jia-Xin and Bo, Ren and Hou, Qibin and Cheng, Ming-Ming},


zhaojiaxing AT mail.nankai.edu.cn

(Visited 253 times, 8 visits today)
Notify of