부산대학교 도서관

Superpixel algorithms group visually coherent pixels and form an alternative representation of the regular structure of the pixel grid. This fundamental low-level computer vision preprocessing step greatly reduces the complexity of subsequent image processing tasks. However, most of the existing methods suffer from very high calculation costs which makes them quite unsuitable for time-sensitive applications. In this paper, we propose a new superpixel segmentation method, named IBIS for Iterative Boundaries implicit Identification for superpixels segmentation, that implicitly identifies the boundaries between superpixels and performs the segmentation using only a fraction of the pixels of the input image, thereby reducing the complexity and computation time. The results obtained during the experiments show that the segmentation quality of IBIS is comparable to that of state of the art methods with a computation time divided by a factor of 8 without parallelization of the processing for low resolution images (e.g., $320\times 240$ pixels) as usually provided in public data sets. We also present and comprehensively evaluate the GPU variant of IBIS named IBIScuda that allows an optimal exploitation of the available resources considering the limited bandwidth between CPU and GPU memories.