Paper Presentation

Given two shapes, $N$ samples are drawn from the edge elements of the shape. There are no specific constraints on these points - they can be either on the internal or the external contour of the object. Moreover, they also need not correspond to keypoints for the shape (such as maxima of curvature, inflection points, etc.), and although desired that the samples be uniform in spacing, this too is not a rigid criterion. ...

Introduction This paper presents a graph cut approach to the image segmentation task. Considering the image to be a directed graph with two nodes representing the source (object) and the sink (background), the authors propose a combinatorial optimization framework for image segmentation using $s/t$ graph cuts. This is the first global optimization object extraction technique that is extensible to beyond 2-D images. ...