Abstract
Removing noises in a given binary image is one of common operations. A generalization of the operation is to erase arbitrarily specified component by reversing pixels values in the component. This paper shows that this operation is done without using any data structure like a stack or queue, or without using any extra work space in O(n logn) time for a component consisting of n pixels. This is an in-place algorithm, but the image matrix cannot be used as work space since it has a single bit for each pixel. Whenever we flip pixel value in an objective component, the component shape also changes, which causes some difficulty. An idea for our constant work space algorithm is a conversion keeping its topology.
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
Asano, T., Bitou, S., Motoki, M., Usui, N.: In-Place Algorithm for Image Rotation. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 704–715. Springer, Heidelberg (2007)
Asano, T.: Constant-Working-Space Image Scan with a Given Angle. In: Proc. 24th European Workshop on Computational Geometry, Nancy, France, pp. 165–168 (2008)
Asano, T., Bereg, S., Kirkpatrick, D.: Finding Nearest Larger Neighbors: A Case Study in Algorithm Design and Analysis. In: Albers, S., Alt, H., Näher, S. (eds.) Festshrift Mehlhorn. LNCS, vol. 5760, pp. 249–260. Springer, Heidelberg (2009)
Asano, T., Bereg, S., Buzer, L., Kirkpatrick, D.: Binary Image Processing with Limited Storag (unpublished paper)
Asano, T., Tanaka, H.: Constant-Working Space Algorithm for Connected Components Labeling. Technical Report, Special Interest Group on Computation, IEICE of Japan (2008)
Bose, P., Morin, P.: An improved algorithm for subdivision traversal without extra storage. International Journal of Computational Geometry and Applications 12(4), 297–308 (2002)
Brönnimann, H., Chen, E.Y., Chan, T.M.: Towards in-place geometric algorithms and data structures. In: Proc. 20th Annual ACM Symposium on Computational Geometry, pp. 239–246 (2004)
de Berg, M., van Kreveld, M., van Oostrum, R., Overmars, M.: Simple traversal of a subdivision without extra storage. International Journal of Geographical Information Science 11(4), 359–373 (1997)
Malgouyresa, R., Moreb, M.: On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. Theoretical Computer Science 283, 67–108 (2002)
Rosenfeld, A.: Connectivity in Digital Pictures. Journal of ACM 17(3), 146–160 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T. (2010). Do We Need a Stack to Erase a Component in a Binary Image?. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)