Edge linking by a directional potential function (DPF)

Low level edge detection operators do not usually guarantee the generation of contiguous boundaries of objects in images. This, coupled with other inherent signal noises, makes many image analysis tasks difficult. We present a new algorithm that is theoretically inspired by a potential function method originated in physics. In this algorithm an edge image is modelled as a potential field with energy depositions at the detected edge positions. Pixels at the edge broken points are charged by the potential forces of the energy in proportion to the relative distances and directions of the surrounding edge pixels. A directional potential function (DPF) is applied to measure the energy charges, which in turn direct the edge connections at these points. Heuristic techniques are utilized in the algorithm to assist the search of charged pixels and improve the effectiveness of the DPF evaluations.

[1]  K. Ramesh Babu,et al.  Linear Feature Extraction and Description , 1979, IJCAI.

[2]  Dana H. Ballard,et al.  Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[3]  M. Aizerman,et al.  Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning , 1964 .

[4]  Donald Geman,et al.  Boundary Detection by Constrained Optimization , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  James S. Duncan,et al.  Boundary Finding with Parametrically Deformable Models , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  D Marr,et al.  Theory of edge detection , 1979, Proceedings of the Royal Society of London. Series B. Biological Sciences.

[7]  Alberto Martelli,et al.  An application of heuristic search methods to edge and contour detection , 1976, CACM.

[8]  John M. Prager,et al.  Extracting and Labeling Boundary Segments in Natural Scenes , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  John Porrill.  Fitting ellipses and predicting confidence envelopes using a bias corrected Kalman filter , 1990, Image Vis. Comput..

[10]  R. E. Burge,et al.  A new algorithm for extracting the interior of bounded regions based on chain coding , 1988, Comput. Vis. Graph. Image Process..

[11]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[12]  Vishvjit S. Nalwa,et al.  Edgel aggregation and edge description , 1987, Comput. Vis. Graph. Image Process..

[13]  Gérard G. Medioni,et al.  Detection, Localization, and Estimation of Edges , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

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

[15]  Larry S. Davis,et al.  A survey of edge detection techniques , 1975 .

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

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

[18]  Alexander A. Sawchuk,et al.  Supervised Textured Image Segmentation Using Feature Smoothing and Probabilistic Relaxation Techniques , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[19]  Alexander A. Sawchuk,et al.  Unsupervised textured image segmentation using feature smoothing and probabilistic relaxation techniques , 1989, Comput. Vis. Graph. Image Process..