Vision by Graph Pyramids

To efficiently process huge amounts of structured sensory data for vision, graph pyramids are proposed. Hierarchies of graphs can be generated by dual graph contraction. The goal is to reduce the data structure by a constant reduction factor while preserving certain image properties, like connectivity. While implemented versions solve several technical vision problems like image segmentation, the framework can be used as a model for biological systems, too.

[1]  Pascal Lienhardt,et al.  Subdivisions of n-dimensional spaces and n-dimensional generalized maps , 1989, SCG '89.

[2]  Leonard Uhr,et al.  The Several Steps from Icon to Symbol Using Structured Cone/Pyramids , 1984 .

[3]  Walter G. Kropatsch,et al.  A Minimal Line Property Preserving Representation of Line Images , 1999, Computing.

[4]  Walter G. Kropatsch,et al.  Equivalent contraction kernels to build dual irregular pyramids , 1996, TFCV.

[5]  J. van Leeuwen,et al.  Graph Based Representations in Pattern Recognition , 2003, Lecture Notes in Computer Science.

[6]  Azriel Rosenfeld,et al.  A critical view of pyramid segmentation algorithms , 1990, Pattern Recognit. Lett..

[7]  Jean-Michel Jolion,et al.  Graph Based Representations in Pattern Recognition , 1998, Computing Supplement.

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

[9]  Azriel Rosenfeld,et al.  Local deformations of digital curves , 1997, Pattern Recognit. Lett..

[10]  A. Rosenfeld,et al.  Curve Detection in a Noisy Image , 1997, Vision Research.

[11]  Jean-Michel Jolion,et al.  Object matching on irregular pyramid , 1998, Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170).

[12]  Edward H. Adelson,et al.  The Laplacian Pyramid as a Compact Image Code , 1983, IEEE Trans. Commun..

[13]  G. Jones,et al.  Theory of Maps on Orientable Surfaces , 1978 .

[14]  Walter G. Kropatsch,et al.  Universal segmentation with PIRRAMIDS , 1996 .

[15]  Azriel Rosenfeld,et al.  A Pyramid Framework for Early Vision , 1994 .

[16]  M. N. Shanmukha Swamy,et al.  Graphs - theory and algorithms , 1992 .

[17]  Walter G. Kropatsch.  Finding Connected Components with Dual Irregular Pyramids Tu Vienna, Institute for Automation 183/2 Department for Pattern Recognition Und Image Processing , 1995 .