Interactive segmentation of non-star-shaped contours by dynamic programming

作者:

Highlights:

摘要

In this paper we present the Rack algorithm for the detection of optimal non-star-shaped contours in images. It is based on the combination of a user-driven image transformation and dynamic programming. The fundamental idea is to interactively specify and edit the general shape of the desired object by using a rack. This rack is used to model the image as a directed acyclic weighted graph that contains a path corresponding to the expected contour. In this graph, the shortest path with respect to an adequate cost function can be calculated efficiently via dynamic programming. The experimental results indicate the algorithm's ability of combining an acceptable amount of user interaction with generally good segmentation results.

论文关键词:Contour detection,Non-convex,Non-star-shaped,Shortest path,Dynamic programming

论文评审过程:Available online 22 March 2011.

论文官网地址:https://doi.org/10.1016/j.patcog.2011.03.010