Guided Relinking of Graph Pyramids
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.
KeywordsSpan Tree Plane Graph Dual Graph Graph Grammar Span Forest
- [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
- [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
- [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
- [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