Guided Relinking of Graph Pyramids

  • R. Glantz
  • W. G. Kropatsch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1876)

Abstract

In this paper we propose a new method to relink graph pyramids by local relinking operations in an iterated parallel way. By representing graph pyramids as bases of valuated matroids, the goal of the relinking is expressed by a valuation on the corresponding matroid. This valuation guides the local relinking operations. The valuation attains its global maximum if none of the local relinking operations yields higher values. The new method is used for an adaption of graph pyramids towards having a given receptive field.

Keywords

Span Tree Plane Graph Dual Graph Graph Grammar Span Forest 
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

  1. [BHR81]
    P. J. Burt, T.-H. Hong, and Azriel Rosenfeld. Segmentation and esation of image region properties through cooperative hierarchical computation. IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-11 (No. 12):pp. 802–809, December 1981.CrossRefGoogle Scholar
  2. [Bru69]
    R.A. Brualdi. Comments on bases in dependence structures. Bull. Austral. Math. Soc., 21(3):161–167, 1969.MathSciNetCrossRefGoogle Scholar
  3. [DW90]
    W. M. Dress and Wenzel W. Valuated matroid: A new look to the greedy algorithm. Applied Mathmatics Letters, 3:33–35, 1990.MATHCrossRefMathSciNetGoogle Scholar
  4. [Kro95a]
    Walter G. Kropatsch. Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing, 142(6):366–374, 1995.CrossRefGoogle Scholar
  5. [Kro95b]
    Walter G. Kropatsch. Equivalent Contraction Kernels and The Domain of Dual Irregular Pyramids. Technical Report PRIP-TR-42, Institute f. Automation 183/2, Dept. for Pattern Recognition and Image Processing, TU Wien, Austria, 1995.Google Scholar
  6. [Nac95]
    Peter F.M. Nacken. Image segmentation by connectivity preserving relinking in hierarchical graph structures. Pattern Recognition, 28(6):907–920, June 1995.Google Scholar
  7. [Oxl92]
    J.G. Oxley. Matroid theory. Oxford University Press, New York, USA, 1992.MATHGoogle Scholar
  8. [Sch97]
    Andy Schürr. Handbook of Graph Grammars and Computing by Graph Transformations, chapter Programmed Graph Replacement Systems, pages 479–546. G. Rozenberg, 1997.Google Scholar
  9. [Ser82]
    Jean Serra. Image and Mathematical Morphology, volume 1. Academic Press, London, G.B., 1982.MATHGoogle Scholar
  10. [TS92]
    K. Thulasiraman and M.N.S. Swamy. Graphs: Theory and Algorithms. J. Wiley & Sons, New York, USA, 1992.MATHGoogle Scholar
  11. [WH96]
    Richard C. Wilson and Edwin R. Hancock. Hierarchical Discrete Relaxation. In Petra Perner, Patrick Wang, and Azriel Rosenfeld, editors, Proceedings SSPR’ 96, Advances in Structural and Syntactical Pattern Recognition, volume Vol. 1121 of Lecture Notes in Computer Science, pages 120–129, Lipzig, Germany, 1996. Springer, Berlin Heidelberg, New York.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • R. Glantz
    • 1
  • W. G. Kropatsch
    • 1
  1. 1.Institute for Computer Aided Automation Pattern Recognition and Image Processing GroupVienna University of TechnologyViennaAustria

Personalised recommendations