Robust segmentation of edge data
Robust segmentation of edge data
复制标题
DOI：
--
复制
发表时间：
1992-04
期刊：
影响因子：
--
通讯作者：
A. Etemadi
中科院分区：
文献类型：
--
作者：
A. Etemadi
作者描述了一种新的、鲁棒的、并行的边缘数据分割算法。分段的形式有直线和圆弧。不需要用户提供的阈值，此外还简化了分段的进一步分组。该算法已在 FEX 软件包中实现，以便在顺序机器上使用。他使用许多复杂的边缘图，将该算法的应用结果与 West 和 Rosin (1991) 基于 Lowe (1987) 建议的技术开发的算法进行了比较。 >
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). >