nips nips2003 nips2003-168 nips2003-168-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Song Wang, Toshiro Kubota, Jeffrey M. Siskind
Abstract: This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real images. The boundary saliency is defined using the Gestalt laws of closure, proximity, and continuity. This paper first constructs an undirected graph with two different sets of edges: solid edges and dashed edges. The weights of solid and dashed edges measure the local saliency in and between boundary fragments, respectively. Then the most salient boundary is detected by searching for an optimal cycle in this graph with minimum average weight. The proposed approach guarantees the global optimality without introducing any biases related to region area or boundary length. We collect a variety of images for testing the proposed approach with encouraging results. 1
[1] R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, & Applications. Prentice Hall, Englewood Cliffs, 1993.
[2] T. Alter and R. Basri. Extracting salient contours from images: An analysis of the saliency network. In IEEE Conference on Computer Vision and Pattern Recognition, pages 13–20, 1996.
[3] A. Amir and M. Lindenbaum. A generic grouping algorithm and its quantitative analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(2):168–185, 1998.
[4] W. Cook and A. Rohe. Computing minimum-weight perfect matchings. http://www.or.unibonn.de/home/rohe/matching.html, Aug. 1998.
[5] I. Cox, S. B. Rao, and Y. Zhong. Ratio regions: A technique for image segmentation. In International Conference on Pattern Recognition, pages 557–564, 1996.
[6] J. Elder and S. Zucker. Computing contour closure. In European Conference on Computer Vision, pages 399–412, 1996.
[7] G. Guy and G. Medioni. Inferring global perceptual contours from local features. International Journal of Computer Vision, 20(1):113–133, 1996.
[8] D. Jacobs. Robust and efficient detection of convex groups. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(1):23–37, 1996.
[9] I. H. Jermyn and H. Ishikawa. Globally optimal regions and boundaries as minimum ratio cycles. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1075–1088, 2001.
[10] T. Kubota. Contextual and non-combinatorial approach to feature extraction. In Int’l Workshop on EMMCVPR, pages 467–482, 2003.
[11] S. Mahamud, L. R. Williams, K. K. Thornber, and K. Xu. Segmentation of multiple salient closed contours from real images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(4):433–444, 2003.
[12] S. Sarkar and K. Boyer. Quantitative measures of change bvased on feature organization: Eigenvalues and eigenvectors. In IEEE Conference on Computer Vision and Pattern Recognition, pages 478–483, 1996.
[13] A. Shashua and S. Ullman. Structural saliency: The detection of globallly salient structures using a locally connected network. In International Conference on Computer Vision, pages 321–327, 1988.
[14] J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888–905, 2000.
[15] S. Wang and J. M. Siskind. Image segmentation with ratio cut. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(6):675–690, 2003.
[16] L. Williams and K. K. Thornber. A comparison measures for detecting natural shapes in cluttered background. International Journal of Computer Vision, 34(2/3):81–96, 2000.
[17] Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(11):1101–1113, 1993.