Edge tracking and fitting
of line and arc segments

As a further example, we show an approach which tracks edge data in a local neighbourhood, yet fits straight line and circular arc segments as it proceeds. It is a three pass algorithm, which operates on thinned edge data. The algorithm is not described in detail; a description can be found in ``Robust segmentation of edge data'' in the Proc. of the 4th IEE International Conf. on Image Processing, 1992, written by A. Etemadi.

Figures 5 and 6, below, show an example of the algorithm applied to a test image. Here, line or arcs of less than 10 pixels are rejected.

Figure 5
Figure 5: The test image

Figure 6
Figure 6: Edge tracking and fitting

[ Feature space transformation for line detection | Representation of two-dimensional boundaries ]

Comments to: Sarah Price at ICBL.
(Last update: 22th April, 1996)