Robust segmentation of edge data

The author describes a new, robust, parallel algorithm for the segmentation of edge data. The segmentation is in the form of straight-lines and circular arcs. No user-supplied thresholds are necessary, and additionally the further grouping of the segments is simplified. The algorithm has been implemented within the FEX software package for use on sequential machines. Using a number of complex edge maps, he compares the results of the application of the algorithm with that developed by West and Rosin (1991) based on a technique suggested by Lowe (1987).<
>