Abstract
The Bounded Irregular Pyramid (BIP) is a mixture of regular and irregular pyramids whose goal is to combine their advantages. Thus, its data structure combines a regular decimation process with a union-find strategy to build the successive levels of the structure. The irregular part of the BIP allows to solve the main problems of regular structures: their inability to preserve connectivity or to represent elongated objects. On the other hand, the BIP is computationally efficient because its height is constrained by its regular part. In this paper the features of the Bounded Irregular Pyramid are discussed, presenting a comparison with the main pyramids present in the literature when applied to a colour segmentation task.
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
Brun, L., Kropatsch, W.: Construction of Combinatorial Pyramids. In: Hancock, E., Vento, M. (eds.) GbR in Pattern Recognition, pp. 1–12. Springer, Heidelberg (2003)
Burt, P., Hong, T., Rosenfeld, A.: Segmentation and estimation of image region properties through cooperative hierarchical computation. IEEE Trans. on Systems, Man And Cybernetics 11(12), 802–809 (1981)
Hong, T., Rosenfeld, A.: Compact region extraction using weighted pixel linking in a pyramid. IEEE Trans. on Pattern Anal. Machine Intell. 6(2), 222–229 (1984)
Marfil, R., Molina-Tanco, L., Bandera, A., Rodriguez, J., Sandoval, F.: Pyramid segmentation algorithms revisited. Pattern Recognition 39(8), 1430–1451 (2006)
Bertolino, P., Montanvert, A.: Multiresolution segmentation using the irregular pyramid. Int. Conf. On Image Processing 1, 257–260 (1996)
Haxhimusa, Y., Kropatsch, W.: Segmentation graph hierarchies. In: Proceedings of the Joint IAPR International Workshop on Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition, pp. 343–351 (2004)
Lallich, S., Muhlenbach, F., Jolion, J.: A test to control a region growing process within a hierarchical graph. Pattern Recognition 36, 2201–2211 (2003)
Huart, J., Bertolino, P.: Similarity-based and perception-based image segmentation. IEEE. Int. Conf. on Image Processing - ICIP 2005 3, 1148–1151 (2005)
Marfil, R., Rodriguez, J., Bandera, A., Sandoval, F.: Bounded irregular pyramid: a new structure for colour image segmentation. Pattern Recognition 37(3), 623–626 (2004)
Tarjan, R.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22, 215–225 (1975)
Borsotti, M., Campadelli, P., Schettini, R.: Quantitative evaluation of color image segmentation results. Pattern Recognition Letters 19, 741–747 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marfil, R., Molina-Tanco, L., Bandera, A., Sandoval, F. (2007). The Construction of Bounded Irregular Pyramids with a Union-Find Decimation Process. In: Escolano, F., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2007. Lecture Notes in Computer Science, vol 4538. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72903-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-72903-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72902-0
Online ISBN: 978-3-540-72903-7
eBook Packages: Computer ScienceComputer Science (R0)