Skip to main content
SpringerLink
Log in

Logarithmic Tapering Graph Pyramid

  • Conference paper
  • First Online:
Pattern Recognition (DAGM 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2449))

Included in the following conference series:

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BCR90. M. Bister, J. Cornelis, and Azriel Rosenfeld. A critical view of pyramid segmentation algorithms. Pattern Recognition Letters, 11(9):605–617, 1990.

    Article  MATH  Google Scholar 

  • Chr75. N. Christofides. Graph theory-an algorithmic approach. Academic Press, New York, 1975.

    MATH  Google Scholar 

  • Die97. Reinhard Diestel. Graph Theory. Springer, New York, 1997.

    MATH  Google Scholar 

  • 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.

    MATH  Google Scholar 

  • Jol02. Jean-Michel Jolion. Stochastic pyramid revisited. Pattern Recognition Letters. To appear, 2002.

    Google Scholar 

  • JR94. J.M. Jolion and Azriel Rosenfeld. A Pyramid Framework for Early Vision. Kluwer Academic Publishers, Dordrecht, Netherlands, 1994.

    Google Scholar 

  • 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.

    MATH  MathSciNet  Google Scholar 

  • 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.

    Google Scholar 

  • Kro95. Walter G. Kropatsch. Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing, 142(6):366–374, 1995.

    Article  Google Scholar 

  • Mee89. Peter Meer. Stochastic image pyramids. CVGIP, 45:269–294, 1989.

    Google Scholar 

  • 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Pattern Recognition and Image Processing Group 183/2 Institute for Computer Aided Automation, Vienna University of Technology, Favoritenstrasse 9, A-1040, Vienna, Austria

    Yll Haxhimusa, Maamar Saib, Georg Langs & Walter G. Kropatsch

  2. Dipartimento di Informatica, Università di Ca’ Foscari di Venezia, Via Torino 155, 30172, Mestre (VE), Italy

    Roland Glantz

Authors
  1. Yll Haxhimusa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Glantz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maamar Saib
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Georg Langs
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Walter G. Kropatsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Vision Laboratory, ETH Zürich, Gloriastrasse 35, 8092, Zürich, Switzerland

    Luc Van Gool

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation