A Bayesian multiple hypothesis approach to contour grouping

8Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Cox, I. J., Rehg, J. M., & Hingorani, S. (1992). A Bayesian multiple hypothesis approach to contour grouping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 588 LNCS, pp. 72–77). Springer Verlag. https://doi.org/10.1007/3-540-55426-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free