Graph Based Representations in Pattern Recognition
Editat de Edwin Hancock, Mario Ventoen Limba Engleză Paperback – 18 iun 2003
Preț: 321.36 lei
Preț vechi: 401.70 lei
-20%
Puncte Express: 482
Carte tipărită la comandă
Livrare economică 28 iulie-11 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540404521
ISBN-10: 354040452X
Pagini: 284
Ilustrații: VIII, 276 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354040452X
Pagini: 284
Ilustrații: VIII, 276 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Data Structures and Representation.- Construction of Combinatorial Pyramids.- On Graphs with Unique Node Labels.- Constructing Stochastic Pyramids by MIDES — Maximal Independent Directed Edge Set.- Segmentation.- Functional Modeling of Structured Images.- Building of Symbolic Hierarchical Graphs for Feature Extraction.- Comparison and Convergence of Two Topological Models for 3D Image Segmentation.- Graph Edit Distance.- Tree Edit Distance from Information Theory.- Self-Organizing Graph Edit Distance.- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification.- Graph Matching.- Orthonormal Kernel Kronecker Product Graph Mdatching.- Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering.- A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs.- Swap Strategies for Graph Matching.- Matrix Methods.- Graph Matching Using Spectral Seriation and String Edit Distance.- Graph Polynomials, Principal Pivoting, and Maximum Independent Sets.- Graph Partition for Matching.- Graph Clustering.- Spectral Clustering of Graphs.- Comparison of Distance Measures for Graph-Based Clustering of Documents.- Some Experiments on Clustering a Set of Strings.- A New Median Graph Algorithm.- Graph Clustering Using the Weighted Minimum Common Supergraph.- ACM Attributed Graph Clustering for Learning Classes of Images.- A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures.