We propose a new superpixel algorithm based on exploiting the boundary information of an image, as objects in images can generally be described by their boundaries. Our proposed approach initially estimates the boundaries and uses them to place superpixel seeds in the areas in which they are more dense. Afterwards, we minimize an energy function in order to expand the seeds into full superpixels. In addition to standard terms such as color consistency and compactness, we propose using the geodesic distance which concentrates small superpixels in regions of the image with more information, while letting larger superpixels cover more homogeneous regions. By both improving the initialization using the boundaries and coherency of the superpixels with geodesic distances, we are able to maintain the coherency of the image structure with fewer superpixels than other approaches. We show the resulting algorithm to yield smaller Variation of Information metrics in seven different datasets while maintaining Undersegmentation Error values similar to the state-of-the-art methods.


pattern clustering.

Author keywords

superpixels, segmentation, geodesic, boundaries

Scientific reference

A. Rubio, L. Yu, E. Simo-Serra and F. Moreno-Noguer. BASS: Boundary-aware superpixel segmentation, 23rd International Conference on Pattern Recognition, 2016, Cancún, Mexico, pp. 2824-2829.