31 December 2010 Boundary character based declining scanning-line filling algorithm
Author Affiliations +
Proceedings Volume 7544, Sixth International Symposium on Precision Engineering Measurements and Instrumentation; 75443K (2010) https://doi.org/10.1117/12.886018
Event: Sixth International Symposium on Precision Engineering Measurements and Instrumentation, 2010, Hangzhou, China
Abstract
In order to increase the efficiency of filling area, a novel declining scanning-line filling algorithm for filling area is proposed, in which the boundaries of image are traced through the adjacent connection, and their locations of the image edges are recorded at the same time. The direction of scanning-line is determined by the relative position between the seed point and the boundary point, and all the points in the adjacent field of scanning-line are filled only once. The vertical distance between the scanning-line is depended on the connected domain. The number of crossing points between the scanning-line and boundary is used to estimate the state of filling or ending. The algorithm can be used to fill the 4-adjacent or 8-adjacent fields, to settle the problem of deep recursion and iterative stack, and to solve the defect of repeated scanning and filling in traditional algorithm. By using the proposed algorithm, the filling result is accurate, the calculation of the algorithm is decreased, and the filling efficiency is enhanced.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Weijun Gao, Weijun Gao, } "Boundary character based declining scanning-line filling algorithm", Proc. SPIE 7544, Sixth International Symposium on Precision Engineering Measurements and Instrumentation, 75443K (31 December 2010); doi: 10.1117/12.886018; https://doi.org/10.1117/12.886018
PROCEEDINGS
7 PAGES


SHARE
Back to Top