Skip to main content

A complexity space for curve grouping

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 970))

Abstract

In vision, curves can denote simple objects (such as a straight line), or complicated objects (such as a jumble of string). The difference between these situations is in part a measure of their complexity, and in part a measure of their dimensionality. Our goal is to develop a formal theory of curves appropriate for computational vision in general, and for problems like separating straight lines from strings in particular. The theory is applied to the problem of perceptual grouping.

Research supported by the AFOSR and NSERC. S.W.Z. is a Fellow of the Canadian Institut for Advanced Research.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Benoit Dubuc. On the complexity of curves and the representation of visual information. PhD thesis, McGill University, Dept of Electrical Engineering, Montréal, 1995.

    Google Scholar 

  2. Kenneth J. Falconer. The Geometry of Fractal Sets, volume 85 of Cambridge Tracts in Mathematics. Cambridge University Press, Cambridge, England, 1987.

    Google Scholar 

  3. Lee A. Iverson and Steven W. Zucker. Logical/linear operators for image curves. IEEE Trans. Pattern Anal. Machine Intell., in press.

    Google Scholar 

  4. Gaetano Kanizsa. Organisation in vision. Praeger, New York, 1979.

    Google Scholar 

  5. Jean Serra. Image Analysis and Mathematical Morphology. Academic Press, London, 1982.

    Google Scholar 

  6. Claude Tricot. Curves and fractal dimension. Springier-Verlag, New York, 1995.

    Google Scholar 

  7. Shimon Ullman. Three-dimensional object recognition. In Cold Spring Harbor Symposia on Quantitative Biology, volume LV, pages 889–898. Cold Spring Harbor Laboratory Press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubuc, B., Zucker, S.W. (1995). A complexity space for curve grouping. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_277

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_277

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics