Skip to main content

Advertisement

Log in

Global Detection of Salient Convex Boundaries

  • Published:
International Journal of Computer Vision Aims and scope Submit manuscript

Abstract

As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we describe a general approach that can force various edge-grouping algorithms to detect only convex structures from a set of boundary fragments. The basic idea is to remove some fragments and fragment connections so that, on the remaining ones, a prototype edge-grouping algorithm that detects closed boundaries without the convexity constraint can only produce convex closed boundaries. We show that this approach takes polynomial time and preserves the grouping optimality by not excluding any valid convex boundary from the search space. Choosing the recently developed ratio-contour algorithm as the prototype grouping algorithm, we develop a new convex-grouping algorithm, which can detect convex salient boundaries with good continuity and proximity in a globally optimal fashion. To facilitate the application of this convex-grouping algorithm, we develop a new fragment-connection method based on four-point Bezier curves. We demonstrate the performance of this convex-grouping algorithm by conducting experiments on both synthetic and real images. In addition, we provide a comparison with some prior edge-grouping algorithms. Finally, we show that the proposed convex-grouping algorithm can be further extended to detect convex open boundaries, derive region-based image hierarchies, and incorporate some simple human-computer interactions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alter, T. and Basri, R. 1998. Extracting salient contours from images: An analysis of the saliency network. In International Journal of Computer Vision, pp. 51–69.

  • Amir, A. and Lindenbaum, M. 1998. A generic grouping algorithm and its quantitative analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(2):168–185.

    Article  Google Scholar 

  • Bartels, R., Beatty, J., and Barsky, B. 1987. An Introduction to Splines for use in Computer Graphics and Geometric Modelling. Morgan Kaufmann, Los Altos.

  • Bertamini, M. 2001. The importance of being convex: An advantage for convexity when judging position. Perception, 30:1295–1310.

    Article  Google Scholar 

  • Boehm, W., Paluszny, M., and Prautzsch, H. 2002. Bezier and B-Spline Techniques. Springer-Verlag, Berlin.

  • Borra, S. and Sarkar, S. 1997. A framework for performance characterization of intermediate-level grouping modules. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(11):1306–1312.

    Article  Google Scholar 

  • Bruckstein, A. and Netravali, A. 1990. On minimal energy trajectories. Computer Vision, Graphics, and Image Processing, 49:283–296.

    Article  Google Scholar 

  • Cormen, T.H., Leiserson, C.E., and Rivest, R.L. 1990. Introduction to Algorithms. Cambridge: MIT Press/New York: McGraw Hill.

  • Elder, J., Krupnik, A., and Johnston, L. 2003. Contour grouping with prior models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(6):661–674.

    Article  Google Scholar 

  • Elder, J. and Zucker, S. 1996. Computing contour closure. In European Conference on Computer Vision, pp. 399–412.

  • Estrada, F. and Jepson, A. 2004a. Perceptual grouping for contour extraction. In International Conference on Pattern Recognition Vol. 2, pp. 32–35.

  • Estrada, F. and Jepson, A. 2004b. Controlling the search for convex groups. Technical Report CSRG-482, Department of Computer Science, University of Toronto.

  • Foley, J.D., Dam, A., Feiner, S.K., and Hughes, J.F. 1995. Computer Graphics: Principles and Practice in C. 2nd Edn. Reading, MA: Addison Wesley.

  • Forsyth, D. and Ponce, J. 2003. Computer Vision: A Modern Approach. Upper Saddle River, NJ: Prentice Hall.

  • Guy, G. and Medioni, G. 1996. Inferring global perceptual contours from local features. International Journal of Computer Vision, 20(1):113–133.

    Article  Google Scholar 

  • Huttenlocher, D. and Wayner, P. 1992. Finding convex edge groupings in an image. International Journal of Computer Vision, 8(1):7–29.

    Article  Google Scholar 

  • Jacobs, D. 1987. GROPER: A grouping based object recognition system for two-dimensional objects. In Proceedings of IEEE Workshop on Computer Vision, pp. 164–169.

  • Jacobs, D. 1992. Recognizing 3D objects using 2D images. Technical Report MIT AI-1416, Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

  • Jacobs, D. 1996a. Convex grouping code. http://www.cs.umd.edu/djacobs/convex-grouping.tar.

  • Jacobs, D. 1996b. Robust and efficient detection of convex groups. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(1):23–37.

    Article  Google Scholar 

  • Kanisza, G. and Gerbino, W. 1976. Convexity and symmetry in figure-ground organization. In Vision and Artifact. M. Henle, (Eds.), New York: Springer.

  • Liu, Z., Jacobs, D., and Basri, R. 1999. The role of convexity in perceptual completion: Beyond good continuation. Vision Research, 39:4244–4257.

    Article  Google Scholar 

  • Lowe, D.G. 1985. Perceptual Organization and Visual Recognition. Boston: Kluwer Academic Publishers.

  • Mahamud, S., Williams, L.R., Thornber, K.K., and Xu, K. 2003. Segmentation of multiple salient closed contours from real images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(4):433–444.

    Article  Google Scholar 

  • Mio, W., Srivastava, A., and Klassen, E. 2004. Interpolations with elasticae in euclidean spaces. Quarterly of Applied Mathematics, 62(2):359–378.

    MATH  MathSciNet  Google Scholar 

  • Mumford, D. 1994. Elastica and computer vision. In Algebraic Geometry and Its Applications, C. Bajaj, (Ed.), Springer Verlag, pp. 491–506.

  • Nattkemper, T.W. 2004. Automatic segmentation of digital micrographs: A survey. In Proceedings of 11th World Congress on Medical Informatics (MEDINFO), San Franzisco, USA.

  • Parvin, B. and Viswanathan, S. 1995. Tracking of convex objects. In Proceedings of the International Symposium on Computer Vision, pp. 295–298.

  • Sarkar, S. and Boyer, K. 1996. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In IEEE Conference on Computer Vision and Pattern Recognition, pp. 478–483.

  • Sarkar, S. and Boyer, K.L. 1994. Computing Perceptual Organization in Computer Vision. Singapor: World Scientific.

  • Saund, E. 2003. Finding perceptually closed paths in sketches and drawings. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(4):475–491.

    Article  Google Scholar 

  • Saund, E. and Moran, T. 1995. Perceptual organization in an interactive sketch editing applications. In International Conference on Computer Vision, pp. 597–604.

  • Sharon, E., Brandt, A., and Basri, R. 2000. Completion energies and scale. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(10):1117–1131.

    Article  Google Scholar 

  • Shashua, A. and Ullman, S. 1988. Structural saliency: The detection of globally salient structures using a locally connected network. In International Conference on Computer Vision, pp. 321–327.

  • Srivastava, A., Mio, W., Klassen, E., and Liu, X. 2003. Geometric analysis of constrained curves for image understanding. In Proceedings of 2nd IEEE Workshop on Variational, Geometric, and Level Set Methods (VLSM) in Vision, Nice, France.

  • Stahl, J. and Wang, S. 2005. Convex grouping combining boundary and region information. In International Conference on Computer Vision, Beijing, China, pp. II: 946–953.

  • Wang, S., Kubota, T., Siskind, J., and Wang, J. 2005. Salient closed boundary extraction with ratio contour. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(4):546–561.

    Article  Google Scholar 

  • Wang, S., Kubota, T., and Siskind, J.M. 2003. Salient boundary detection using ratio contour. In Neural Information Processing Systems Conference, pp. 1571–1578.

  • Wang, S., Wang, J., and Kubota, T. 2004. From fragments to salient closed boundaries: An in-depth study. In IEEE Conference on Computer Vision and Pattern Recognition, pp. II:291–298.

  • Wertheimer, M. 1938. Laws of organization in perceptual forms (partial translation). In A Sourcebook of Gestalt Psychology, W.D. Ellis, (Ed.), New York: Harcourt, Brace, pp. 71–88.

  • Williams, L. and Jacobs, D. 1997. Stochastic completion fields: A neural model of illusory contour shape and salience. Neural Computation, 9:849–870.

    Google Scholar 

  • Williams, L. and Thornber, K.K. 2000. A comparison measures for detecting natural shapes in cluttered background. International Journal of Computer Vision, 34(2/3):81–96.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Song Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, S., Stahl, J.S., Bailey, A. et al. Global Detection of Salient Convex Boundaries. Int J Comput Vision 71, 337–359 (2007). https://doi.org/10.1007/s11263-006-8427-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11263-006-8427-2

Keywords

Navigation