Shortest Enclosing Walks with a Non-zero Winding Number in Directed Weighted Planar Graphs: A Technique for Image Segmentation
This paper presents an efficient graph-based image segmentation algorithm based on finding the shortest closed directed walks surrounding a given point in the image. Our work is motivated by the Intelligent Scissors algorithm, which finds open contours using the shortest-path algorithm, and the Corridor Scissors algorithm, which is able to find closed contours. Both of these algorithms focus on undirected, nonnegatively weighted graphs. We generalize these results to directed planar graphs (not necessary with nonnegative weights), which allows our approach to utilize knowledge of the object’s appearance. The running time of our algorithm is approximately the same as that of a standard shortest-path algorithm.
KeywordsShort Path Image Segmentation Planar Graph Source Vertex Nonnegative Weight
Unable to display preview. Download preview PDF.
- 2.Falcao, A., Udupa, J., Miyazawa, F.: An ultra-fast user-steered image segmentation paradigm: live wire on the fly. IEEE Transactions on Medical Imaging 19 (2000)Google Scholar
- 3.Tse, J., Jones, C., Curtis, D., Yfantis, E.: An OCR-independent character segmentation using shortest-path in grayscale document images. In: Sixth International Conference on Machine Learning and Applications (ICMLA 2007), pp. 142–147 (2007)Google Scholar
- 5.Farin, D., Pfeffer, M., de With, P., Effelsberg, W.: Corridor scissors: a semiautomatic segmentation tool employing minimum-cost circular paths. In: Intnl. Conf. on Image Processing, ICIP 2004, vol. 2, pp. 1177–1180 (2004)Google Scholar
- 6.Farin, D., Peter, H.N.: Shortest circular paths on planar graphs. In: 27 th Symposium on Information Theory in the Benelux, pp. 117–124 (2006)Google Scholar
- 7.Jia, J., Sun, J., Tang, C.K., Shum, H.Y.: Drag-and-drop pasting. ACM SIGGRAPH 631 (2006)Google Scholar
- 9.Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik, 269–271 (1959)Google Scholar
- 12.Klein, P.N., Mozes, S., Weimann, O.: Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm. ACM Trans. Algorithms 6, 30:1–30:18 (2010)Google Scholar
- 13.Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: 8th Int’l Conf. Computer Vision, vol. 2, pp. 416–423 (2001)Google Scholar