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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Haxhimusa, Y., Glantz, R., Saib, M., Langs, G., & Kropatsch, W. G. (2002). Logarithmic tapering graph pyramid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2449 LNCS, pp. 117–124). Springer Verlag. https://doi.org/10.1007/3-540-45783-6_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
