Abstract We treat edge detection as a supervised pattern recognition problem, in which the edge is modeled as a linear combination of basis functions. We show both theoretically and analytically that our selection of Constant, Step and Gaussian as the basis functions is optimal in the sense of mininizing the RMS fitting error. The parameters of these basis functions are learned during the training phase, and the recognition phase uses these learned parameters to locate pixels that belong to edges. This modeling of edges is suitable to edges found in radiographs, which are more complex than step functions. Since edges may appear in any direction, we first show how to determine the gradient direction of the edge. We present the basis functions selected for modeling edges in bone radiographs and show both theoretically and experimentally that they are optimal in the sense that they are the most suitable combination for approximating the bone edge when compared to polynomials with more parameters. We then compute the relevant coefficients and parameters to be used for discriminating between edge and non-edge pixels.
[1]
J. Canny.
Finding Edges and Lines in Images
,
1983
.
[2]
D Marr,et al.
Theory of edge detection
,
1979,
Proceedings of the Royal Society of London. Series B. Biological Sciences.
[3]
K. Ramesh Babu,et al.
Linear Feature Extraction and Description
,
1979,
IJCAI.
[4]
Larry S. Davis,et al.
A survey of edge detection techniques
,
1975
.
[5]
Tomaso A. Poggio,et al.
On Edge Detection
,
1984,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6]
Robert M. Haralick,et al.
Digital Step Edges from Zero Crossing of Second Directional Derivatives
,
1984,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[7]
Robert M. Haralick,et al.
Zero Crossing Of Second Directional Derivative Edge Operator
,
1982,
Other Conferences.