论文信息 - Guided Relinking of Graph Pyramids

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.

Walter G. Kropatsch | Roland Glantz | W. Kropatsch | R. Glantz

[1] R. Brualdi. Comments on bases in dependence structures , 1969, Bulletin of the Australian Mathematical Society.

[2] Peter F. M. Nacken. Image segmentation by connectivity preserving relinking in hierarchical graph structures , 1995, Pattern Recognit..

[3] Walter Wenzel,et al. Valuated matroids: a new look at the greedy algorithm , 1989 .

[4] W. Kropatsch. Building irregular pyramids by dual-graph contraction , 1995 .

[5] M. N. S. Swamy,et al. Graphs: Theory and Algorithms: Thulasiraman/Graphs , 1992 .

[6] M. N. Shanmukha Swamy,et al. Graphs: Theory and Algorithms , 1992 .

[7] Edwin R. Hancock,et al. Hierarchical Discrete Relaxation , 1996, SSPR.

[8] N. N. Chourasia,et al. Paranormal operators on Banach spaces , 1980, Bulletin of the Australian Mathematical Society.

[9] Azriel Rosenfeld,et al. Segmentation and Estimation of Image Region Properties through Cooperative Hierarchial Computation , 1981, IEEE Transactions on Systems, Man, and Cybernetics.