Hypergraph-based image representation | p. 1 |
Vectorized image segmentation via trixel agglomeration | p. 12 |
Graph transformation in document image analysis : approaches and challenges | p. 23 |
Graphical knowledge management in graphics recognition systems | p. 35 |
A vascular network growth estimation algorithm using random graphs | p. 45 |
A linear generative model for graph structure | p. 54 |
Graph seriation using semi-definite programming | p. 63 |
Comparing string representations and distances in a natural images classification task | p. 72 |
Reduction strings : a representation of symbolic hierarchical graphs suitable for learning | p. 82 |
Representing and segmenting 2D images by means of planar maps with discrete embeddings : from model to applications | p. 92 |
Inside and outside within combinatorial pyramids | p. 122 |
The GeoMap : a unified representation for topology and geometry | p. 132 |
Pyramids of n-Dimensional generalized maps | p. 142 |
Towards unitary representations for graph matching | p. 153 |
A direct algorithm to find a largest common connected induced subgraph of two graphs | p. 162 |
Reactive tabu search for measuring graph similarity | p. 172 |
Tree matching applied to vascular system | p. 183 |
A graph-based, multi-resolution algorithm for tracking objects in presence of occlusions | p. 193 |
Coarse-to-fine object recognition using shock graphs | p. 203 |
Adaptive pyramid and semantic graph : knowledge driven segmentation | p. 213 |
A graph-based concept for spatiotemporal information in cognitive vision | p. 223 |
Approximating the problem, not the solution : an alternative view of point set matching | p. 233 |
Defining consistency to detect change using inexact graph matching | p. 243 |
Asymmetric inexact matching of spatially-attributed graphs | p. 253 |
From exact to approximate maximum common subgraph | p. 263 |
Automatic learning of structural models of cartographic objects | p. 273 |
An experimental comparison of fingerprint classification methods using graphs | p. 281 |
Collaboration between statistical and structural approaches for old handwritten characters recognition | p. 291 |
Decision trees for error-tolerant graph database filtering | p. 301 |
Recovery of missing information in graph sequences | p. 312 |
Tree-based tracking of temporal image | p. 322 |
Protein classification with kernelized softassign | p. 332 |
Local entropic graphs for globally-consistent graph matching | p. 342 |
Edit distance based kernel functions for attributed graph matching | p. 352 |
A robust graph partition method from the path-weighted adjacency matrix | p. 362 |
Recent results on heat kernel embedding of graphs | p. 373 |
Table of Contents provided by Blackwell. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.