A path metric for sequential search and its application in edge linking

The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting node, transitions are made to the goal nodes by a maximum likelihood metric. This metric requires only local calculations on the search space and its use in edge linking provides more accurate results than other linking techniques.<<ETX>>

[1]  Steven M. Kay,et al.  Edge detection using the linear model , 1986, IEEE Trans. Acoust. Speech Signal Process..

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

[3]  David B. Cooper,et al.  Implementation, Interpretation, and Analysis of a Suboptimal Boundary Finding Algorithm , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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

[6]  Aly A. Farag,et al.  A Stochastic Modeling Approach to Region-and Edge-Based Image Segmentation , 1990 .

[7]  M. Bertero,et al.  Ill-posed problems in early vision , 1988, Proc. IEEE.

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

[9]  J. W. Modestino,et al.  The contour extraction problem with biomedical applications , 1977 .

[10]  Azriel Rosenfeld,et al.  Edge Evaluation Using Local Edge Coherence , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  P. Eichel,et al.  A method for a fully automatic definition of coronary arterial edges from cineangiograms. , 1988, IEEE transactions on medical imaging.