Abstract
Convexity represents an important principle of grouping in visual perceptual organization. This paper presents a new technique for contour grouping based on convexity and has the following two properties. Firstly it finds groupings that form contours of high convexity which are not strictly convex. Secondly it finds groupings that form both open and closed contours of high convexity. The authors are unaware of any existing technique which exhibits either of these properties. Contour grouping is posed as the problem of finding minimum cost paths in a graph. The proposed method is evaluated against two highly cited benchmark methods which find strictly convex contours. Both qualitative and quantitative results on natural images demonstrate the proposed method significantly outperforms both benchmark methods.
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
Ansari, N., Delp, E.: Partial shape recognition: a landmark-based approach. IEEE International Conference on Systems, Man and Cybernetics 2, 831–836 (1989)
Borra, S., Sarkar, S.: A framework for performance characterization of intermediate-level grouping modules. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(11), 1306–1312 (1997)
Elder, J., Elder, J., Zucker, S., Zucker, S.: A measure of closure. Vision Research 34, 3361–3369 (1994)
Geisler, W.S., Perry, J.S., Super, B.J., Gallogly, D.P.: Edge co-occurrence in natural images predicts contour grouping performance. Vision Research 41(6), 711–724 (2001)
Jacobs, D.: Robust and efficient detection of salient convex groups. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(1), 23–37 (1996)
Jain, R., Kasturi, R., Schunck, B.G.: Machine vision. McGraw-Hill, Inc., New York (1995)
Latecki, L.: Shape similarity measure based on correspondence of visual parts. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(10), 1185–1190 (2000)
Latecki, L.J., Lakmper, R.: Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding 73(3), 441–454 (1999)
Lowe, D.G.: Object recognition from local scale-invariant features. IEEE International Conference on Computer Vision 2, 1150–1157 (1999)
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: Proc. 8th Int’l Conf. Computer Vision, vol. 2, pp. 416–423 (July 2001)
Corcoran, P., Mooney, P., Tilton, J.: Convexity Measure for Partial Contours by Shape Similarity. In: British Machine Vision Conference. Dundee, Under Review (2011)
Saund, E.: Finding perceptually closed paths in sketches and drawings. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(4), 475–491 (2003)
Stahl, J., Wang, S.: Convex grouping combining boundary and region information. In: IEEE International Conference on Computer Vision, vol. 2, pp. 946–953 (2005)
Russell, S., Norvig, P.: Artificial Intelligence: a Modern Approach, 3rd edn. Prentice-Hall, Upper Saddle River (2009)
Wang, S., Kubota, T., Siskind, J., Wang, J.: Salient closed boundary extraction with ratio contour. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(4), 546–561 (2005)
Wang, S., Stahl, J., Bailey, A., Dropps, M.: Global detection of salient convex boundaries. International Journal of Computer Vision 71(3), 337–359 (2007)
Wang, S., Wang, J., Kubota, T.: From fragments to salient closed boundaries: an in-depth study. In: IEEE Conference on Computer Vision and Pattern Recognition, vol. 1, pp. I–291– I–298 (2004)
van de Weijer, J., Gevers, T., Smeulders, A.: Robust photometric invariant features from the color tensor. IEEE Transactions on Image Processing 15(1), 118–127 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corcoran, P., Mooney, P., Tilton, J. (2011). Convexity Grouping of Salient Contours. In: Jiang, X., Ferrer, M., Torsello, A. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2011. Lecture Notes in Computer Science, vol 6658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20844-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-20844-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20843-0
Online ISBN: 978-3-642-20844-7
eBook Packages: Computer ScienceComputer Science (R0)