| Bipartite graph matching for computing the edit distance of graphs | p. 1 |
| Matching of tree structures for registration of medical images | p. 13 |
| Graph-based methods for retinal mosaicing and vascular characterization | p. 25 |
| Stereo vision for obstacle detection : a graph-based approach | p. 37 |
| Graph based shapes representation and recognition | p. 49 |
| A continuous-based approach for partial clique enumeration | p. 61 |
| A bound for non-subgraph isomorphism | p. 71 |
| A correspondence measure for graph matching using the discrete quantum walk | p. 81 |
| A quadratic programming approach to the graph edit distance problem | p. 92 |
| Image classification using marginalized kernels for graphs | p. 103 |
| Comparing sets of 3D digital shapes through topological structures | p. 114 |
| Hierarchy construction schemes within the scale set framework | p. 126 |
| Local reasoning in fuzzy attribute graphs for optimizing sequential segmentation | p. 138 |
| Graph-based perceptual segmentation of stereo vision 3D images at multiple abstraction levels | p. 148 |
| Morphological operators for flooding, leveling and filtering images using graphs | p. 158 |
| Graph-based multilevel temporal segmentation of scripted content videos | p. 168 |
| Deducing local influence neighbourhoods with application to edge-preserving image denoising | p. 180 |
| Graph spectral image smoothing | p. 191 |
| Probabilistic relaxation labeling by Fokker-Planck diffusion on a graph | p. 204 |
| Assessing the performance of a graph-based clustering algorithm | p. 215 |
| A new greedy algorithm for improving b-Coloring clustering | p. 228 |
| Qualitative spatial relationships for image interpretation by using semantic graph | p. 240 |
| Separation of the retinal vascular graph in arteries and veins | p. 251 |
| A fast construction of the distance graph used for the classification of heterogeneous electron microscopic projections | p. 263 |
| An efficient ontology based export peering system | p. 273 |
| Computing homology group generators of images using irregular graph pyramids | p. 283 |
| Approximating TSP solution by MST based graph pyramid | p. 295 |
| The construction of bounded irregular pyramids with a union-find decimation process | p. 307 |
| A new contour filling algorithm based on 2D topological map | p. 319 |
| Extending the notion of AT-model for integer homology computation | p. 330 |
| Constellations and the unsupervised learning of graphs | p. 340 |
| On the relation between the median and the maximum common subgraph of a set of graphs | p. 351 |
| A graph classification approach using a multi-objective genetic algorithm application to symbol recognition | p. 361 |
| Graph embedding using quantum commute times | p. 371 |
| Graph embedding in vector spaces by means of prototype selection | p. 383 |
| Grouping using factor graphs : an approach for finding text with a camera phone | p. 394 |
| Generalized vs set median strings for histogram-based distances : algorithms and classification results in the image domain | p. 404 |
| Table of Contents provided by Blackwell. All Rights Reserved. |