The Construction of Bounded Irregular Pyramids with a Union-Find Decimation Process
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.
KeywordsRegular Part Virtual Node Irregular Structure Regular Node Parent Link
Unable to display preview. Download preview PDF.
- 1.Brun, L., Kropatsch, W.: Construction of Combinatorial Pyramids. In: Hancock, E., Vento, M. (eds.) GbR in Pattern Recognition, pp. 1–12. Springer, Heidelberg (2003)Google Scholar
- 5.Bertolino, P., Montanvert, A.: Multiresolution segmentation using the irregular pyramid. Int. Conf. On Image Processing 1, 257–260 (1996)Google Scholar
- 6.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)Google Scholar
- 8.Huart, J., Bertolino, P.: Similarity-based and perception-based image segmentation. IEEE. Int. Conf. on Image Processing - ICIP 2005 3, 1148–1151 (2005)Google Scholar