Graph-based representations and techniques for image processing and image analysis

In this paper we will discuss the use of some graph-based representations and techniques for image processing and analysis. Instead of making an extensive review of the graph techniques in this field, we will explain how we are using these techniques in an active vision system for an autonomous mobile robot developed in the Institut de Robotica i Informatica Industrial within the project “Active Vision System with Automatic Learning Capacity for Industrial Applications (CICYT TAP98-0473)”. Specifically we will discuss the use of graph-based representations and techniques for image segmentation, image perceptual grouping and object recognition. We first present a generalisation of a graph partitioning greedy algorithm for colour image segmentation. Next we describe a novel fusion of colour-based segmentation and depth from stereo that yields a graph representing every object in the scene. Finally we describe a new representation of a set of attributed graphs (AGs), denominated Function Described Graphs (FDGs), a distance measure for matching AGs with FDGs and some applications for robot vision.

[1]  Alberto Sanfeliu,et al.  Efficient algorithms for matching attributed graphs and function-described graphs , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[2]  A. Constantinides,et al.  Graph—theoretical approach to colour picture segmentation and contour classification , 1993 .

[3]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Horst Bunke,et al.  Syntactic and structural pattern recognition : theory and applications , 1990 .

[5]  Alberto Sanfeliu,et al.  Colour image segmentation solving hard-constraints on graph partitioning greedy algorithms , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[6]  Andrew K. C. Wong,et al.  Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Alfredo Petrosino,et al.  Image Analysis and Processing , 2016, Springer US.

[8]  Alberto Sanfeliu,et al.  Integration of perceptual grouping and depth , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[9]  Alberto Sanfeliu,et al.  Clustering of attributed graphs and unsupervised synthesis of function-described graphs , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[10]  Alberto Sanfeliu,et al.  Synthesis of Function-Described Graphs , 1998, SSPR/SPR.

[11]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Alberto Sanfeliu,et al.  Function-Described Graphs Applied to 3D Object Representation , 1997, ICIAP.

[13]  Horst Bunke,et al.  Recent developments in graph matching , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[14]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Daniel P. Huttenlocher,et al.  Image segmentation using local variation , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[16]  Béla Bollobás,et al.  Random Graphs , 1985 .

[17]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  M. Inés Torres,et al.  Pattern recognition and applications , 2000 .

[19]  Ying Xu,et al.  2D image segmentation using minimum spanning trees , 1997, Image Vis. Comput..