Model driven edge detection

Standard edge detectors fail to find most relevant edges, finding either too many or too few, because they lack a geometric model to guide their search. We present a technique that integrates both photometric and geometric models with an initial estimate of the boundary. The strength of this approach lies in the ability of the geometric model to overcome various photometric anomalies, thereby finding boundaries that could not otherwise be found. Furthermore, edges can be scored based on their goodness of fit to the model, thus allowing one to use semantic model information to accept or reject the edges.

[1]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Demetri Terzopoulos,et al.  On Matching Deformable Models to Images , 1987, Topical Meeting on Machine Vision.

[3]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[4]  Martin A. Fischler,et al.  Linear delineation , 1987 .

[5]  A. Hanson,et al.  Overview of the SRI Cartographic Modeling Environment , 1992 .

[6]  Tomaso A. Poggio,et al.  On Edge Detection , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Robert M. Haralick,et al.  Digital Step Edges from Zero Crossing of Second Directional Derivatives , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Pascal Fua,et al.  Finding Object Bound-aries Using Guided Gradient Ascent , 1980 .