Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Mortensen, E.N., Barrett, W.A.: Intelligent scissors for image composition. In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1995, pp. 191–198. ACM, New York (1995)
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)
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)
Felzenszwalb, P.F., Huttenlocher, D.P.: Efficient graph-based image segmentation. Int. J. Comput. Vision 59, 167–181 (2004)
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)
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)
Jia, J., Sun, J., Tang, C.K., Shum, H.Y.: Drag-and-drop pasting. ACM SIGGRAPHÂ 631 (2006)
Provan, J.S.: Shortest enclosing walks and cycles in embedded graphs. Inf. Process. Lett. 30, 119–125 (1989)
Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik, 269–271 (1959)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596–615 (1987)
Klein, P., Rao, S., Rauch, M., Subramanian, S.: Faster shortest-path algorithms for planar graphs. In: Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 27–37. ACM, New York (1994)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Malistov, A. (2014). Shortest Enclosing Walks with a Non-zero Winding Number in Directed Weighted Planar Graphs: A Technique for Image Segmentation. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2014. Lecture Notes in Computer Science, vol 8888. Springer, Cham. https://doi.org/10.1007/978-3-319-14364-4_71
Download citation
DOI: https://doi.org/10.1007/978-3-319-14364-4_71
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14363-7
Online ISBN: 978-3-319-14364-4
eBook Packages: Computer ScienceComputer Science (R0)