The Redundancy Pyramid and Its Application to Segmentation on an Image Sequence
Irregular pyramids organize a sequence of partitions of images in such a way that each partition is deduced from the preceding one by union of some of its regions. In this paper, we show how a single pyramid can be used to encode redundant subparts of different partitions. We obtain a pyramid that accounts for the redundancy of the partitions. This structure, naturally called the redundancy pyramid, can be used for many purposes. We also demonstrate and discuss some applications for studying image sequences.
KeywordsGreat Common Divisor Regional Cover Common Multiple Contour Point Good Segmentation
Unable to display preview. Download preview PDF.
- 1.Brun, L., Kropatsch, W.G.: Construction of combinatorial pyramids. In: Proceedings of the 4th IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pp. 1–12 (2003)Google Scholar
- 3.Förstner, W.: Generic estimation procedures for orientation with minimum redundant information. 2nd Course on Digital Photogrammetry (1999)Google Scholar
- 4.Keselman, Y., Dickinson, S.: Generic model abstraction from examples. In: Proc. IEEE Conference CVPR, December 2001, vol. 1, pp. 856–863 (2001)Google Scholar