SQL: Superpixels via quaternary labeling

作者：

Highlights：

• This paper proposes SQL algorithm to generate superpixel lattice. The number of labels is reduced from the number of superpixels to 4, and this small number assures efficient labeling.

• Extensive experiments demonstrate that SQL outperforms the other superpixel lattice methods and is competitive with state-of-the-art methods without lattice guarantee.

• SQL facilitates either MRFs or CNN to be build upon superpixels in the subsequent image analysis tasks.

摘要

•This paper proposes SQL algorithm to generate superpixel lattice. The number of labels is reduced from the number of superpixels to 4, and this small number assures efficient labeling.•Extensive experiments demonstrate that SQL outperforms the other superpixel lattice methods and is competitive with state-of-the-art methods without lattice guarantee.•SQL facilitates either MRFs or CNN to be build upon superpixels in the subsequent image analysis tasks.

论文关键词：Superpixels,Segmentation,Seaming,Pixel labeling,Graph cuts

论文评审过程：Received 20 April 2017, Revised 28 April 2018, Accepted 19 March 2019, Available online 19 March 2019, Version of Record 23 March 2019.

论文官网地址：https://doi.org/10.1016/j.patcog.2019.03.012