Abstract
Region filling algorithm is widely used in GIS, remote sensing, image processing, and plays an important role. There are problems that seeds are filled into stacks repeatedly and redundant information is for traditional 4-connected region filling algorithm. In this paper, we present a new fast region filling algorithm based on “Marking Method” to solve these problems that seeds are filled into stacks repeatedly, and then, change the scanning order and uses the “Cross Method” to search the filling Region. Compared with the traditional algorithm, this algorithm not only can improve 7 times more efficiency, but also can make it simple and filling correctly.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, X.B., Hu, F.S., Zhang, B.J.: A new regional seed-filling algorithm. Computer Engineering and Applications 38(8), 101–103 (2002) (in Chinese)
Burger, P.: Interactive computer graphices functional, procedural and device-level methods. Addison-Wesley, Massachusetts (1989)
Pavlidis, T.: Algorithms for graphics and image processing, pp. 65–73. Computer Science Press Inc., Rockville (1982)
Sun, J.G., Hu, S.M.: Computer Graphics Essentials, pp. 24–31. Tsinghua University Press, Beijing (2008) (in Chinese)
Sun, Q., Zheng, Y.G.: Scan line fill algorithm’s problems and improvements in complicated connected region. Image Processing and Mode Identification (3), 71–75 (2007) (in Chinese)
Guo, W.P., Long, B.Q.: The improvements of Scan line seed-filling. Newspapers of Tianjin Polytechnic University 27(2), 48–51 (2008) (in Chinese)
Zhang, Z.F., Ma, S.F., Li, W.: A new seed-filling algorithm. Computer Engineering and Applications 45(6), 201–206 (2009) (in Chinese)
Dorigo, M., Caro, G.D., Gambardella, L.M.: Ant algorithms for solving weapon-target at assignment problem. Applied Soft. Computing 2, 39–47 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duo-le, F., Ming, Z. (2011). A New Fast Region Filling Algorithm Based on Cross Searching Method. In: Zhou, M., Tan, H. (eds) Advances in Computer Science and Education Applications. Communications in Computer and Information Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22456-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-22456-0_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22455-3
Online ISBN: 978-3-642-22456-0
eBook Packages: Computer ScienceComputer Science (R0)