Abstract
We present a new method to determine contraction kernels for the construction of graph pyramids. The new method works with undirected graphs and yields a reduction factor of at least 2.0. This means that with our method the number of vertices in the subgraph induced by any set of contractible edges is reduced to half or less by a single parallel contraction. Our method yields better reduction factors than the stochastic decimation algorithm, in all tests. The lower bound of the reduction factor becomes crucial with large images.
This paper has been supported by the Austrian Science Fund under grants P14445-MAT and P14662-INF
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
BCR90. M. Bister, J. Cornelis, and Azriel Rosenfeld. A critical view of pyramid segmentation algorithms. Pattern Recognition Letters, 11(9):605–617, 1990.
Chr75. N. Christofides. Graph theory-an algorithmic approach. Academic Press, New York, 1975.
Die97. Reinhard Diestel. Graph Theory. Springer, New York, 1997.
JM92. Jean-Michel Jolion and Annick Montanvert. The adaptive pyramid, a framework for 2D image analysis. Computer Vision, Graphics, and Image Processing: Image Understanding, 55(3):pp.339–348, May 1992.
Jol02. Jean-Michel Jolion. Stochastic pyramid revisited. Pattern Recognition Letters. To appear, 2002.
JR94. J.M. Jolion and Azriel Rosenfeld. A Pyramid Framework for Early Vision. Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.
KLB99. Walter G. Kropatsch, Aleš Leonardis, and Horst Bischof. Hierarchical, Adaptive and Robust Methods for Image Understanding. Surveys on Mathematics for Industry, No.9:1–47, 1999.
KM95. Walter G. Kropatsch and Herwig Macho. Finding the structure of connected components using dual irregular pyramids. In Cinquième Colloque DGCI, pages 147–158. LLAIC1, Université d’Auvergne, September 1995.
Kro95. Walter G. Kropatsch. Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing, 142(6):366–374, 1995.
Mee89. Peter Meer. Stochastic image pyramids. CVGIP, 45:269–294, 1989.
MMR91. Annick Montanvert, Peter Meer, and Azriel Rosenfeld. Hierarchical image analysis using irregular tesselations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):pp.307–316, April 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haxhimusa, Y., Glantz, R., Saib, M., Langs, G., Kropatsch, W.G. (2002). Logarithmic Tapering Graph Pyramid. In: Van Gool, L. (eds) Pattern Recognition. DAGM 2002. Lecture Notes in Computer Science, vol 2449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45783-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-45783-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44209-7
Online ISBN: 978-3-540-45783-1
eBook Packages: Springer Book Archive