Weak boundary preserved superpixel segmentation based on directed graph clustering

作者：

Highlights：

•

• We analysis the relationship between image boundary extraction and pixel K-NN-graph.

• A superpixel segmentation methods via directed graph clustering is proposed.

• We construct the problem of stitching trivial regions by an integer programming-based region merging.

摘要

•We analysis the relationship between image boundary extraction and pixel K-NN-graph.•A superpixel segmentation methods via directed graph clustering is proposed.•We construct the problem of stitching trivial regions by an integer programming-based region merging.

论文关键词：Superpixel segmentation,Directed graph clustering,K-NN graph,Integer programming

论文评审过程：Received 6 September 2017, Revised 9 April 2018, Accepted 9 April 2018, Available online 22 April 2018, Version of Record 25 April 2018.

论文官网地址：https://doi.org/10.1016/j.image.2018.04.008