Graph-Based Representations in Pattern Recognition : 5th IAPR International Workshop, GbRPR 2005, Poitiers, France, April 11-13, 2005, Proceedings
by Brun, Luc; Vento, MarioFormat: Paperback
Pub. Date: 2005-09-15
Publisher(s): Springer Verlag
Other versions by this Author
List Price: $117.77
Rent Textbook
Select for Price
Digital
$42.90*
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This book constitutes the refereed proceedings of the 5th IAPR International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2005, held in Poitiers, France in April 2005. The 18 revised full papers and 17 revised poster papers presented were carefully reviewed and selected from 50 submissions. The papers are organized in topical sections on graph representations, graphs and linear representations, combinatorial maps, matching, hierarchical graph abstraction and matching, inexact
Table of Contents
| 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. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.