A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Computing Stochastic Completion Fields in Linear-Time Using a Resolution Pyramid
1999
Computer Vision and Image Understanding
We describe a linear-time algorithm for computing the likelihood that a completion joining two contour fragments passes through any given position and orientation in the image plane. Our algorithm is a resolution-pyramid-based method for solving a partial differential equation (PDE) characterizing a distribution of short, smooth completion shapes. The PDE consists of a set of independent advection equations in (x, y) coupled in the θ dimension by the diffusion equation. A previously described
doi:10.1006/cviu.1999.0800
fatcat:7hes55z2vvby5dnmt345wzvcvi