.png){kind=icon}
.png){kind=icon}
Return
A fast, memory-efficient and parallelizable arc/circle segmentation algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.05.129.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a fast parallelizable arc/circle segmentation method with small memory cost. Firstly the proposed method extracts the edge and skeleton information in image space, records every line fragment in a multi-fork tree as a node which can be processed concurrently. For simplifying the computation, every line fragment is approximated by its piecewise linear polygon (PLG). After that local discrete curvature of each dominant point (DP) on the PLG is calculated and used to estimate the local arc's existence approximately, the arc's parameters are calculated simultaneously. Finally the inveracious arcs would be erased according to the results of arc veri. cation and the arc fragments would be jointed by the arc combination and tracking. This proposed method can deal with the edge rupture, intersection and overlapping conditions. Furthermore it requires small memory space and the parallel processing technology can be implemented to make it faster. (C) 2008 Elsevier Inc. All rights reserved.
Keywords:
Graphics recognition
Arc segmentation
Discrete curvature
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W