Please use this identifier to cite or link to this item:
|Type:||Artigo de evento|
|Title:||A Linear-time Approach For Image Segmentation Using Graph-cut Measures|
|Abstract:||Image segmentation using graph cuts have become very popular in the last years. These methods are computationally expensive, even with hard constraints (seed pixels). We present a solution that runs in time proportional to the number of pixels. Our method computes an ordered region growing from a set of seeds inside the object, where the propagation order of each pixel is proportional to the cost of an optimum path in the image graph from the seed set to that pixel. Each pixel defines a region which includes it and all pixels with lower propagation order. The boundary of each region is a possible cut boundary, whose cut measure is also computed and assigned to the corresponding pixel on-the-fly. The object is obtained by selecting the pixel with minimum-cut measure and all pixels within its respective cut boundary. Approaches for graph-cut segmentation usually assume that the desired cut is a global minimum. We show that this can be only verified within a reduced search space under certain hard constraints. We present and evaluate our method with three cut measures: normalized cut, mean cut and an energy function. © Springer-Verlag Berlin Heidelberg 2006.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.