Efficient Pixel-Grouping based on Dempster's Theory of Evidence for Image Segmentation
Asian Conference of Computer Vision (ACCV)
Abstract
In this paper we propose an algorithm for image segmentation using graph cuts which can be used to efficiently solve labeling problems on high resolution images or image sequences. The basic idea of our method is to group large homogeneous regions to one single variable. Therefore we combine the appearance and the task specific similarity with Dempster's theory of evidence to compute the basic belief that two pixels/groups will have the same label in the minimum energy state. Experiments on image and video segmentation show that our grouping leads to a significant speedup and memory reduction of the labeling problem. Thus large-scale labeling problems can be solved in an efficient manner with a low approximation loss.
