Image Segmentation using Dual Distribution Matching
published: Oct. 9, 2012, recorded: September 2012, views: 192
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We propose an image segmentation method that divides an image into foreground and background regions when the approximate color distributions for these regions are given. Our approach was inspired by global consistency measures that directly evaluate the similarity between a given distribution and the distribution of the resulting segmentation, which were recently proposed in order to overcome the limitations of traditional pixelwise (local) consistency measures. The main feature of our proposal is that it uses two (foreground and background) input distributions, which increases the robustness compared to previous studies. To achieve this, we formulated a new mathematical model that describes the consistencies between the two input distributions and the segmentation, in which weighting parameters for the two distribution matching terms are set to be approximately proportional to the size of the foreground and background areas. We call this dual distribution matching (DDM). We also derived an optimization method that uses graph cuts. Experimental results that show the effectiveness of our method and comparisons between local and global consistency measures are presented.
Download slides: bmvc2012_taniai_distribution_matching_01.pdf (3.1 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !