A Bayesian multiple hypothesis approach to contour grouping

  • Ingemar J. Cox
  • James M. Rehg
  • Sunita Hingorani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 588)


We present an approach to contour grouping based on classical tracking techniques. Edge points are segmented into smooth curves so as to minimize a recursively updated Bayesian probability measure. The resulting algorithm employs local smoothness constraints and a statistical description of edge detection, and can accurately handle corners, bifurcations, and curve intersections. Experimental results demonstrate good performance.


False Alarm Edge Point Surveillance Region Parent Hypothesis Global Hypothesis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Ballard. Generalizing the hough transform to detect arbitrary shapes. Pattern Recognition, 13(2):111–122, 1981.CrossRefGoogle Scholar
  2. 2.
    Y. Bar-Shalom and T. E. Fortmann. Tracking and Data Association. Academic Press, 1988.Google Scholar
  3. 3.
    R. A. Boie and I. J. Cox. Two dimensional optimum edge detection using matched and wiener filters for machine vision. In IEEE First International Conference on Computer Vision, pages 450–456. IEEE, June 1987.Google Scholar
  4. 4.
    J. Canny. A computational approach to edge detection. IEEE Trans. Pattern Analysis and Machine Intelligence, 8(6):34–43, 1986.Google Scholar
  5. 5.
    I. J. Cox, J. M. Rehg, and S. Hingorani. A bayesian multiple hypothesis approach to contour grouping. Technical report, NEC Research Institute, Princeton, USA, 1991.Google Scholar
  6. 6.
    C. David and S. Zucker. Potentials, valleys, and dynamic global coverings. Int. J. Computer Vision, 5(3):219–238, 1990.Google Scholar
  7. 7.
    E. Hildreth. Computation underlying the measurement of visual motion. Artificial Intelligence, 27(3):309–355, 1984.MathSciNetGoogle Scholar
  8. 8.
    D. Kriegman and J. Ponce. On recognizing and positioning 3-d objects from image contours. IEEE Trans. Pattern Analysis and Machine Intelligence, 12(12):1127–1137, December 1990.Google Scholar
  9. 9.
    T. Kurien. Issues in the design of practical multitarget tracking algorithms. In Y. Bar-Shalom, editor, Multitarget-Multisensor Tracking: Advanced Applications, pages 43–83. Artech House, 1990.Google Scholar
  10. 10.
    A. Martelli. An application of heuristic search methods to edge and contour detection. Communications of the ACM, 19(2):73–83, 1976.Google Scholar
  11. 11.
    D. B. Reid. An algorithm for tracking multiple targets. IEEE Transactions on Automatic Control, AC-24(6):843–854, December 1979.Google Scholar
  12. 12.
    A. Shashua and S. Ullman. Grouping contours by iterated pairing network. In Richard P. Lippmann, John Moody, and David S. Touretzky, editors, Advances in Neural Information Processing Systems 3. Morgan Kaufmann, 1991. Proc. NIPS'90, Denver CO.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ingemar J. Cox
    • 1
  • James M. Rehg
    • 2
  • Sunita Hingorani
    • 1
  1. 1.NEC Research InstitutePrinceton
  2. 2.Dept. of Electrical and Computer Eng.Carnegie Mellon UniversityPittsburgh

Personalised recommendations