Skip to main content
SpringerLink
Log in

The Tractability of Segmentation and Scene Analysis

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

Abstract

One of the fundamental problems in computer vision is the segmentation of an image into semantically meaningful regions, based only on image characteristics. A single segmentation can be determined using a linear number of evaluations of a uniformity predicate. However, minimising the number of regions is shown to be an NP-complete problem. We also show that the variational approach to segmentation, based on minimising a criterion combining the overall variance of regions and the number of regions, also gives rise to an NP-complete problem.

When a library of object models is available, segmenting the image becomes a problem of scene analysis. A sufficient condition for the reconstruction of a 3D scene from a 2D image to be solvable in polynomial time is that the scene contains no cycles of mutually occluding objects and that no range information can be deduced from the image. It is known that relaxing the no cycles condition renders the problem NP-complete. We show that relaxing the no range information condition also produces an NP-complete problem.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aho, A.V., Hopcroft, J.E., and Ullman, J.D., 1974. The Design and Analysis of ComputerAlgorithms. Addison-Wesley Publishing Company.

  • Ansari, N. and Delp, E.J., 1990. Partial shape recognition: Alandmark-based approach. IEEE Trans. Pattern Analysis and Machine Intelligence, 12(5):470–483.

    Google Scholar 

  • Ayache, N.and Faugeras, O.D. 1986. HYPER: A new-approach for the recognition and positioning of two-dimensional objects. IEEE Trans. Pattern Analysis and Machine Intelligence, 8(1):44–54.

    Google Scholar 

  • Beaulieu, J.-M. and Goldberg, M. 1989.Hierarchy in picture segmentation: A stepwise optimization approach. IEEE Trans. Pattern Analysis and Machine Intelligence, 11(2):150–163.

    Google Scholar 

  • Borisenko, V.I., Zlatopol'skii, A.A., and Muchnik, I.B. 1987. Imagesegmentation (state-of-the-art survey). Automation and Remote Control, 48(7):837–879.

    Google Scholar 

  • Cass, T.A. 1992.Polynomial-time object recognition in the presence of clutter, occlusion, and uncertainty. In Proc. 2nd European Conference on Computer Vision, Springer-Verlag, pp. 834–842.

  • Clowes, M.B. 1971. On seeing things. Artificial Intelligence,2:79–116.

    Google Scholar 

  • Cooper, M.C. 1988. Efficient systematic analysis of occlusion. Pattern Recognition Letters,7:259–264.

    Google Scholar 

  • Cooper, M.C. 1992. Visual Occlusion and the Interpretation of Ambiguous Pictures. EllisHorwood: Chichester, UK.

    Google Scholar 

  • Cooper, M.C. 1997. Interpreting line drawings of curved objects with tangential edges andsurfaces. Image and Vision Computing, 15:263–276.

    Google Scholar 

  • Cooper, M.C., Cohen, D.A., and Jeavons, P.G. 1994.Characterising tractable constraints. Artificial Intelligence, 65:347–361.

    Google Scholar 

  • Dendris, N.D., Kalafatis, I.A., and Kirousis, L.M. 1994. An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects. Journal of Mathematical Imaging and Vision, 4:375–387.

    Google Scholar 

  • Eades, P. and Rappaport, D. 1993. Thecomplexity of computing minimum separating polygons. Pattern Recognition Letters, 14(9):715–718.

    Google Scholar 

  • Fu, K.S. and Mui, J.K. 1981. A survey on image segmentation. Pattern Recognition, 13:3–16.

    Google Scholar 

  • Garey, M.R. and Johnson, D.S. 1979. Computers and Intractability— A Guide to the Theory of NP-Completeness. W.H. Freeman: San Francisco.

    Google Scholar 

  • Gupta, L. and Malakapalli, K. 1990. Robust partial shape classification using invariant breakpoints anddynamic alignment. Pattern Recognition, 23(10):1103–1111.

    Google Scholar 

  • Haralick, R.M. and Shapiro, L.G. 1985.Survey: Image segmentation techniques. Computer Vision, Graphics and Image Processing, (29):100–132.

  • Huffman, D.A. 1971. Impossible objects as nonsense sentences. In Machine Intelligence, B. Meltzer and D. Michie (Eds.), Edinburg University Press, vol. 6, pp 295–323.

  • Kirousis, L.M. 1990. Effectively labelingplanar projections of polyhedra. IEEE Trans. on Pattern Analysis and Machine Intelligence, 12(2):123–130.

    Google Scholar 

  • Kirousis, L.M. 1993. Fast parallel constraint satisfaction. Artificial Intelligence, 64:147–160.

    Google Scholar 

  • Kirousis, L.M. and Papadimitriou, C.H. 1988. The complexity of recognising polyhedral scenes. Journal of Computer and System Science, 37(1):14–38.

    Google Scholar 

  • Kube, P.R. 1991. Unbounded visual search is not both biologically plausibleand NP-Complete. Behavioral and Brain Sciences, 4:768–770.

    Google Scholar 

  • Lamdan, Y., Schwartz, J.T., and Wolfson, H.J.1988. Object recognition by affine invariant matching. In Proc. IEEE Computer Soc. Conf. Computer Vision and Pattern Recognition, pp. 335–344.

  • Lichtenstein, D. 1982. Planar formulae and their uses. SIAM J. Computing,11:329–343.

    Google Scholar 

  • Lim, Y.M. and Lee, S.U. 1990. On the color image segmentation algorithm based on thethresholding and the fuzzy c-means techniques. Pattern Recognition, 23(9):935–952.

    Google Scholar 

  • Mumford, D. and Shah, J.1989. Optimal approximations of piecewise smooth functions and associated variational problems. Communications in Pure and Applied Mathematics, 42:577–685.

    Google Scholar 

  • Neveu, C.F., Dyer, C.R., and Chin, R.T. 1986. Two-dimensional object recognition using multiresolution models. ComputerVision, Graphics and Image Processing, 34:52–65.

    Google Scholar 

  • Nitzberg, M., Mumford, D., and Shiota, T. 1991. Filtering, segmentation and depth. Lecture Notes in ComputerScience, vol. 662, Springer-Verlag.

  • Pal, N.R. and Pal, S.K. 1993. A review on image segmentation techniques.Pattern Recognition, 26:1277–1294.

    Google Scholar 

  • Papadimitriou, C.H. 1994. Computational Complexity. Addison-Wesley: Reading, MA.

    Google Scholar 

  • Parodi, P. and Torre, V. 1994. On the complexity of labeling perspective projections ofpolyhedral scenes. Artificial Intelligence, 70:239–276.

    Google Scholar 

  • Pavlidas, T. 1977. Structural Pattern Recognition.Springer-Verlag.

  • Sugihara, K. 1986. Machine Interpretation of Line Drawings. MIT Press: Cambridge, MA.

    Google Scholar 

  • Tsotsos, J.K. 1990. Analyzing vision at the complexity level. Behavioral and Brain Sciences, 13:423–469.

    Google Scholar 

  • Ullmann, J.R. 1992. Analysis of 2-D occlusion by subtracting out. IEEE Trans. on Pattern Analysis and Machine Intelligence, 14(4):485–489.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT, University of Toulouse III, 31062, Toulouse

    Martin C. Cooper

Authors
  1. Martin C. Cooper
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cooper, M.C. The Tractability of Segmentation and Scene Analysis. International Journal of Computer Vision 30, 27–42 (1998). https://doi.org/10.1023/A:1008013412628

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008013412628

Search

Navigation