A Superpixel Boundary Optimization (SBO) Framework Based on Information Measure Function

Abstract

Superpixel is an essential tool for computer vision. In practice, classic superpixel algorithms do not exhibit good boundary adherence with fewer superpixels, which will greatly hamper further analysis. To remedy the defect, a superpixel boundary optimization framework is proposed in this paper. There are three steps in the framework. Firstly, based on the proposed information measure function, the under-segmented superpixels generated by classic superpixel algorithms are screened out. Secondly, with the two invariant centroids method, these under-segmented superpixels are re-segmented to improve the accuracy in boundary adherence. Finally, smaller superpixels are merged to maintain the same number with initial superpixels. Quantitative evaluations on the BSDS500 exhibit that the performance of the classic superpixel algorithms is improved by employing the framework, especially on the condition of fewer superpixels.

Keywords

• Superpixel
• boundary optimization
• framework
• information measure function
• weighted directed graph