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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.